s-Step Enlarged Krylov Subspace Conjugate Gradient Methods
From MaRDI portal
Publication:5208740
DOI10.1137/18M1182528zbMath1429.65071arXiv1804.10629MaRDI QIDQ5208740
Publication date: 10 January 2020
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.10629
iterative methodsKrylov subspace methodshigh performance computinglinear algebraminimizing communication
Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Numerical stability of orthogonalization methods with a non-standard inner product
- s-step iterative methods for symmetric linear systems
- The block conjugate gradient algorithm and related methods
- A parallel GMRES version for general sparse matrices
- An efficient deflation technique for the communication-avoiding conjugate gradient
- Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
- Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods
- Implementation of the GMRES Method Using Householder Transformations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Analysis of Augmented Krylov Subspace Methods
- Deflated and Augmented Krylov Subspace Techniques
- An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
- Multiple search direction conjugate gradient method I: methods and their propositions
- Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
- New development in freefem++
- Communication Avoiding ILU0 Preconditioner
- Methods of conjugate gradients for solving linear systems
This page was built for publication: s-Step Enlarged Krylov Subspace Conjugate Gradient Methods