arrow
返回

MULTILEVEL ADAPTIVE SPARSE LEJA APPROXIMATIONS FOR BAYESIAN INVERSE PROBLEMS

delete2020-02-19
delete5
delete
OA
AI
I
Ionuț-Gabriel Farcaș *
J
Jonas Latz
E
Elisabeth Ullmann
T
Tobias Neckel
H
Hans‐Joachim Bungartz
DOI:10.1137/19M1260293delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Deterministic interpolation and quadrature methods are often unsuitable to address Bayesian inverse problems depending on computationally expensive forward mathematical models. While interpolation may give precise posterior approximations, deterministic quadrature is usually unable to efficiently investigate an informative and thus concentrated likelihood. This leads to a large number of required expensive evaluations of the mathematical model. To overcome these challenges, we formulate and test a multilevel adaptive sparse Leja algorithm. At each level, adaptive sparse grid interpolation and quadrature are used to approximate the posterior and perform all quadrature operations, respectively. Specifically, our algorithm uses coarse discretizations of the underlying mathematical model to investigate the parameter space and to identify areas of high posterior probability. Adaptive sparse grid algorithms are then used to place points in these areas and ignore other areas of small posterior probability. The points are weighted Leja points. As the model discretization is coarse, the construction of the sparse grid is computationally efficient. On this sparse grid, the posterior measure can be approximated accurately with few expensive, fine model discretizations. The efficiency of the algorithm can be enhanced further by exploiting more than two discretization levels. We apply the proposed multilevel adaptive sparse Leja algorithm in numerical experiments involving elliptic inverse problems in two- and three-dimensional space, in which we compare it with Markov chain Monte Carlo sampling and a standard multilevel approximation.
Keyword:
Bayesian inference
multilevel method
adaptive sparse grids
partial differential equation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

SIAM Journal on Scientific Computing 封面图
SIAM Journal on Scientific Computing
IF:
2.6
论文数:
5.1K
被引数:
1.8W

机构

T
Technical University of Munich
学者数:
5.2W
论文数: 3.9W
被引数: 6.2W
引用论文

引用论文

err分享
err收藏
Fast sampling of parameterised Gaussian random fields
err2019-05-01
err16
errOAAI
errLatz, Jonas; Eisenberger, Marvin; Ullmann, Elisabeth
err分享
err收藏
Rapid Amygdala Responses during Trace Fear Conditioning without Awareness
err2014-05-13
err0
errOAAI
errNicholas L. Balderston; Douglas H. Schultz; Sylvain Baillet; Fred J. Helmstetter
err分享
err收藏
Aging Increases Prosocial Motivation for Effort
err2021-04-16
err0
errOAAI
errPatricia L. Lockwood; Ayat Abdurahman; Anthony S. Gabay; Daniel Drew; Marin Tamm; Masud Husain; Matthew A. J. Apps
err分享
err收藏
学者 查看更多内容