- Bayesian Anal.
- Volume 14, Number 3 (2019), 937-1012.
A Bayesian Conjugate Gradient Method (with Discussion)
A fundamental task in numerical computation is the solution of large linear systems. The conjugate gradient method is an iterative method which offers rapid convergence to the solution, particularly when an effective preconditioner is employed. However, for more challenging systems a substantial error can be present even after many iterations have been performed. The estimates obtained in this case are of little value unless further information can be provided about, for example, the magnitude of the error. In this paper we propose a novel statistical model for this error, set in a Bayesian framework. Our approach is a strict generalisation of the conjugate gradient method, which is recovered as the posterior mean for a particular choice of prior. The estimates obtained are analysed with Krylov subspace methods and a contraction result for the posterior is presented. The method is then analysed in a simulation study as well as being applied to a challenging problem in medical imaging.
Bayesian Anal., Volume 14, Number 3 (2019), 937-1012.
First available in Project Euclid: 18 May 2019
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Cockayne, Jon; Oates, Chris J.; Ipsen, Ilse C.F.; Girolami, Mark. A Bayesian Conjugate Gradient Method (with Discussion). Bayesian Anal. 14 (2019), no. 3, 937--1012. doi:10.1214/19-BA1145. https://projecteuclid.org/euclid.ba/1558144846
- Supplementary Material for “Bayesian Conjugate-Gradient Method”.