Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
type: Item
instance of: scholarly article
title: Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
zbMATH Open document ID: 0757.65046
DOI: 10.1016/0021-9991(92)90006-K
author: Ronald B. Morgan
published in: Journal of Computational Physics
publication date: 1993-01-17T00:00:00Z
review text: \textit{E. R. Davidson's} method for eigenvalue computation [ibid. 17, 87-94 (1975; Zbl 0293.65022)] is developed in two directions, first to nonsymmetric matrices, where a complex shift is included by separating real and integer parts of the resulting vector, and second to thicker than diagonal preconditioners.
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65F35
zbMATH DE Number: 97180
zbMATH Keywords: eigenvalue
zbMATH Keywords: nonsymmetric matrices
zbMATH Keywords: complex shift
zbMATH Keywords: preconditioners
reviewed by: Axel Ruhe
MaRDI profile type: Publication
cites work: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations
cites work: Lanczos versus subspace iteration for solution of eigenvalue problems
cites work: The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
cites work: The Advantages of Inverted Operators in Rayleigh–Ritz Approximations
cites work: Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
cites work: Super-matrix methods
cites work: Block Preconditioning for the Conjugate Gradient Method
cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
cites work: Davidson's method and preconditioning for generalized eigenvalue problems
cites work: Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
cites work: A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
cites work: Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
cites work: Numerical solution of large nonsymmetric eigenvalue problems
cites work: A generalization of the Davidson's method to large nonsymmetric eigenvalue problems
cites work: An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices
full work available at URL: 0021-9991(92)90006-k
OpenAlex ID: W1993987675
description: scientific article; zbMATH DE number 97180