Skip to main content

Analysis of the Lanczos Error Bounds and Its Application to the Explicitly Restarted Lanczos Algorithm

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2328))

  • 481 Accesses

Abstract

LExpRes is a k-step explicit restart variant of the Lanczos algorithm. In this method a periodic/selective reorthogonalization strategy is adopted in order to dampen the affects of instability incurred by a loss of orthogonality among the Lanczos vectors. Despite this however, round-off error still effects its performance particularly on the estimated Lanczos error bounds that are considerably different from the true error bound. In this paper a detailed analysis of the Lanczos error bound is presented and a new more realistic error proposed for determining a ‘good’ Ritz vector. A scheme is also proposed that uses this bound to derive start vectors for subsequent eigenpairs. The performance of the implementation of this scheme on the CRAY-T3E is critically assessed and some conclusions are drawn.

This work was carried out using the facilities of the University of Manchester Parallel Computing Centre

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Duff, I.S., Grimes, R.G., and Lewis, J.G., User’s Guide for the Harwell-Boeing Sparse Matrix Collection (release I) 1992, available online ftp orion.cerfacs.fr.

    Google Scholar 

  2. Golub, G., and Van Loan C.F., Matrix Computations, John Hopkins University Press, 1989, London.

    Google Scholar 

  3. Parlett, B.N., The Symmetric Eigenvalue Problem, Society for Industrial and Applied Mathematics, 1998.

    Google Scholar 

  4. Simon, H.,D., Analysis of the Symmetric Lanczos Algorithm with Reorthogonaliza-tion Methods, Linear Algebra and its Appl., 1984 (61), 101–131.

    Google Scholar 

  5. Lehoucq, R., Sorensen, D.C., and Vu, P.A., SSAUPD: Fortran subroutines for solving large-scale eigenvalue problems, Release 2.1, 1994, available from netlib@ornl.gov in the scalapack directory.

    Google Scholar 

  6. Szularz, M., Weston, J., and Clint, M., Explicitly restarted Lanczos algorithms in an MPP environment, Parallel Computing, 1999 (25), 613–631.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cooper, A., Szularz, M., Weston, J. (2002). Analysis of the Lanczos Error Bounds and Its Application to the Explicitly Restarted Lanczos Algorithm. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics