A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods

DOI10.1137/120893057zbMath1302.65075OpenAlexW2002054778MaRDI QIDQ2877077

Publication date: 21 August 2014

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120893057

zbMATH Keywords

algorithm numerical experiments sparse matrix numerical stability Krylov subspace methods symmetric positive definite minimizing communication communication-avoiding biconjugate gradients algorithm communication-avoiding conjugate gradients algorithm maximum attainable accuracy residual replacement

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items (max. 100)

The non-symmetric $s$-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR ⋮ The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology ⋮ The Adaptive $s$-Step Conjugate Gradient Method ⋮ Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method ⋮ Avoiding Communication in Primal and Dual Block Coordinate Descent Methods ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ On the cost of iterative computations ⋮ An adaptive $s$-step conjugate gradient algorithm with dynamic basis updating. ⋮ Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision

This page was built for publication: A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods