Computing Invariant Subspaces of a General Matrix when the Eigensystem is Poorly Conditioned
- 1 January 1970
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 24 (109) , 137-149
- https://doi.org/10.2307/2004882
Abstract
The problem of calculating the eigensystem of a general complex matrix is well known. In many cases, however, the eigensystem is poorly determined numerically in the sense that small changes in the matrix can cause large changes in the eigensystem. For these matrices, a decomposition into higher-dimensional invariant subspaces is desirable. In this paper we define a class of matrices where this is true, and propose a technique for calculating bases for these invariant subspaces. We show that for this class the technique provides basis vectors which are accurate and span the subspaces well.Keywords
This publication has 2 references indexed in Scilit:
- The Algebraic Eigenvalue ProblemMathematics of Computation, 1966
- Optimally scaled matricesNumerische Mathematik, 1963