Computation of generalized eigenvectors
Let us assume that the \(n\times n\) matrix A and its eigenvalues \(\nu_ 1,\nu_ 2,...,\nu_ n\) are given together with some criterion to decide which of these eigenvalues are multiple and that the result of this grouping and approximation is the list of eigenvalues \(\lambda_ 1,\lambda_ 2,...\lambda_ p\), where \(p\leq n\). The \(\lambda_ j's\) are distinct in that \(j\neq k\) implies \(\lambda_ j\neq \lambda_ k.\) The algorithm described in the paper generates the Jordan form of a matrix by simultaneously computing the eigenstructure and associated eigenvector-generalized eigenvector chains. It does this by systematically finding vectors which can serve as ends of chains, starting with the shortest chains and increasing the length until the invariant subspaces are exhausted. The algorithm is straightforward, and can be implemented in code by a computer programmer of average ability.
- Eigenvectors and reconstruction
- Computing the eigenvectors of a matrix with multiplex eigenvalues by the SVD method
- Computing Eigenvalues and Eigenvectors without Determinants
- Computation of Jordan chains by generalized characteristic matrices
- Computation of eigenvalue and eigenvector derivatives for a general complex-valued eigensystem
- scientific article; zbMATH DE number 3903849 (Why is no real title available?)
- scientific article; zbMATH DE number 4126598 (Why is no real title available?)
- scientific article; zbMATH DE number 1240688 (Why is no real title available?)
- Generalized Commuting Matrices and Their Eigenvectors for DFTs, Offset DFTs, and Other Periodic Operations
- scientific article; zbMATH DE number 2095815 (Why is no real title available?)
- Eigenvalues and Eigenvectors: Generalized and Determinant Free
This page was built for publication: Computation of generalized eigenvectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824352)
