The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
From MaRDI portal
Publication:2557989
DOI10.1016/0021-9991(73)90149-6zbMath0253.65021OpenAlexW2015251591MaRDI QIDQ2557989
I. Shavitt, C. F. Bender, R. P. Hosteny, A. Pipano
Publication date: 1973
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9991(73)90149-6
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Extrapolation to the limit, deferred corrections (65B05)
Related Items
Super-matrix methods ⋮ Recursive total least squares algorithm for image reconstruction from noisy, undersampled frames ⋮ An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices ⋮ Solution of the large matrix equations which occur in response theory ⋮ The permutational symmetry in matrix multiplications ⋮ The method of coordinate overrelaxation for \((A-\lambda B)x = 0\) ⋮ A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems ⋮ Computational methods of linear algebra ⋮ 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices ⋮ Computing eigenvalues of very large symmetric matrices. An implementation of a Lanczos algorithm with no reorthogonalization ⋮ A generalization of the Davidson's method to large nonsymmetric eigenvalue problems ⋮ An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices ⋮ The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices ⋮ The subspace projected approximate matrix (SPAM) modification of the Davidson method ⋮ A new approach to the determination of several eigenvectors of a large Hermitian matrix ⋮ Large-scale complex eigenvalue problems ⋮ The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:3926873 Simultane Iterationsverfahren f�r gro�e allgemeine Eigenwertprobleme] ⋮ A Lanczos-type algorithm for the generalized eigenvalue problem Ax=lambdaBx ⋮ Calculation of eigenvectors of large matrices ⋮ Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real-symmetric matrix ⋮ Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational methods of linear algebra
- Ground-state eigenvectors for many configuration wavefunctions
- Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
- An iterative method for finding characteristic vectors of a symmetric matrix
- $Ax = \lambda Bx$ and the Generalized Eigenproblem
- Computations with Sparse Matrices
- On the transformation of symmetric sparse matrices to the triple diagonal form
- The solution of natural frequency equations by relaxation methods
