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

DOI10.1016/0021-9991(82)90119-XMaRDI QIDQ1162106zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3311329 (Why is no real title available?)
• A Simultaneous Iteration Method for the Unsymmetric Eigenvalue Problem
• 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

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162106)