An automatic procedure for updating the block size in the block conjugate gradient method for solving linear systems
The paper considers the problem of constructing an efficient automatic procedure for reducing the block size in the block conjugate gradient method insuring that the resulting rate of convergence is comparable with that of the block conjugate gradient method with constant block size. The numerical results provided show that, independently of the type of distribution of the smallest eigenvalues of the preconditioned matrix, the procedure suggested always leads to a decrease of the arithmetic costs with respect to those of the block method with constant block size.
- Retooling the method of block conjugate gradients
- A block conjugate gradient method applied to linear systems with multiple right-hand sides
- Block Preconditioning for the Conjugate Gradient Method
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- The block preconditioned conjugate gradient method on vector computers
This page was built for publication: An automatic procedure for updating the block size in the block conjugate gradient method for solving linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405653)