Generalized Nonsymmetric Eigenvalue Problems:
LAPACK Computational Routines
topicdescribes LAPACK routines for solving generalized nonsymmetric eigenvalue problems, reordering the generalized Schur factorization of a pair of matrices, as well as performing a number of related computational tasks.
(right generalized eigenvectors
(left generalized eigenvectors
"Computational Routines for Solving Generalized Nonsymmetric Eigenvalue Problems"lists LAPACK routines
(FORTRAN 77 interface)used to solve the generalized nonsymmetric eigenvalue problems and the generalized Sylvester equation.
The corresponding routine names in the Fortran 95 interface are without the first symbol.
Reduces a pair of matrices to generalized upper Hessenberg form using orthogonal/unitary transformations.
Balances a pair of general real or complex matrices.
Forms the right or left eigenvectors of a generalized eigenvalue problem.
Reduces a pair of matrices to generalized upper Hessenberg form.
Implements the QZ method for finding the generalized eigenvalues of the matrix pair (H,T).
Computes some or all of the right and/or left generalized eigenvectors of a pair of upper triangular matrices
Reorders the generalized Schur decomposition of a pair of matrices (A,B) so that one diagonal block of (A,B) moves to another row index.
Solves the generalized Sylvester equation.
Estimates reciprocal condition numbers for specified eigenvalues and/or eigenvectors of a pair of matrices in generalized real Schur canonical form.