Arnoldi-Riccati method for large eigenvalue problems
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.
scientific article; zbMATH DE number 934139
scientific article