Analysis of a Computational Framework for Bayesian Inverse Problems: Ensemble Kalman Updates and MAP Estimators under Mesh Refinement

From MaRDI portal
Publication:6131418

DOI10.1137/23M1567035arXiv2304.09933OpenAlexW4391476783MaRDI QIDQ6131418FDOQ6131418


Authors: Daniel Sanz-Alonso Edit this on Wikidata


Publication date: 5 April 2024

Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)

Abstract: This paper analyzes a popular computational framework to solve infinite-dimensional Bayesian inverse problems, discretizing the prior and the forward model in a finite-dimensional weighted inner product space. We demonstrate the benefit of working on a weighted space by establishing operator-norm bounds for finite element and graph-based discretizations of Mat'ern-type priors and deconvolution forward models. For linear-Gaussian inverse problems, we develop a general theory to characterize the error in the approximation to the posterior. We also embed the computational framework into ensemble Kalman methods and MAP estimators for nonlinear inverse problems. Our operator-norm bounds for prior discretizations guarantee the scalability and accuracy of these algorithms under mesh refinement.


Full work available at URL: https://arxiv.org/abs/2304.09933




Recommendations




Cites Work






This page was built for publication: Analysis of a Computational Framework for Bayesian Inverse Problems: Ensemble Kalman Updates and MAP Estimators under Mesh Refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131418)