Computing Invariant Subspaces of a General Matrix when the Eigensystem is Poorly Conditioned

DOI10.2307/2004882zbMath0195.45101OpenAlexW4244877299MaRDI QIDQ5591866

James M. Varah

Publication date: 1970

Full work available at URL: https://doi.org/10.2307/2004882

zbMATH Keywords

numerical analysis

Related Items

A generalized nonsymmetric Lanczos procedure, On estimating the condition of eigenvalues and eigenvectors, PseudoS-spectrum in a right quaternionic Hilbert space, Perturbation bounds for means of eigenvalues and invariant subspaces, Computational methods of linear algebra, An algorithm for numerical determination of the structure of a general matrix, Absolute and relative perturbation bounds for invariant subspaces of matrices, Properties of a matrix with a very ill-conditioned eigenproblem, Relative perturbation results for eigenvalues and eigenvectors of diagonalisable matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimally scaled matrices
• The Calculation of the Eigenvectors of a General Complex Matrix by Inverse Iteration
• Rigorous Machine Bounds for the Eigensystem of a General Complex Matrix
• The Rotation of Eigenvectors by a Perturbation. III