An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrix

DOI10.1016/0021-9991(70)90014-8zbMath0204.48203OpenAlexW1970727379MaRDI QIDQ2541995

C. F. Bender, I. Shavitt

Publication date: 1970

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(70)90014-8

Related Items

Super-matrix methods, An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices, The method of coordinate overrelaxation for \((A-\lambda B)x = 0\), Computational methods of linear algebra, An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices, The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order, Acceleration of the convergence in Nesbet's algorithm for eigenvalues and eigenvectors of large matrices, Extreme eigenvalues of large sparse matrices by Rayleigh quotient and modified conjugate gradients

Cites Work

• Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
• Unnamed Item