Generalized eigenvectors/eigenvalues

  • #1
AxiomOfChoice
533
1
Mathematica has this command "Eigensystem[{m,a}]", which (to quote their documentation) "gives the generalized eigenvalues and eigenvectors of m with respect to a." I have never encountered this concept before, ever - that there can be eigenvectors of matrices with respect to other matrices. All I have ever come across is that [itex]\lambda[/itex] is a generalized eigenvalue of [itex]A[/itex] with generalized eigenvector [itex]\vec x[/itex] if there exists some [itex]p \in \mathbb N[/itex] such that [itex](A-\lambda I)^p\vec x = 0[/itex].

Can someone please explain what it *means* to be a "generalized eigenvalue or eigenvector" of m with respect to a? Maybe it is related to the concept I mentioned above, but if so, I don't see it.
 

Answers and Replies

  • #2
micromass
Staff Emeritus
Science Advisor
Homework Helper
Insights Author
22,178
3,305
Maybe it is answered in their documentation??
 
  • #3
AxiomOfChoice
533
1
Maybe it is answered in their documentation??

The only thing they provide is some dodgy example: If you let

[tex]
A = \begin{pmatrix} 1. & 2. \\ 3. & 4. \end{pmatrix}, \quad B = \begin{pmatrix} 1. & 4. \\ 9. & 16. \end{pmatrix},
[/tex]

(and they *HAVE* to be decimal entries; if you just put 1 (instead of 1.), you get an error, which just adds to the mystery), then "Eigensystem[{A,B}]" returns the following two complex eigenvalues and two vectors

[tex]
\begin{aligned}
&\{0.25 + 0.193649 I,
0.25 - 0.193649 I\}, \\
&[-0.848472 + 0.0858378 I, 0.498043 + 0.157099 I],\\
&[-0.848472 - 0.0858378 I, 0.498043 - 0.157099 I]
\end{aligned}[/tex]

...huh?
 
Last edited by a moderator:
  • #4
Mute
Homework Helper
1,388
12
If I recall correctly a generalized eigensystem is one for which

[tex]Ax = \lambda Bx[/tex]

for given matrices A and B.

EDIT: See here.
 
  • #6
AlephZero
Science Advisor
Homework Helper
7,025
297
A practical application of all this is the vibration of a flexible structure, where A and B represent the stiffness and mass properties. If the matrices are large and sparse (and often also Hermitian and positive semi-definite), solving the generalized eigenproblem is much more efficient than solving the equivalent problem [itex]B^{-1}Ax = \lambda x[/itex], (assuming B is invertible) because [itex]B^{-1}A[/itex] looks like an arbitrary full non-symmetric matrix with no obvious "special properties" to leading to a more efficient solution.

FWIW there are solution procedures that represent [itex]\lambda[/itex] as a ratio of two numbers, with conventions to represent the "indeterminate" or "infinte" eigenvalues and their corresponding vectors. The vectors are well defined and meaningful as the basis vectors of subspaces, even if the corresponding eigenvalues are not so well defined.
 

Suggested for: Generalized eigenvectors/eigenvalues

  • Last Post
Replies
10
Views
1K
  • Last Post
Replies
2
Views
583
  • Last Post
Replies
17
Views
1K
  • Last Post
Replies
1
Views
848
Replies
13
Views
343
Replies
3
Views
195
Replies
8
Views
458
Replies
3
Views
2K
  • Last Post
Replies
0
Views
721
Replies
1
Views
592
Top