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

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Sanz-Alonso, Daniel, Waniorek, Nathan
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911780876320768
author Sanz-Alonso, Daniel
Waniorek, Nathan
author_facet Sanz-Alonso, Daniel
Waniorek, Nathan
contents 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érn-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.
format Preprint
id arxiv_https___arxiv_org_abs_2304_09933
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Analysis of a Computational Framework for Bayesian Inverse Problems: Ensemble Kalman Updates and MAP Estimators Under Mesh Refinement
Sanz-Alonso, Daniel
Waniorek, Nathan
Numerical Analysis
Computation
65M32 (Primary) 68Q25, 35Q62 62F15 (Secondary)
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érn-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.
title Analysis of a Computational Framework for Bayesian Inverse Problems: Ensemble Kalman Updates and MAP Estimators Under Mesh Refinement
topic Numerical Analysis
Computation
65M32 (Primary) 68Q25, 35Q62 62F15 (Secondary)
url https://arxiv.org/abs/2304.09933