Augmented Block-Arnoldi Recycling CFD Solvers
Stephen Thomas, Alison Baker, Stephane Gaudreault

TL;DR
This paper introduces an augmented block-Arnoldi recycling method for Krylov subspace solvers, utilizing advanced orthogonalization techniques to significantly reduce solver iterations in CFD applications.
Contribution
It proposes a novel inverse compact WY modified Gram-Schmidt orthogonalization within an augmented block-Arnoldi framework, improving efficiency of recycled Krylov methods.
Findings
Over 10× reduction in solver iterations in certain cases
Effective orthogonalization using inverse compact WY scheme
Recycling subspace eigen-spectrum can replace preconditioning
Abstract
One of the limitations of recycled GCRO methods is the large amount of computation required to orthogonalize the basis vectors of the newly generated Krylov subspace for the approximate solution when combined with those of the recycle subspace. Recent advancements in low synchronization Gram-Schmidt and generalized minimal residual algorithms, Swirydowicz et al.~\cite{2020-swirydowicz-nlawa}, Carson et al. \cite{Carson2022}, and Lund \cite{Lund2022}, can be incorporated, thereby mitigating the loss of orthogonality of the basis vectors. An augmented Arnoldi formulation of recycling leads to a matrix decomposition and the associated algorithm can also be viewed as a {\it block} Krylov method. Generalizations of both classical and modified block Gram-Schmidt algorithms have been proposed, Carson et al.~\cite{Carson2022}. Here, an inverse compact modified Gram-Schmidt algorithm is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Electromagnetic Scattering and Analysis · Electromagnetic Simulation and Numerical Methods
