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 compute the Arnoldi expansion for nonsymmetric matrices. The underlying algorithm is "left-looking" and processes one column at a time. Thus, at least one global reduction is required per iteration. The usual method for generating the orthogonal Krylov basis for the Krylov-Schur algorithm is classical Gram Schmidt applied twice (CGS2), requiring three global reductions per iteration. 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 parallel method (one reduction per Arnoldi iteration with a robust orthogonalization scheme) was presented by Hernandez et al. [1]. Unlike our approach, their method is not forward stable for eigenvalues.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.