Skip to main content
SpringerLink
Log in

Implementation and applications of the spectral transformation lanczos algorithm

  • Section B Symmetric (A-λB)-Pencils And Applications
  • Conference paper
  • First Online:
Book cover Matrix Pencils

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

Abstract

This paper gives an orientation on some practical details of the program package STLM (=Spectral Transformation Lanczos Method). STLM is a FORTRAN implementation of an algorithm for computing some eigenpairs to large, sparse, symmetric, and generalized eigenproblems. Some portability and flexibility aspects of the package are also discussed.

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 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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. A. COLIN DAY, Compatible Fortran, Cambridge U. P., 1978.

    Google Scholar 

  2. IAIN S. DUFF (ed), Sparse Matrices and their Uses, Academic Press, 1981.

    Google Scholar 

  3. T. ERICSSON AND A. RUHE, The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems, Math of Comp., vol 35, no 152, 1251–1268.

    Google Scholar 

  4. ALAN GEORGE AND JOSEPH W. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice Hall, 1981.

    Google Scholar 

  5. ALAN JENNINGS, Matrix Computation for Engineers and Scientists, John Wiley, 1978.

    Google Scholar 

  6. Matrix Eigensystem Routines — EISPACK Guide (1974) (1977), B. T. SMITH et al., Springer Lecture Notes in Computer Science 6 and 51

    Google Scholar 

  7. BERESFORD N. PARLETT, The Symmetric Eigenvalue Problem, Prentice Hall, 1980.

    Google Scholar 

  8. B. G. RYDER, The PFORT Verifier, Software — Practice and Experience, vol. 6 no. 4, 473–486.

    Google Scholar 

  9. E. SCHREM, Computer Implementation of the Finite Element Procedure, ISD-Report no. 111, University of Stuttgart, 1975.

    Google Scholar 

  10. D. S. SCOTT, The Advantages of Inverted Operators in Rayleigh-Ritz Approximations, Computer Sciences Division at Oak Ridge National Laboratory, 1980.

    Google Scholar 

Download references

Authors
  1. Thomas Ericsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bo Kågström Axel Ruhe

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Ericsson, T. (1983). Implementation and applications of the spectral transformation lanczos algorithm. In: Kågström, B., Ruhe, A. (eds) Matrix Pencils. Lecture Notes in Mathematics, vol 973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062101

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11983-8

  • Online ISBN: 978-3-540-39447-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation