The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology
DOI10.1137/16M1103361zbMath1416.65080OpenAlexW2897248362MaRDI QIDQ4553788
Zdeněk Strakoš, Petr Tichý, Erin Claire Carson, Miroslav Rozložnik, Miroslav Tůma
Publication date: 31 October 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1103361
numerical stabilityinexact computationsdelay of convergenceexascale computationsmaximal attainable accuracypipelined conjugate gradient methodspipelined Krylov subspace methods
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Roundoff error (65G50) Parallel numerical computation (65Y05)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
- Multitasking the conjugate gradient method on the CRAY X-MP/48
- The block preconditioned conjugate gradient method on vector computers
- Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
- On the real convergence rate of the conjugate gradient method
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- s-step iterative methods for symmetric linear systems
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- BiCGstab(\(l\)) and other hybrid Bi-CG methods
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- On error estimation in the conjugate gradient method and why it works in finite precision computations
- Reliable updated residuals in hybrid Bi-CG methods
- Error estimation in preconditioned conjugate gradients
- Iterative methods for solving linear equations
- On sensitivity of Gauss-Christoffel quadrature
- Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers
- A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods
- The university of Florida sparse matrix collection
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Krylov Subspace Methods on Supercomputers
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
- Inexact Krylov Subspace Methods for Linear Systems
- Accuracy and Stability of Numerical Algorithms
- Iterative Krylov Methods for Large Linear Systems
- Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
- Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
- Inexact Matrix-Vector Products in Krylov Methods for Solving Linear Systems: A Relaxation Strategy
- Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method
- The Lanczos and Conjugate Gradient Algorithms
- Modern Error Analysis
- Computational Variants of the Lanczos Method for the Eigenproblem
- Methods of conjugate gradients for solving linear systems
This page was built for publication: The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology
