.png){kind=icon}
返回
Sparse-grid, reduced-basis Bayesian inversion
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cma.2015.08.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We analyze reduced basis (RB for short) short acceleration of recently proposed sparse Bayesian inversion algorithms for partial differential equations with uncertain distributed parameter, for observation data subject to additive, Gaussian observation noise. Specifically, Bayesian inversion of affine-parametric, linear operator families on possibly high-dimensional parameter spaces. We consider high-fidelity Petrov-Galerkin (PG) discretizations of these countably-parametric operator families: we allow general families of inf-sup stable, PG Finite-Element methods, covering most conforming primal and mixed Finite-Element discretizations of standard problems in mechanics. RB acceleration of the high-dimensional, parametric forward response maps which need to be numerically solved numerous times in Bayesian inversion is proposed and convergence rate bounds for the error in the Bayesian estimate incurred by the use of RB are derived. As consequence of recent theoretical results on dimension-independent sparsity of parametric responses, and preservation of sparsity for holomorphic-parametric problems, we establish new convergence rates of greedy RB compressions for both, the parametric forward maps as well as for the countably-parametric posterior densities which arise in Bayesian inversion. We show that the convergence rates for the RB compressions of the parametric forward maps as well as of the countably-parametric, sparse Bayesian posterior densities are free from the curse of dimensionality and depend only on the sparsity of the uncertain input data. In particular, we establish the quadratic convergence of the RB compression for the posterior densities with respect to that for the parametric forward maps. Numerical experiments for linear elliptic, affine-parametric model problems in two space dimensions with hundreds of parameters are reported which confirm that the proposed adaptive sparse grid reduced basis algorithms indeed exploit sparsity of both, the parametric forward maps as well as the Bayesian posterior density. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Bayesian inversion
Reduced basis
Sparse grid
Error estimates
Best N-term convergence
Curse of dimensionality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.3W
被引数:
5.6W
机构
引用论文
Incremental Low Rank Noise Reduction for Robust Infrared Tracking of Body Temperature during Medical Imaging.png)
Electronics
OAAI
ElectronicsIF0
OAAI分享收藏分享收藏
SARS Cov‐2 vaccination induces de novo donor‐specific HLA antibodies in a renal transplant patient on waiting list: A case reportHLAOAAI
HLAIF0
OAAI分享收藏
查看更多内容