Abstract
A general discussion of a method for solving the eigenvalue problem of large N x N Hermitian matrices by using second-order recursion formulae is given. In principle, the method is suitable for finding not only the extreme eigenvalues and the corresponding eigenvectors but also any other eigenvalues in the range of one's specification. The effectiveness of the algorithm is illustrated by calculation of a few low-lying eigenvalues of the Heisenberg model for an antiferromagnetic chain with N up to 1048576.
Original language | English |
---|---|
Pages (from-to) | 217-231 |
Number of pages | 15 |
Journal | Computer Physics Communications |
Volume | 96 |
Issue number | 2-3 |
DOIs | |
Publication status | Published - 1996 Aug 1 |
Externally published | Yes |
Keywords
- Eigenvalue problem
- Hermitian matrices
- Lanczos method
- Large matrices
- Schrödinger equations
- Sparse matrices
ASJC Scopus subject areas
- Hardware and Architecture
- Physics and Astronomy(all)