Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #12091

Re: Intersection over an index

From Daniel <dosadchy@its.jnj.com>
Newsgroups comp.soft-sys.math.mathematica
Subject Re: Intersection over an index
Date 2012-10-18 06:42 +0000
Message-ID <k5o8c8$ibd$1@smc.vnet.net> (permalink)
Organization Time-Warner Telecom

Show all headers | View raw


In this case you forgot to apply EigenVectors, but the problem of deciding whether two eigenvectors are the same is a bit more complex, because:
1. Mathematica does not normalize the eigenvectors.
2. If you normalize them, they can still differ in sign, and also due to numerical errors (for inexact numbers).
3. If not all eigenvalues are distinct, the eigenvectors that correspond to the same eigenvalues are "mixed" - in this case you might want to check whether eigenvector from one matrix can be represented as a linear combination of eigenvectors with the same eigenvalue from the second matrix.

Assuming all eigenvalues are distinct, you could compare eigenvectors v1 and v2 like this:

(1-Abs[Normalize[v1].Normalize[v2]]) < epsilon

epsilon - some small number
> Given a set of n many matrices A[k], I'd like to find
> any common eigenvectors. Using
> 
> Intersection[Table[Eigenvalues[A[k]],{k,1,n}] doesn't
> seem to work. For instance:
> 
> A[1] = {{-1, -3, 1}, {0, -3, 0}, {-1, -1, -1}};
> A[2] = {{-2, -1, 1}, {0, -1, 0}, {-1, 1, -2}};
> Intersection[Table[A[p], {p, 1, 2}]]
> 
> gives me 
> {{{-2, -1, 1}, {0, -1, 0}, {-1, 1, -2}}, {{-1, -3,
> 1}, {0, -3, 
>    0}, {-1, -1, -1}}}
> 
> 
> Any suggestions?
>

Back to comp.soft-sys.math.mathematica | Previous | Next | Find similar | Unroll thread


Thread

Re: Intersection over an index Daniel <dosadchy@its.jnj.com> - 2012-10-18 06:42 +0000

csiph-web