Error estimation in preconditioned conjugate gradients
From MaRDI portal
Publication:2490362
DOI10.1007/s10543-005-0032-1zbMath1095.65029OpenAlexW2059066856MaRDI QIDQ2490362
Publication date: 2 May 2006
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-005-0032-1
convergencestopping criterianumerical experimentspreconditioningerror boundsconjugate gradient method
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Algebraic Adaptive Multipreconditioning Applied to Restricted Additive Schwarz, The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology, Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations, Minimization of functional majorant in a posteriori error analysis based on \(H\)(div) multigrid-preconditioned CG method, Estimating and localizing the algebraic and total numerical errors using flux reconstructions, On computing quadrature-based bounds for the \(A\)-norm of the error in conjugate gradients, The behavior of the Gauss-Radau upper bound of the error norm in CG, Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method, Unnamed Item, Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations, Distribution of the discretization and algebraic error in numerical solution of partial differential equations, Matrix-free multigrid block-preconditioners for higher order discontinuous Galerkin discretisations, Linear regression models, least-squares problems, normal equations, and stopping criteria for the conjugate gradient method, On Soft Errors in the Conjugate Gradient Method: Sensitivity and Robust Numerical Detection, Algebraic and discretization error estimation by equilibrated fluxes for discontinuous Galerkin methods on nonmatching grids, Accurate error estimation in CG, Unnamed Item, Exploiting thread-level parallelism in the iterative solution of sparse linear systems, Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\), Inexact Half-Quadratic Optimization for Linear Inverse Problems, On the estimation of a large sparse Bayesian system: the Snaer program, Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG, Superlinear Convergence of Krylov Subspace Methods for Self-Adjoint Problems in Hilbert Space
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- BiCGstab(\(l\)) and other hybrid Bi-CG methods
- Estimates in quadratic formulas
- Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods
- A stopping criterion for the conjugate gradient algorithm in a finite element method framework
- On error estimation in the conjugate gradient method and why it works in finite precision computations
- Numerical experiments in computing bounds for the norm of the error in the preconditioned conjugate gradient algorithm
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Bounds for the error of linear systems of equations using the theory of moments
- Stopping criteria for iterative methods: applications to PDE's
- Residual and Backward Error Bounds in Minimum Residual Krylov Subspace Methods
- On Estimation of theA-norm of the Error in CG and PCG
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Stopping Criteria for Iterative Solvers
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Iterative Solution Methods
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Solving Sparse Linear Systems with Sparse Backward Error
- Iterative Krylov Methods for Large Linear Systems
- Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations
- Algorithm 842
- Methods of conjugate gradients for solving linear systems
