Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
From MaRDI portal
Publication:4509861
DOI10.1137/S1064827599353865zbMath0983.65039MaRDI QIDQ4509861
Qiang Ye, Henk A. van der Vorst
Publication date: 19 October 2000
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
convergencenumerical testserror analysisKrylov subspace methodfinite precisionresidual vectorresidual replacement
Related Items (15)
Variants of the groupwise update strategy for short-recurrence Krylov subspace methods ⋮ Variations of Zhang's Lanczos-type product method ⋮ 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 ⋮ Communication-hiding pipelined BiCGSafe methods for solving large linear systems ⋮ Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method ⋮ On Soft Errors in the Conjugate Gradient Method: Sensitivity and Robust Numerical Detection ⋮ Lossy compression for PDE-constrained optimization: adaptive error control ⋮ Variants of residual smoothing with a small residual gap ⋮ 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. ⋮ Efficient and reliable iterative methods for linear systems ⋮ Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
Uses Software
This page was built for publication: Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
