Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm (Q1301301): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: IRAM / rank | |||
Normal rank | |||
Revision as of 12:49, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm |
scientific article |
Statements
Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm (English)
0 references
13 July 2000
0 references
A polynomial characterization of the refined Arnoldi method is given and the implicit restarting scheme of \textit{D. C. Sørensen} is applied [SIAM J. Matrix Anal. Appl. 13, No. 1, 357-385 (1992; Zbl 0763.65025)]. The roots of the polynomial are used as shifts.
0 references
polynomial characterization
0 references
refined Arnoldi method
0 references
implicit restarting scheme
0 references
shifts
0 references
