Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices (Q1201054): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q587874
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Axel Ruhe / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lanczos versus subspace iteration for solution of eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Advantages of Inverted Operators in Rayleigh–Ritz Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-matrix methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Preconditioning for the Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Davidson's method and preconditioning for generalized eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical solution of large nonsymmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Davidson's method to large nonsymmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0021-9991(92)90006-k / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993987675 / rank
 
Normal rank

Latest revision as of 09:56, 30 July 2024

scientific article
Language Label Description Also known as
English
Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
scientific article

    Statements

    Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices (English)
    0 references
    0 references
    17 January 1993
    0 references
    \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.
    0 references
    eigenvalue
    0 references
    nonsymmetric matrices
    0 references
    complex shift
    0 references
    preconditioners
    0 references
    0 references
    0 references

    Identifiers