%AXu, Shengjie%AXue, Fei%AYe, Qiang Ed.%BJournal Name: Numerical Linear Algebra with Applications
%D2022%I
%JJournal Name: Numerical Linear Algebra with Applications
%K
%MOSTI ID: 10344800
%PMedium: X
%TInexact rational Krylov subspace method for eigenvalue problems
%XAn inexact rational Krylov subspace method is studied to solve large-scale nonsymmetric eigenvalue problems. Each iteration (outer step) of the rational Krylov subspace method requires solution to a shifted linear system to enlarge the subspace, performed by an iterative linear solver for large-scale problems. Errors are introduced at each outer step if these linear systems are solved approx- imately by iterative methods (inner step), and they accumulate in the rational Krylov subspace. In this article, we derive an upper bound on the errors intro- duced at each outer step to maintain the same convergence as exact rational Krylov subspace method for approximating an invariant subspace. Since this bound is inversely proportional to the current eigenresidual norm of the target invariant subspace, the tolerance of iterative linear solves at each outer step can be relaxed with the outer iteration progress. A restarted variant of the inexact rational Krylov subspace method is also proposed. Numerical experiments show the effectiveness of relaxing the inner tolerance to save computational cost.
%0Journal Article