Skip to main content

Abstract

The Lanczos algorithm, originally devised to tridiagonalize a matrix, is used for the generalized eigenvalue problem to operate on a whole subspace, yielding a block-tridiagonal matrix in the Krylov sequence of subspaces. To use prior information and enhance convergence, a subspace restart formulation is introduced. Global orthogonality of the iterated vectors is maintained by a double Gram-Schmidt re-orthogonalization.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differntial and integral operators, J. Res. Nat. Bureau Standards 45, 255–282 (1950)

    Google Scholar 

  2. C.C. Paige, Practical use of the symmetric Lanczos process with re-orthog-onalization, BIT 10, 183–195 (1970)

    Article  Google Scholar 

  3. C.C. Paige, Computational variants of the Lanczos method for the eigenproblem, J. Inst. Math. Appl. 10, 373–381 (1972)

    Article  Google Scholar 

  4. J.H. Wilkinson, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford (1965)

    Google Scholar 

  5. B.N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs (1980)

    Google Scholar 

  6. D.K. Faddeev & W.N. Faddeeva, Computational Methods of Linear Algebra, W.H. Freeman & Co., San Francisco (1963)

    Google Scholar 

  7. S. Pissantesky, Sparse Matrix Technology, Academic Press, New York (1984)

    Google Scholar 

  8. G. H. Golub & C. F van Loan, Matrix Computations, John Hopkins University Press, Baltimore, 1983

    Google Scholar 

  9. G.W. Stewart, A bibliographical tour of the large, sparse generalized eigenvalue problem, pp. 113–130 in J.R. Bunch & D.J. Rose eds., Sparse Matrix Computations, Academic Press, New York (1976)

    Google Scholar 

  10. A. Ruhe, Computation of eigenvalues and eigenvectors, in V.A. Barker ed., Sparse Matrix Techniques, Lect. Notes in Math. 572, Springer-Verlag, Berlin (1977)

    Google Scholar 

  11. J. Cullum & R.A. Willoughby, Lanczos and the computation of eigenvalues in specified intervals of the spectrum of large, sparse, real symmetric matrices, in I.A. Duff & G.W. Stewart eds., Sparse Matrix Proceedings 1978, SIAM, Philadelphia (1979)

    Google Scholar 

  12. B.N. Parlett & D.S. Scott, The Lanczos algorithm with selective orthogonalization, Math. of Comp. 33, 217–238 (1979)

    Article  Google Scholar 

  13. T. Ericsson & A. Ruhe, The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems, Math. of Comp. 35, 1251–1268 (1980)

    Google Scholar 

  14. P.C. Chowdhury, The truncated Lanczos algorithm for the partial solution of the symmetric eigenproblem, Computers & Structures 6, 439–446 (1976)

    Article  Google Scholar 

  15. H.G. Matthies, A subspace Lanczos method for the generalized symmetric eigenproblem, Computers & Structures 21, 319–325 (1985)

    Article  Google Scholar 

  16. H. G. Matthies. A subspace Lanczos algorithm with restarts and double reorthogonalization, Zeitschr. f. anqew. Math. u. Mech. (ZAMM) 66, T68–T70 (1986)

    Google Scholar 

  17. G.H. Golub & R. Underwood, The block Lanczos method for computing eigenvalues, pp. 361–377 in J. Rice ed., Mathematical Software III, Academic Press, New York (1977)

    Google Scholar 

  18. E. Carnoy & M. Geradin, On the practical use of the Lanczos algorithm in finite element applications to vibration and stability problems, pp. 156–176 in B. Kagström & A. Ruhe eds., Matrix Pencils, Lect. Notes in Math. 973, Springer-Verlag, Berlin (1983)

    Google Scholar 

  19. H.G. Matthies, Computable error bounds for the generalized symmetric eigenproblem, Comm. in Applied Num. Meth. 1, 33–38 (1985)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Birkhäuser Verlag Basel

About this chapter

Cite this chapter

Matthies, H.G. (1987). A Lanczos Algorithm with Restarts. In: Albrecht, J., Collatz, L., Velte, W., Wunderlich, W. (eds) Numerical Treatment of Eigenvalue Problems Vol.4 / Numerische Behandlung von Eigenwertaufgaben Band 4. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik Série internationale d’Analyse numérique, vol 83. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-7507-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-7507-3_13

  • Publisher Name: Birkhäuser Basel

  • Print ISBN: 978-3-0348-7508-0

  • Online ISBN: 978-3-0348-7507-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics