Estimating the Attainable Accuracy of Recursively Computed Residual Methods
From MaRDI portal
Publication:4339135
DOI10.1137/S0895479895284944zbMath0873.65027MaRDI QIDQ4339135
Publication date: 5 June 1997
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
preconditioningiterative methodsconjugate gradient methodsfinite precision arithmeticresidual methodsestimating the attainable accurracy
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Numerical methods for the QCDd overlap operator. I: Sign-function and error bounds ⋮ Variants of the groupwise update strategy for short-recurrence Krylov subspace methods ⋮ Mixed precision algorithms in numerical linear algebra ⋮ Variations of Zhang's Lanczos-type product method ⋮ The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology ⋮ VPAStab\((J,L)\): an iterative method with look-ahead for the solution of large sparse linear systems ⋮ Reliable updated residuals in hybrid Bi-CG methods ⋮ Abstract perturbed Krylov methods ⋮ The Adaptive $s$-Step Conjugate Gradient Method ⋮ Cross-Interactive Residual Smoothing for Global and Block Lanczos-Type Solvers for Linear Systems with Multiple Right-Hand Sides ⋮ Accuracy of preconditioned CG-type methods for least squares problems. ⋮ Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method ⋮ Predict-and-Recompute Conjugate Gradient Variants ⋮ On Iterative Solution of the Extended Normal Equations ⋮ On Soft Errors in the Conjugate Gradient Method: Sensitivity and Robust Numerical Detection ⋮ Lossy compression for PDE-constrained optimization: adaptive error control ⋮ Computing projections with LSQR ⋮ A variant of IDRstab with reliable update strategies for solving sparse linear systems ⋮ Limiting accuracy of segregated solution methods for nonsymmetric saddle point problems ⋮ Theoretical and numerical comparisons of GMRES and WZ-GMRES ⋮ Error estimation in preconditioned conjugate gradients ⋮ Variants of residual smoothing with a small residual gap ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ An Approximate Newton-Like Coupling of Subsystems ⋮ On efficient numerical solution of linear algebraic systems arising in goal-oriented error estimates ⋮ Accurate conjugate gradient methods for families of shifted systems ⋮ Schur complement reduction in the mixed-hybrid approximation of Darcy's law: Rounding error analysis ⋮ On the cost of iterative computations ⋮ An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating. ⋮ Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG ⋮ Exploiting Lower Precision Arithmetic in Solving Symmetric Positive Definite Linear Systems and Least Squares Problems ⋮ Error Bounds for Lanczos-Based Matrix Function Approximation ⋮ Revisiting \((k,\ell)\)-step methods
Uses Software
This page was built for publication: Estimating the Attainable Accuracy of Recursively Computed Residual Methods
