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

\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

zbMATH Keywords

eigenvalue

0 references

nonsymmetric matrices

0 references

complex shift

0 references

preconditioners

0 references

reviewed by

Axel Ruhe

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices

0 references

A new look at the Lanczos algorithm for solving symmetric systems of linear equations

0 references

Lanczos versus subspace iteration for solution of eigenvalue problems

0 references

The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems

0 references

The Advantages of Inverted Operators in Rayleigh–Ritz Approximations

0 references

Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices

0 references

Super-matrix methods

0 references

Block Preconditioning for the Conjugate Gradient Method

0 references

An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix

0 references

Davidson's method and preconditioning for generalized eigenvalue problems

0 references

Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems

0 references

A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices

0 references

Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices

0 references

Numerical solution of large nonsymmetric eigenvalue problems

0 references

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

0 references

An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices

0 references

full work available at URL

https://doi.org/10.1016/0021-9991(92)90006-k

0 references

Identifiers

zbMATH Open document ID

0757.65046

0 references

DOI

10.1016/0021-9991(92)90006-K

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1201054

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