How to implement the spectral transformation

Nour-Omid, Bahram; Parlett, Beresford N.; Ericsson, Thomas; Jensen, Paul S.

doi:10.1090/S0025-5718-1987-0878698-5

How to implement the spectral transformation
HTML articles powered by AMS MathViewer

by Bahram Nour-Omid, Beresford N. Parlett, Thomas Ericsson and Paul S. Jensen PDF

Math. Comp. 48 (1987), 663-673 Request permission

Abstract:

The general, linear eigenvalue equations $({\mathbf {H}} - \lambda {\mathbf {M}}){\mathbf {z}} = 0$, where H and M are real symmetric matrices with M positive semidefinite, must be transformed if the Lanczos algorithm is to be used to compute eigenpairs $(\lambda ,{\mathbf {z}})$. When the matrices are large and sparse (but not diagonal) some factorization must be performed as part of the transformation step. If we are interested in only a few eigenvalues $\lambda$ near a specified shift, then the spectral transformation of Ericsson and Ruhe [1] proved itself much superior to traditional methods of reduction. The purpose of this note is to show that a small variant of the spectral transformation is preferable in all respects. Perhaps the lack of symmetry in our formulation deterred previous investigators from choosing it. It arises in the use of inverse iteration. A second goal is to introduce a systematic modification of the computed Ritz vectors, which improves the accuracy when M is ill-conditioned or singular. We confine our attention to the simple Lanczos algorithm, although the first two sections apply directly to the block algorithms as well.

References

Thomas Ericsson and Axel Ruhe, The spectral transformation Lánczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems, Math. Comp. 35 (1980), no. 152, 1251–1268. MR 583502, DOI 10.1090/S0025-5718-1980-0583502-2
Cornelius Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Research Nat. Bur. Standards 45 (1950), 255–282. MR 0042791

Internat. J. Numer. Methods Engrg.

The Lanczos Algorithm for the Solution of Large Generalized Eigenproblems

Beresford N. Parlett, The symmetric eigenvalue problem, Prentice-Hall Series in Computational Mathematics, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1980. MR 570116
B. N. Parlett and B. Nour-Omid, The use of a refined error bound when updating eigenvalues of tridiagonals, Linear Algebra Appl. 68 (1985), 179–219. MR 794821, DOI 10.1016/0024-3795(85)90213-7
D. S. Scott, The advantages of inverted operators in Rayleigh-Ritz approximations, SIAM J. Sci. Statist. Comput. 3 (1982), no. 1, 68–75. MR 651868, DOI 10.1137/0903006