Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
From MaRDI portal
Publication:457037
DOI10.1007/s11075-013-9713-zzbMath1298.65054OpenAlexW1989631942MaRDI QIDQ457037
Tomáš Gergelits, Zdeněk Strakoš
Publication date: 26 September 2014
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-013-9713-z
numerical examplesconjugate gradient methodclusters of eigenvaluesKrylov subspace methodStieltjes moment problemrounding errorsChebyshev semi-iterative methodcomposite polynomial convergence boundsfinite precision computations
Related Items
The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology ⋮ Guaranteed two-sided bounds on all eigenvalues of preconditioned diffusion and elasticity problems solved by the finite element method. ⋮ Estimating and localizing the algebraic and total numerical errors using flux reconstructions ⋮ Iterative solution of spatial network models by subspace decomposition ⋮ A posteriori superlinear convergence bounds for block conjugate gradient ⋮ A Convergence Analysis of the MINRES Method for Some Hermitian Indefinite Systems ⋮ Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method ⋮ A comparative study on low-memory iterative solvers for FFT-based homogenization of periodic media ⋮ Decomposition into subspaces preconditioning: abstract framework ⋮ Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator ⋮ On the cost of iterative computations ⋮ 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
- Unnamed Item
- Unnamed Item
- On the real convergence rate of the conjugate gradient method
- Equivalent operator preconditioning for elliptic problems
- On the eigenvalue distribution of a class of preconditioning methods
- The rate of convergence of conjugate gradients
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems
- A class of iterative methods for finite element equations
- Iterative solution of large sparse systems of equations. Transl. from the German
- On the convergence rate of the conjugate gradients in presence of rounding errors
- Estimates in quadratic formulas
- A note on conjugate gradient convergence
- Projection methods for systems of equations
- A note on conjugate gradient convergence. III
- On error estimation in the conjugate gradient method and why it works in finite precision computations
- Superlinear CG convergence for special right-hand sides
- On computing quadrature-based bounds for the \(A\)-norm of the error in conjugate gradients
- Operator preconditioning
- Error estimation in preconditioned conjugate gradients
- A note on preconditioners and scalar products in Krylov subspace methods for self-adjoint problems in Hilbert space
- Bounds for the error of linear systems of equations using the theory of moments
- On the theory of equivalent operators and application to the numerical solution of uniformly elliptic partial differential equations
- On sensitivity of Gauss-Christoffel quadrature
- Accuracy of Two Three-term and Three Two-term Recurrences for Krylov Space Solvers
- Superlinear Convergence of Conjugate Gradients
- Interplay between discretization and algebraic computation in adaptive numerical solutionof elliptic PDE problems
- Differentiating the Method of Conjugate Gradients
- Preconditioning discretizations of systems of partial differential equations
- Krylov Subspace Methods
- An Optimal Iterative Solver for Symmetric Indefinite Systems Stemming from Mixed Approximation
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Numerical Methods in Scientific Computing, Volume I
- Some Superlinear Convergence Results for the Conjugate Gradient Method
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient Method
- Iterative Solution Methods
- Error Estimates for the Solution of Linear Systems
- The Lanczos and Conjugate Gradient Algorithms
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- Numerical Determination of Fundamental Modes
- Methods of conjugate gradients for solving linear systems
- On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
- OPTIMAL PRECONDITIONERS BASED ON RATE OF CONVERGENCE ESTIMATES FOR THE CONJUGATE GRADIENT METHOD
- An iterative method with error estimators
- On the sublinear and superlinear rate of convergence of conjugate gradient methods
- Computable error bounds and estimates for the conjugate gradient method
