Speaker
Hayden Henson
(Baylor University)
Description
Preconditioning plays a central role in accelerating the convergence of iterative methods for solving large linear systems. Among the various approaches, polynomial preconditioning offers a flexible approach. Krylov subspace methods provide a natural setting for constructing polynomials that can be used as preconditioners. In this work, we investigate the use of polynomial preconditioning using the GMRES polynomial on indefinite linear systems. Several challenges can arise in polynomial preconditioning for indefinite matrices. These are mentioned along with some algorithmic strategies designed to mitigate their effects and enhance robustness.
Author
Hayden Henson
(Baylor University)