Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices

DOI10.1016/0021-9991(92)90006-KzbMath0757.65046OpenAlexW1993987675MaRDI QIDQ1201054

Ronald B. Morgan

Publication date: 17 January 1993

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

Full work available at URL: https://doi.org/10.1016/0021-9991(92)90006-k

zbMATH Keywords

eigenvaluepreconditionerscomplex shiftnonsymmetric matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (13)

On global convergence of subspace projection methods for Hermitian eigenvalue problems ⋮ Supersymmetry and localization in the quantum Hall effect ⋮ Harmonic projection methods for large non-symmetric eigenvalue problems ⋮ Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems ⋮ A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems ⋮ Davidson's method and preconditioning for generalized eigenvalue problems ⋮ On Chebyshev-Davidson method for symmetric generalized eigenvalue problems ⋮ On restarting the Arnoldi method for large nonsymmetric eigenvalue problems ⋮ Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations ⋮ Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems ⋮ On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems ⋮ Preconditioning eigenvalues and some comparison of solvers

Cites Work

• Davidson's method and preconditioning for generalized eigenvalue problems
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• 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
• Super-matrix methods
• Numerical solution of large nonsymmetric eigenvalue problems
• Block Preconditioning for the Conjugate Gradient Method
• Lanczos versus subspace iteration for solution of eigenvalue problems
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
• The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems

This page was built for publication: Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices