The spectral transformation Lánczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems

Ericsson, Thomas; Ruhe, Axel

doi:10.1090/S0025-5718-1980-0583502-2

The spectral transformation Lánczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems

Authors: Thomas Ericsson and Axel Ruhe
Journal: Math. Comp. 35 (1980), 1251-1268
MSC: Primary 65F15; Secondary 15A18, 65N30
DOI: https://doi.org/10.1090/S0025-5718-1980-0583502-2
MathSciNet review: 583502
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A new algorithm is developed which computes a specified number of eigenvalues in any part of the spectrum of a generalized symmetric matrix eigenvalue problem. It uses a linear system routine (factorization and solution) as a tool for applying the Lanczos algorithm to a shifted and inverted problem. The algorithm determines a sequence of shifts and checks that all eigenvalues get computed in the intervals between them.

It is shown that for each shift several eigenvectors will converge after very few steps of the Lanczos algorithm, and the most effective combination of shifts and Lanczos runs is determined for different sizes and sparsity properties of the matrices. For large problems the operation counts are about five times smaller than for traditional subspace iteration methods.

Tests on a numerical example, arising from a finite element computation of a nuclear power piping system, are reported, and it is shown how the performance predicted bears out in a practical situation.

[1] T. J. A. AGAR &. A. JENNINGS, Hybrid Sturm Sequence and Simultaneous Iteration Methods, Internat. Sympos. Appl. of Computer Methods in Engineering, Univ. of Southern California, Los Angeles, Calif., 1977, pp. 405-412.
[2] J. H. Argyris, Th. L. Johnsen, R. A. Rosanoff, and J. R. Roy, On numerical error in the finite element method, Comput. Methods Appl. Mech. Engrg. 7 (1976), no. 2, 261–282. MR 657963, https://doi.org/10.1016/0045-7825(76)90017-7
[3] K. J. BATHE & E. L. WILSON, Numerical Methods in Finite Element Analysis, Prentice-Hall, Englewood Cliffs, N.J., 1976.
[4] James R. Bunch and Linda Kaufman, Some stable methods for calculating inertia and solving symmetric linear systems, Math. Comp. 31 (1977), no. 137, 163–179. MR 428694, https://doi.org/10.1090/S0025-5718-1977-0428694-0
[5] J. Alan George, Solution of linear systems of equations: direct methods for finite element problems, Sparse matrix techniques (Adv. Course, Technical Univ. Denmark, Copenhagen, 1976) Springer, Berlin, 1977, pp. 52–101. Lecture Notes in Math., Vol. 572. MR 0440883
[6] Paul S. Jensen, The solution of large symmetric eigenproblems by sectioning, SIAM J. Numer. Anal. 9 (1972), 534–545. MR 315880, https://doi.org/10.1137/0709049
[7] C. C. Paige, Practical use of the symmetric Lanczos process with re-orthogonalization, Nordisk Tidskr. Informationsbehandling (BIT) 10 (1970), 183–195. MR 264839, https://doi.org/10.1007/bf01936866
[8] C. C. Paige, Computational variants of the Lanczos method for the eigenproblem, J. Inst. Math. Appl. 10 (1972), 373–381. MR 334480
[9] Beresford N. Parlett, The symmetric eigenvalue problem, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1980. Prentice-Hall Series in Computational Mathematics. MR 570116
[10] B. N. Parlett and D. S. Scott, The Lanczos algorithm with selective orthogonalization, Math. Comp. 33 (1979), no. 145, 217–238. MR 514820, https://doi.org/10.1090/S0025-5718-1979-0514820-3
[11] Axel Ruhe, Computation of eigenvalues and eigenvectors, Sparse matrix techniques (Adv. Course, Technical Univ. Denmark, Copenhagen, 1976) Springer, Berlin, 1977, pp. 130–184. Lecture Notes in Math., Vol. 572. MR 0440891
[12] B. T. SMITH ET AL., Matrix Eigensystem Routines EISPACK Guide, Lecture Notes in Comput. Sci., Vol. 6 and Vol. 51, Springer-Verlag, Berlin and New York, 1974, 1977.
[13] Gilbert Strang and George J. Fix, An analysis of the finite element method, Prentice-Hall, Inc., Englewood Cliffs, N. J., 1973. Prentice-Hall Series in Automatic Computation. MR 0443377
[14] R. UNDERWOOD, An Iterative Block Lanczos Method for the Solution of Large Sparse Symmetric Eigenproblems, Tech. Report STAN-CS-75-496, Stanford University, Stanford, Calif., 1975.
[15] Handbook for automatic computation. Vol. II, Springer-Verlag, New York-Heidelberg, 1971. Linear algebra; Compiled by J. H. Wilkinson and C. Reinsch; Die Grundlehren der Mathematischen Wissenschaften, Band 186. MR 0461856