Arnoldi-Riccati method for large eigenvalue problems (Q1923879): 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 18:36, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Arnoldi-Riccati method for large eigenvalue problems |
scientific article |
Statements
Arnoldi-Riccati method for large eigenvalue problems (English)
0 references
13 October 1996
0 references
The authors propose a new method for computing the largest by absolute value eigenvalue of a large sparse matrix. The method consists of two major steps: a) approximate computation of the corresponding invariant subspace, and b) refinement of the approximation by solving a Riccati equation approximately.
0 references
Arnoldi-Riccati method
0 references
Krylov subspace
0 references
iterative method
0 references
perturbation
0 references
largest eigenvalue
0 references
large sparse matrix
0 references
invariant subspace
0 references
Riccati equation
0 references
