Retooling the method of block conjugate gradients

zbMath0985.65021MaRDI QIDQ5942489

Augustin A. Dubrulle

Publication date: 16 September 2001

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121814

zbMATH Keywords

algorithmsnumerical examplesconjugate gradient methodorthogonalizationlarge, sparse systems of linear equations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)

Related Items (14)

A breakdown-free block conjugate gradient method ⋮ Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems ⋮ Application and performance evaluation of a method using block structures for saddle point problems appearing in image reconstruction problems ⋮ Block Variants of the COCG and COCR Methods for Solving Complex Symmetric Linear Systems with Multiple Right-Hand Sides ⋮ A deflated conjugate gradient method for multiple right hand sides and multiple shifts ⋮ Strategies for the Vectorized Block Conjugate Gradients Method ⋮ Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\) ⋮ On short recurrence Krylov type methods for linear systems with many right-hand sides ⋮ 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 ⋮ Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions ⋮ 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 ⋮ A block MINRES algorithm based on the band Lanczos method

This page was built for publication: Retooling the method of block conjugate gradients