In their original paper, Golub and Meurant (BIT 37:687–705, 1997) suggest to compute bounds for the A‐norm of the error in the conjugate gradient (CG) method using Gauss, Gauss‐Radau and Gauss‐Lobatto quadratures. The quadratures are computed using the (1,1)‐entry of the inverse of the corresponding Jacobi matrix (or its rank‐one or rank‐two modifications). The resulting algorithm called CGQL computes explicitly the entries of the Jacobi matrix and its modifications from the CG coefficients. In this paper, we use the fact that CG computes the Cholesky decomposition of the Jacobi matrix which is given implicitly. For Gauss‐Radau and Gauss‐Lobatto quadratures, instead of computing the entries of the modified Jacobi matrices, we directly compute the entries of the Cholesky decompositions of the (modified) Jacobi matrices. This leads to simpler formulas in comparison to those used in CGQL.
