A Bayesian conjugate gradient method (with Discussion)

15Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Cockayne, J., Oates, C. J., Ipsen, I. C. F., & Girolami, M. (2019). A Bayesian conjugate gradient method (with Discussion). Bayesian Analysis, 14(3), 937–965. https://doi.org/10.1214/19-BA1145

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free