-
Article
Invariant subspaces for tightly clustered eigenvalues of tridiagonals
The invariant subspace of a real symmetric tridiagonal matrixT associated with a tight cluster ofm eigenvalues has a special structure. This structure is revealed by the envelope of the subspace (defined in Secti...
-
Chapter
Accurate Singular Values and Differential QD Algorithms
In September 1991 J. W. Demmel and W. M. Kahan were awarded the second SIAM prize in numerical linear algebra for their paper ‘Accurate Singular Values of Bidiagonal Matrices’ [1], referred to as DK hereafter....
-
Chapter
Implementation Of Lanczos Algorithms on Vector Computers
We report on two recent studies [17],[18] in which the Lanczos algorithm was transported to a vector machine. The results suggest that our present implementations cannot exploit the full power of Class VI mach...
-
Article
Eigenvector matrices of symmetric tridiagonals
A simple test is given for determining whether a given matrix is the eigenvector matrix of an (unknown) unreduced symmetric tridiagonal matrix. A list of known necessary conditions is also provided. A lower bo...
-
Article
Presentation geometrique des methodes de calcul des valeurs propres
We present a survey of recent work on the convergence of methods for computing eigenvalues and eigenvectors of matrices. We try to maintain a geometric point of view and give pride of place to the γR algorithm.
-
Chapter
Balancing a Matrix for Calculation of Eigenvalues and Eigenvectors
This algorithm is based on the work of Osborne [1]. He pointed out that existing eigenvalue programs usually produce results with errors at least of order ε∥A∥ E , where s is the...
-
Chapter
Balancing a Matrix for Calculation of Eigenvalues and Eigenvectors
This algorithm is based on the work of Osborne [1]. He pointed out that existing eigenvalue programs usually produce results with errors at least of order ε‖A‖ E , where is the m...
-
Article
The uniform convergence of matrix powers