A parallel Lanczos method for symmetric generalized eigenvalue problems
- Computing Sciences Directorate, NERSC High Performance Computing Research, LBNL
Lanczos algorithm is a very effective method for finding extreme eigenvalues of symmetric matrices. It requires less arithmetic operations than similar algorithms, such as, the Arnoldi method. In this paper, the authors present their parallel version of the Lanczos method for symmetric generalized eigenvalue problem, PLANSO. PLANSO is based on a sequential package called LANSO which implements the Lanczos algorithm with partial re-orthogonalization. It is portable to all parallel machines that support MPI and easy to interface with most parallel computing packages. Through numerical experiments, they demonstrate that it achieves similar parallel efficiency as PARPACK, but uses considerably less time.
- Research Organization:
- Lawrence Berkeley National Lab., Berkeley, CA (US)
- Sponsoring Organization:
- USDOE Office of Energy Research, Washington, DC (US)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 10163130
- Report Number(s):
- LBNL--41284; ON: DE98056100; ON: DE98056100
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel Lanczos method for symmetric generalized eigenvalue problems
Lanczos algorithm for symmetric eigenvalue problems
Block Lanczos software for symmetric eigenvalue problems. [SNLASO, DNLASO, SILASO, DILASO, in FORTRAN IV]
Technical Report
·
Sun Nov 30 23:00:00 EST 1997
·
OSTI ID:6955814
Lanczos algorithm for symmetric eigenvalue problems
Conference
·
Mon Dec 31 23:00:00 EST 1979
·
OSTI ID:5171549
Block Lanczos software for symmetric eigenvalue problems. [SNLASO, DNLASO, SILASO, DILASO, in FORTRAN IV]
Technical Report
·
Wed Oct 31 23:00:00 EST 1979
·
OSTI ID:5724868