Efficient Krylov subspace methods for uncertainty quantification in large Bayesian linear inverse problems
Efficient Krylov subspace methods for uncertainty quantification in large Bayesian linear inverse problems
复制标题
DOI:
10.1002/nla.2325
复制
发表时间:
2020-08
影响因子:
4.3
通讯作者:
A. Saibaba;Julianne Chung;Katrina Petroske
中科院分区:
文献类型:
--
作者:
A. Saibaba;Julianne Chung;Katrina Petroske
Uncertainty quantification for linear inverse problems remains a challenging task, especially for problems with a very large number of unknown parameters (e.g., dynamic inverse problems) and for problems where computation of the square root and inverse of the prior covariance matrix are not feasible. This work exploits Krylov subspace methods to develop and analyze new techniques for large‐scale uncertainty quantification in inverse problems. In this work, we assume that generalized Golub‐Kahan‐based methods have been used to compute an estimate of the solution, and we describe efficient methods to explore the posterior distribution. In particular, we use the generalized Golub‐Kahan bidiagonalization to derive an approximation of the posterior covariance matrix, and we provide theoretical results that quantify the accuracy of the approximate posterior covariance matrix and of the resulting posterior distribution. Then, we describe efficient methods that use the approximation to compute measures of uncertainty, including the Kullback‐Liebler divergence. We present two methods that use the preconditioned Lanczos algorithm to efficiently generate samples from the posterior distribution. Numerical examples from dynamic photoacoustic tomography demonstrate the effectiveness of the described approaches.