Low-Synch Gram-Schmidt with Delayed Reorthogonalization for Krylov Solvers

arXiv2104.01253MaRDI QIDQ6364443FDOQ6364443

Authors: Daniel Bielich, Julien Langou, Stephen J. Thomas, K. Świrydowicz, Ichitaro Yamazaki, E. G. Boman 

Publication date: 2 April 2021

Abstract: The parallel strong-scaling of Krylov iterative methods is largely determined by the number of global reductions required at each iteration. The GMRES and Krylov-Schur algorithms employ the Arnoldi algorithm for nonsymmetric matrices. The underlying orthogonalization scheme is left-looking and processes one column at a time. Thus, at least one global reduction is required per iteration. The traditional algorithm for generating the orthogonal Krylov basis vectors for the Krylov-Schur algorithm is classical Gram Schmidt applied twice with reorthogonalization (CGS2), requiring three global reductions per step. A new variant of CGS2 that requires only one reduction per iteration is applied to the Arnoldi-QR iteration. Strong-scaling results are presented for finding eigenvalue-pairs of nonsymmetric matrices. A preliminary attempt to derive a similar algorithm (one reduction per Arnoldi iteration with a robust orthogonalization scheme) was presented by Hernandez et al.(2007). Unlike our approach, their method is not forward stable for eigenvalues.

This page was built for publication: Low-Synch Gram-Schmidt with Delayed Reorthogonalization for Krylov Solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6364443)