Block CG algorithms revisited

DOI10.1007/S11075-025-02038-4MaRDI QIDQ6891576zbMATH OpenFDO

Authors Petr Tichý, G. Meurant, Dorota Šimonová

Publication date 2 December 2025

Published in Numerical Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11075-025-02038-4

zbMATH Keywords

block methodsconjugate gradientsmultiple right-hand sides

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90)

Cites work

• A block conjugate gradient method applied to linear systems with multiple right-hand sides
• A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
• A breakdown of the block CG method
• A breakdown-free block conjugate gradient method
• A deflated conjugate gradient method for multiple right hand sides and multiple shifts
• A Lanczos-type method for multiple starting vectors
• Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
• Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
• Block Krylov subspace methods for functions of matrices
• Error estimation in preconditioned conjugate gradients
• Error norm estimates for the block conjugate gradient algorithms
• Error norm estimation in the conjugate gradient algorithm
• Householder Orthogonalization with a Nonstandard Inner Product
• scientific article; zbMATH DE number 3633705 (Why is no real title available?)
• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
• Matrices, moments and quadrature with applications
• Methods of conjugate gradients for solving linear systems
• On computing quadrature-based bounds for the A-norm of the error in conjugate gradients
• On error estimation in the conjugate gradient method and why it works in finite precision computations
• Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
• Retooling the method of block conjugate gradients
• Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions
• The block conjugate gradient algorithm and related methods
• The Lanczos and Conjugate Gradient Algorithms
• Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
• When does the Lanczos algorithm compute exactly?

Cited in

(6)

• Block conjugate gradient methods with error norm estimates for least squares problems
• 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
• Preconditioning without a preconditioner using randomized block Krylov subspace methods
• Accelerating the Conjugate Gradient Method by Solving Multiple GPU-Parallelized Duplicate Systems

This page was built for publication: Block CG algorithms revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891576)