On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic
From MaRDI portal
Publication:5161757
DOI10.1137/20M1346249MaRDI QIDQ5161757
Tyler Chen, Hexuan Liu, Anne Greenbaum
Publication date: 1 November 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.05874
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multitasking the conjugate gradient method on the CRAY X-MP/48
- On prescribing the convergence behavior of the conjugate gradient algorithm
- 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
- Comparison of splittings used with the conjugate gradient algorithm
- 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
- An Augmented Stability Result for the Lanczos Hermitian Matrix Tridiagonalization Process
- 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
- Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions
- The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology
- Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations
- Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method
- Methods of conjugate gradients for solving linear systems
