Enlarged Krylov subspace conjugate gradient methods for reducing communication
From MaRDI portal
Recommendations
- s-step enlarged Krylov subspace conjugate gradient methods
- Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions
- An efficient deflation technique for the communication-avoiding conjugate gradient
- Avoiding communication in nonsymmetric Lanczos-based Krylov subspace methods
- The adaptive s-step conjugate gradient method
Cites work
- A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation
- A Multipreconditioned Conjugate Gradient Algorithm
- A parallel GMRES version for general sparse matrices
- Analysis of Augmented Krylov Subspace Methods
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Communication Avoiding ILU0 Preconditioner
- Communication-optimal parallel and sequential QR and LU factorizations
- Deflated and Augmented Krylov Subspace Techniques
- Enlarged Krylov subspace conjugate gradient methods for reducing communication
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Hiding global communication latency in the GMRES algorithm on massively parallel machines
- scientific article; zbMATH DE number 434716 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- Implementation of the GMRES Method Using Householder Transformations
- Methods of conjugate gradients for solving linear systems
- Multiple search direction conjugate gradient method I: methods and their propositions
- New development in freefem++
- Numerical stability of orthogonalization methods with a non-standard inner product
- s-step iterative methods for symmetric linear systems
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- The block conjugate gradient algorithm and related methods
Cited in
(20)- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- Block Gram-Schmidt algorithms and their stability properties
- 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
- The stability of block variants of classical Gram-Schmidt
- A class of efficient locally constructed preconditioners based on coarse spaces
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- Numerical algorithms for high-performance computational science
- A Communication Optimization Scheme for Basis Computation of Krylov Subspace Methods on Multi-GPUs
- Partitioning and reordering for spike-based distributed-memory parallel Gauss-Seidel
- Strategies for the vectorized block conjugate gradients method
- s-step enlarged Krylov subspace conjugate gradient methods
- Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions
- Limited‐memory polynomial methods for large‐scale matrix functions
- Adaptively restarted block Krylov subspace methods with low-synchronization skeletons
- Analysis of randomized Householder-Cholesky QR factorization with multisketching
- Randomized block Gram-Schmidt process for the solution of linear systems and eigenvalue problems
- Vectorized parallel in time methods for low-order discretizations with application to porous media problems
- Preconditioning without a preconditioner using randomized block Krylov subspace methods
This page was built for publication: Enlarged Krylov subspace conjugate gradient methods for reducing communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2813336)
