A posteriori superlinear convergence bounds for block conjugate gradient
From MaRDI portal
Publication:6163322
Abstract: In this paper, we extend to the block case, the a posteriori bound showing superlinear convergence of Conjugate Gradients developed in [J. Comput. Applied Math., 48 (1993), pp. 327-341]; that is, we obtain similar bounds, but now for block Conjugate Gradients. We also present a series of computational experiments illustrating the validity of the bound developed here, as well as the bound from [SIAM Review, 47 (2005), pp. 247-272] using angles between subspaces. Using these bounds, we make some observations on the onset of superlinearity, and how this onset depends on the eigenvalue distribution and the block size.
Recommendations
- Superlinear convergence of conjugate gradients
- On the sublinear and superlinear rate of convergence of conjugate gradient methods
- Reaching the superlinear convergence phase of the CG method
- The rate of convergence of conjugate gradients
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Admissible and attainable convergence behavior of block Arnoldi and GMRES
- Block Krylov subspace methods for functions of matrices
- Block Krylov subspace methods for functions of matrices. II: Modified block FOM
- Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
- Further results on the convergence behavior of conjugate-gradients and Ritz values
- GMRES and the minimal polynomial
- Methods of conjugate gradients for solving linear systems
- Numerical Mathematics and Advanced Applications 2011
- ON THE RATE OF CONVERGENCE OF THE CONJUGATE GRADIENT METHOD FOR LINEAR OPERATORS IN HILBERT SPACE
- On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- On the real convergence rate of the conjugate gradient method
- Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations
- Perturbation theory for linear operators.
- Recent computational developments in Krylov subspace methods for linear systems
- Ritz and pseudo-Ritz values using matrix polynomials
- Some Superlinear Convergence Results for the Conjugate Gradient Method
- Superlinear CG convergence for special right-hand sides
- The block Lanczos method for linear systems with multiple right-hand sides
- The block conjugate gradient algorithm and related methods
- The block grade of a block Krylov space
- The convergence behavior of Ritz values in the presence of close eigenvalues
- The rate of convergence of conjugate gradients
- The superlinear convergence behaviour of GMRES
This page was built for publication: A posteriori superlinear convergence bounds for block conjugate gradient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163322)