s-step enlarged Krylov subspace conjugate gradient methods
From MaRDI portal
Publication:5208740
Abstract: Recently, enlarged Krylov subspace methods, that consists of enlarging the Krylov subspace by a maximum of t vectors per iteration based on the domain decomposition of the graph of A, were introduced in the aim of reducing communication when solving systems of linear equations Ax=b. In this paper, the s-step enlarged Krylov subspace Conjugate Gradient methods are introduced, whereby s iterations of the enlarged Conjugate Gradient methods are merged in one iteration. The numerical stability of these s-step methods is studied, and several numerically stable versions are proposed. Similarly to the enlarged Krylov subspace methods, the s-step enlarged Krylov subspace methods have a faster convergence than Krylov methods, in terms of iterations. Moreover, by computing st basis vectors of the enlarged Krylov subspace at the beginning of each s-step iteration, communication is further reduced. It is shown in this paper that the introduced methods are parallelizable with less communication, with respect to their corresponding enlarged versions and to Conjugate Gradient.
Recommendations
- Enlarged Krylov subspace conjugate gradient methods for reducing communication
- Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions
- The adaptive \(s\)-step conjugate gradient method
- s-step iterative methods for symmetric linear systems
- Varying the \(s\) in your \(s\)-step GMRES
Cites work
- scientific article; zbMATH DE number 434716 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- A parallel GMRES version for general sparse matrices
- An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
- An efficient deflation technique for the communication-avoiding conjugate gradient
- Analysis of Augmented Krylov Subspace Methods
- Avoiding communication in nonsymmetric Lanczos-based 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
- 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
- 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
- The block conjugate gradient algorithm and related methods
- s-step iterative methods for symmetric linear systems
Cited in
(7)- Enlarged Krylov subspace conjugate gradient methods for reducing communication
- Developing variable \(s\)-step CGNE and CGNR algorithms for non-symmetric linear systems
- Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms
- Varying the \(s\) in your \(s\)-step GMRES
- The adaptive \(s\)-step conjugate gradient method
- A residual replacement strategy for improving the maximum attainable accuracy of \(s\)-step Krylov subspace methods
- Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions
This page was built for publication: s-step enlarged Krylov subspace conjugate gradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208740)
