Accurate error estimation in CG

by   Gérard Meurant, et al.

In practical computations, the (preconditioned) conjugate gradient (P)CG method is the iterative method of choice for solving systems of linear algebraic equations Ax=b with a real symmetric positive definite matrix A. During the iterations it is important to monitor the quality of the approximate solution x_k so that the process could be stopped whenever x_k is accurate enough. One of the most relevant quantities for monitoring the quality of x_k is the squared A-norm of the error vector x-x_k. This quantity cannot be easily evaluated, however, it can be estimated. Many of the existing estimation techniques are inspired by the view of CG as a procedure for approximating a certain Riemann–Stieltjes integral. The most natural technique is based on the Gauss quadrature approximation and provides a lower bound on the quantity of interest. The bound can be cheaply evaluated using terms that have to be computed anyway in the forthcoming CG iterations. If the squared A-norm of the error vector decreases rapidly, then the lower bound represents a tight estimate. In this paper we suggest a heuristic strategy aiming to answer the question of how many forthcoming CG iterations are needed to get an estimate with the prescribed accuracy. Numerical experiments demonstrate that the suggested strategy is efficient and robust.



There are no comments yet.


page 1

page 2

page 3

page 4


Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings

We consider the following oblivious sketching problem: given ϵ∈ (0,1/3) ...

Hierarchical Interpolative Factorization Preconditioner for Parabolic Equations

This note proposes an efficient preconditioner for solving linear and se...

Uniform Error Estimates for the Lanczos Method

The Lanczos method is one of the most powerful and fundamental technique...

Second Order Accurate Hierarchical Approximate Factorization of Sparse SPD Matrices

We describe a second-order accurate approach to sparsifying the off-diag...

Preconditioned Least-Squares Petrov-Galerkin Reduced Order Models

This paper introduces a methodology for improving the accuracy and effic...

Statistical closure modeling for reduced-order models of stationary systems by the ROMES method

This work proposes a technique for constructing a statistical closure mo...

A rounding error analysis of the joint bidiagonalization process with applications to the GSVD computation

The joint bidiagonalization(JBD) process is a useful algorithm for appro...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.