A numerically stable communication-avoiding $s$-step GMRES algorithm

Cites Work

Unnamed Item
On the generation of Krylov subspace bases
Parallel iterative S-step methods for unsymmetric linear systems
Roundoff error analysis of the CholeskyQR2 algorithm
s-step iterative methods for symmetric linear systems
The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
Varying the $s$ in your $s$-step GMRES
Reducing the effect of global communication in $\text{GMRES} (m)$ and CG on parallel distributed memory computers
Numerical stability of GMRES
Reorthogonalized block classical Gram-Schmidt
Block Gram-Schmidt algorithms and their stability properties
Communication-optimal Parallel and Sequential QR and LU Factorizations
The university of Florida sparse matrix collection
Incremental Condition Estimation
Implementation of the GMRES Method Using Householder Transformations
SLEPc
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
A Newton basis GMRES implementation
A set of level 3 basic linear algebra subprograms
The Adaptive $s$-Step Conjugate Gradient Method
Communication lower bounds and optimal algorithms for numerical linear algebra
Accuracy and Stability of Numerical Algorithms
Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs

This page was built for publication: A numerically stable communication-avoiding $s$-step GMRES algorithm

A numerically stable communication-avoiding \(s\)-step GMRES algorithm