Polynomial Preconditioning for Indefinite Matrices
Numerical Analysis
2025-10-17 v1 Numerical Analysis
Abstract
Polynomial preconditioning is an important tool in solving large linear systems and eigenvalue problems. A polynomial from GMRES can be used to precondition restarted GMRES and restarted Arnoldi. Here we give methods for indefinite matrices that make polynomial preconditioning more generally applicable. The new techniques include balancing the polynomial so that it produces a definite spectrum. Then a stability approach is given that is specialized for the indefinite case. Also, very complex spectra are examined. Then convergence estimates are given for polynomial preconditioning of real, indefinite spectra. Finally, tests are preformed of finding interior eigenvalues.
Cite
@article{arxiv.2510.14816,
title = {Polynomial Preconditioning for Indefinite Matrices},
author = {Hayden Henson and Ronald B. Morgan},
journal= {arXiv preprint arXiv:2510.14816},
year = {2025}
}