Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
From MaRDI portal
Publication:2813336
DOI10.1137/140989492zbMath1382.65086OpenAlexW9532344MaRDI QIDQ2813336
Laura Grigori, Sophie Moufawad, Frédéric Nataf
Publication date: 23 June 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/42a165fe6df5fbb86753ae65b24c926a80105ef5
Parallel algorithms in computer science (68W10) Iterative numerical methods for linear systems (65F10)
Related Items (12)
Partitioning and Reordering for Spike-Based Distributed-Memory Parallel Gauss--Seidel ⋮ Limited‐memory polynomial methods for large‐scale matrix functions ⋮ Adaptively restarted block Krylov subspace methods with low-synchronization skeletons ⋮ A Class of Efficient Locally Constructed Preconditioners Based on Coarse Spaces ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ Strategies for the Vectorized Block Conjugate Gradients Method ⋮ s-Step Enlarged Krylov Subspace Conjugate Gradient Methods ⋮ Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication ⋮ The Stability of Block Variants of Classical Gram--Schmidt ⋮ Block Gram-Schmidt algorithms and their stability properties ⋮ Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions ⋮ Numerical algorithms for high-performance computational science
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Numerical stability of orthogonalization methods with a non-standard inner product
- A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation
- s-step iterative methods for symmetric linear systems
- The block conjugate gradient algorithm and related methods
- A parallel GMRES version for general sparse matrices
- Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication
- Communication-optimal Parallel and Sequential QR and LU Factorizations
- Implementation of the GMRES Method Using Householder Transformations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- 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
- 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
- A Multipreconditioned Conjugate Gradient Algorithm
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication