A note on conjugate gradient convergence
Linear boundary value problems for ordinary differential equations (34B05) Iterative numerical methods for linear systems (65F10) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Finite difference and finite volume methods for ordinary differential equations (65L12)
For some linear systems arising from discretization of simple two point boundary value problems, the authors consider the convergence of the conjugate gradient algorithm. For a very special class of solutions, it is shown that the iteration counts are independent of the size of the system.
- The rate of convergence of GMRES on a tridiagonal Toeplitz linear system. II
- Efficient iterative solution of the three-dimensional Helmholtz equation
- A note on conjugate gradient convergence. II
- A note on conjugate gradient convergence. III
- Iteration number for the conjugate gradient method
- Distribution of the discretization and algebraic error in numerical solution of partial differential equations
- Convergence of CG and GMRES on a tridiagonal Toeplitz linear system
- scientific article; zbMATH DE number 4011778 (Why is no real title available?)
- Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
- Convergence analysis of Krylov subspace methods
- Comparisons and improvements concerning the accuracy and robustness of inverse heat conduction algorithms
This page was built for publication: A note on conjugate gradient convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1358153)
