A generalization of the Davidson's method to large nonsymmetric eigenvalue problems

DOI10.1016/0021-9991(82)90119-XzbMath0479.65020MaRDI QIDQ1162106

S. Singh

Publication date: 1982

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

zbMATH Keywords

large nonsymmetric matricesnonsymmetric eigenvalue problems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (8)

Super-matrix methods ⋮ Solution of the large matrix equations which occur in response theory ⋮ Iterative methods for the solution of large systems of linear equations ⋮ Optimal leader‐follower affine formation control of linear multi‐agent systems ⋮ TC++: first-principles calculation code for solids using the transcorrelated method ⋮ Precise implementation of cluster transfer matrix method in the single electron box ⋮ Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices ⋮ Large-scale complex eigenvalue problems

Cites Work

• Unnamed Item
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
• A Simultaneous Iteration Method for the Unsymmetric Eigenvalue Problem

This page was built for publication: A generalization of the Davidson's method to large nonsymmetric eigenvalue problems