Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
β Scribed by Isaiah Shavitt
- Publisher
- Elsevier Science
- Year
- 1970
- Tongue
- English
- Weight
- 406 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Elementary Jacobi Rotations are used as the basic tools to obtain eigenvalues and eigenvectors of arbitrary real symmetric matrices. The proposed algorithm has a complete concurrent structure, that is: every eigenvalueeigenvector pair can be obtained in any order and in an independent way from the r
The method of diagonalizing Hermitian matrices based on a polynomial expansion of the Dirac delta function S( E -H) is further refined so as to accelerate the convergence. Improved choices of the bases used for subspace diagonalization of the matrix, along with accuracy controls and estimates, are i
A new fast algorithm for calculating a few maximum (or minimum) eigenvalues and the corresponding eigenvectors of large N x N Hermitian matrices is presented. The method is based on a molecular dynamics algorithm for N coupled harmonic oscillators. The time step for iteration is chosen so that only