Quasi-kernel polynomials and their use in non-Hermitian matrix iterations (Q1195726): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:41, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quasi-kernel polynomials and their use in non-Hermitian matrix iterations |
scientific article |
Statements
Quasi-kernel polynomials and their use in non-Hermitian matrix iterations (English)
0 references
18 January 1993
0 references
The author first introduces the concept of quasi-kernel polynomials and derives implicit and recursive formulas for their computation and develops a method for computing their zeros. These results are then used for the generalized minimal residual method, the quasi-minimal residual method (QMR), and the transpose free QMR. Numerical examples illustrate the methodology.
0 references
non-Hermitian matrix iterations
0 references
non-Hermitian matrices
0 references
matrix iterations
0 references
orthogonal polynomials
0 references
recurrence relation
0 references
roots of quasi- kernel polynomials
0 references
eigenvalue approximations
0 references
numerical examples
0 references
quasi- kernel polynomials
0 references
generalized minimal residual method
0 references
quasi-minimal residual method
0 references
