Retooling the method of block conjugate gradients
This exploratory paper presents an effective means to generate block implementations of the conjugate gradient method for the solution of large, sparse systems of linear equations with symmetric positive definite matrix and vector right-hand side. The new algorithms presented avoid rank estimation and deflation through the use of changes of bases and algorithmic reformulation that eliminate rank near defects. The transformations implemented include a robust process of nonunitary orthogonalization in the metric of a symmetric positive definite matrix. Sample results of experiments are summarized at the end of the paper.
- A block conjugate gradient method applied to linear systems with multiple right-hand sides
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- A breakdown-free block conjugate gradient method
- scientific article; zbMATH DE number 4092656
- Block Preconditioning for the Conjugate Gradient Method
- An automatic procedure for updating the block size in the block conjugate gradient method for solving linear systems
- Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\)
- A new projected variant of the deflated block conjugate gradient method
- Development of the block BiCGGR2 method for linear systems with multiple right-hand sides
- Efficient implementations of the modified Gram-Schmidt orthogonalization with a non-standard inner product
- A block MINRES algorithm based on the band Lanczos method
- A breakdown-free block conjugate gradient method
- Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems
- A block conjugate gradient method applied to linear systems with multiple right-hand sides
- Improvement of the accuracy of the approximate solution of the Block BiCR method
- Development of the Block BiCGSTAB(\ell) method for solving linear systems with multiple right hand sides
- scientific article; zbMATH DE number 434532 (Why is no real title available?)
- Block variants of the COCG and COCR methods for solving complex symmetric linear systems with multiple right-hand sides
- The restrictively preconditioned conjugate gradient methods on normal residual for block two-by-two linear systems
- A Comparison of Three Basic Conjugate Direction Methods
- scientific article; zbMATH DE number 1782362 (Why is no real title available?)
- A deflated conjugate gradient method for multiple right hand sides and multiple shifts
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- Application and performance evaluation of a method using block structures for saddle point problems appearing in image reconstruction problems
- Block conjugate gradient algorithms for least squares problems
- Strategies for the vectorized block conjugate gradients method
- Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions
- Parallel Processing and Applied Mathematics
- On short recurrence Krylov type methods for linear systems with many right-hand sides
- Block conjugate gradient methods with error norm estimates for least squares problems
- Block cross-interactive residual smoothing for Lanczos-type solvers for linear systems with multiple right-hand sides
- Block CG algorithms revisited
- On finite precision block Lanczos computations
- Simple convergence analysis for the block conjugate gradient method with variable preconditioning
- Error norm estimates for the block conjugate gradient algorithms
- Order-reducing conjugate gradients versus block AOR for constrained least-squares problems
This page was built for publication: Retooling the method of block conjugate gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5942489)
