Improving performance of contour integral-based nonlinear eigensolvers with infinite GMRES
<|reference_start|>Improving performance of contour integral-based nonlinear eigensolvers with infinite GMRES: In this work, the infinite GMRES algorithm, recently proposed by Correnty et al., is employed in contour integral-based nonlinear eigensolvers, avoiding the computation of costly factorizations at each quadrature node to solve the linear systems efficiently. Several techniques are applied to make the infinite GMRES memory-friendly, computationally efficient, and numerically stable in practice. More specifically, we analyze the relationship between polynomial eigenvalue problems and their scaled linearizations, and provide a novel weighting strategy which can significantly accelerate the convergence of infinite GMRES in this particular context. We also adopt the technique of TOAR to infinite GMRES to reduce the memory footprint. Theoretical analysis and numerical experiments are provided to illustrate the efficiency of the proposed algorithm.<|reference_end|>
@article{liu2024improving,
    title={Improving performance of contour integral-based nonlinear eigensolvers
  with infinite GMRES},
    author={Yuqi Liu, Jose E. Roman, Meiyue Shao},
    journal={arXiv preprint arXiv:2403.19309},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.19309},
    primaryClass={math.NA cs.NA}
}