TOPICS
Search

Generalized Eigenvalue


A generalized eigenvalue of a pair of n×n matrices (A,B) is a scalar lambda for which there is a nonzero vector v satisfying

 Av=lambdaBv.

The vector v is called a generalized eigenvector of the matrix pair. The problem of finding such pairs (lambda,v) is called a generalized eigenvalue problem.

If B is a nonsingular matrix, the generalized eigenvalues are the ordinary eigenvalues of B^(-1)A. More generally, when the polynomial det(A-lambdaB) is not identically zero, the finite generalized eigenvalues are its roots, which satisfy

 det(A-lambdaB)=0.

This formulation includes many problems with constraints or nonstandard inner products without explicitly forming the matrix inverse of B.

The term generalized eigenvector is also used for a different concept associated with a single matrix.


See also

Determinant, Eigenvalue, Generalized Eigenvector, Matrix Inverse

Explore with Wolfram|Alpha

References

Golub, G. H. and Van Loan, C. F. Matrix Computations, 4th ed. Baltimore, MD: Johns Hopkins University Press, 2013.

Cite this as:

Weisstein, Eric W. "Generalized Eigenvalue." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GeneralizedEigenvalue.html

Subject classifications