Error norm estimates for the block conjugate gradient algorithms

From MaRDI portal





In this paper, the authors extend error norm estimation in the conjugate gradient (CG) algorithm to the block setting. Building on their book [\textit{G. Meurant} and [\textit{P. Tichý} Error norm estimation in the conjugate gradient algorithm. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (2024; Zbl 07851831)], where error norms for solving \(Ax = b\) with symmetric positive definite \(A\) were analyzed, they generalize the most important formulas for estimating the \(A\)-norm of the error to the block case. The block CG algorithm considered is that of [\textit{D. P. O'Leary} Linear Algebra Appl. 29, 293--322 (1980; Zbl 0426.65011)]. They derive BCG algorithms from the block Lanczos procedure, develop block Gauss and block Gauss-Radau quadrature rules, and provide lower and upper bounds on the \(A\)-norm of the error for each system in terms of both BCG iterates and the underlying block Lanczos algorithm. Numerical experiments illustrate the accuracy and practical behavior of these bounds.











This page was built for publication: Error norm estimates for the block conjugate gradient algorithms

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