Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices (Q1201054): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587874 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Axel Ruhe / rank | |||
Normal rank | |||
Revision as of 11:15, 16 February 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
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
