Skip to main content
SpringerLink
Log in

Computing eigenvectors (and eigenvalues) of large, symmetric matrices using Lanczos tridiagonalization

  • Conference paper
  • First Online:
Numerical Analysis

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 773))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.99
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. Jane Cullum and Ralph A. Willoughby (1979), Fast modal analysis of large, sparse but unstructured symmetric matrices, Proceedings of the 17th IEEE Conference on Decision and Control, Jan. 10–12, 1979, San Diego, Calif., 45–53.

    Google Scholar 

  2. Jane Cullum and Ralph A. Willoughby (1979), Lanczos and the computation in specified intervals of the spectrum of large, sparse real symmetric matrices, eds. I. Duff and G. W. Stewart, Proceedings of the Symposium on Sparse Matrix Computations, Nov. 2–3, 1978, Knoxville, Tenn., SIAM, Philadelphia, Pa.

    Google Scholar 

  3. Jane Cullum and Ralph A. Willoughby (1978), The Lanczos tridigonalization and the conjugate gradient algorithms with local É›-orthogonality of the Lanczos vectors, RC 7152, IBM Research, Yorktown Heights, N.Y. (submitted to J. Linear Algebra).

    Google Scholar 

  4. C. C. Paige (1971), The computation of eigenvalues and eigenvectors of very large sparse matrices, Ph.D Thesis, University of London.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. C. C. Paige (1976), Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix, J. Inst. Math. Appl., 18, 341–349.

    Article  MathSciNet  MATH  Google Scholar 

  7. Jane Cullum and Ralph A. Willoughby (1979), Computing eigenvalues of large, symmetric matrices — an implementation of a Lanczos algorithm without reorthogonalization, IBM Research Report, IBM Research, Yorktown Heights, N.Y., to appear.

    MATH  Google Scholar 

  8. C. C. Paige and M. A. Saunders (1975), Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12, 617–619.

    Article  MathSciNet  MATH  Google Scholar 

  9. S. Kirkpatrick (1978), private communication, IBM Research, Yorktown Heights, N.Y.

    Google Scholar 

  10. T. Kaplan and L. J. Gray (1976), Elementary excitations in random substitutional alloys, Phys. Rev. B, 14, 3462–3470.

    Article  Google Scholar 

  11. B. N Parlett (1978), A new look at the Lanczos algorithm for solving symmetric systems of linear equations, A.E.R.E. Report CSS 64, Harwell, Oxfordshire, England.

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. EISPAK Guide (1976), Matrix Eigensystem Routines, Lecture Notes in Computer Science, 16, B. T. Smith et al, 2nd ed. Springer-Verlag, New York.

    Google Scholar 

  14. Jane Cullum and R.A. Willoughby (1979), Computing eigenvectors (and eigenvalues) of large symmetric matrices using Lanczos tridiagonalization, IBM Research Report, RC 7718, IBM Research, Yorktown Heights, N.Y.

    MATH  Google Scholar 

  15. Daniel B. Szyld and Olof B. Widlund (1979), Applications of conjugate gradient type methods to eigenvalue calculations, to appear.

    Google Scholar 

  16. G. Peters and J. H. Wilkinson (1971), The calculation of specified eigenvectors by inverse iteration, Handbook for Automatic Computation, Vol. II Linear Algebra, ed. J. H. Wilkinson-C. Reinsch, Springer-Verlag, New York, 418–439.

    Chapter  Google Scholar 

  17. Alan Jennings (1977), Matrix Computation for Engineers and Scientists, John Wiley and Sons, New York, 279–288.

    MATH  Google Scholar 

Download references

Authors
  1. Jane Cullum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralph A. Willoughby
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Alistair Watson

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag

About this paper

Cite this paper

Cullum, J., Willoughby, R.A. (1980). Computing eigenvectors (and eigenvalues) of large, symmetric matrices using Lanczos tridiagonalization. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0094163

Download citation

  • DOI: https://doi.org/10.1007/BFb0094163

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09740-2

  • Online ISBN: 978-3-540-38562-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation