arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.11087math.NAcs.NA
收藏

对数正态程函方程的贝叶斯反演

Bayesian Inversion of Log-normal Eikonal Equations

Zhan Fei Yeo, Viet Ha Hoang

摘要:

研究了在给定噪声观测数据的情况下,在一组空间点上求解程函方程对数正态慢度函数的贝叶斯逆问题。本文研究了用快速推进法求解慢度函数的Karhunen-Loeve展开式中只包含有限项的截尾程函方程来逼近后验概率测度。在Hellinger度规中,这种近似的误差是根据慢度的截断水平和快速推进方法分辨率中的网格大小来推导的。众所周知,用于对后验概率进行采样的简单马尔可夫链蒙特卡罗过程是非常昂贵的。我们发展和证明了一个多层马尔可夫链蒙特卡罗方法的收敛性。使用堆排序过程中解决的前程函方程的快速推进方法,我们的多级马尔可夫链蒙特卡罗方法达到了规定的精度水平,近似的后验期望的数量的兴趣,只需要一个基本上最佳的复杂性水平。数值算例验证了理论结果。

英文摘要:

We study the Bayesian inverse problem for inferring the log-normal slowness function of the eikonal equation given noisy observation data on its solution at a set of spatial points. We study approximation of the posterior probability measure by solving the truncated eikonal equation, which contains only a finite number of terms in the Karhunen-Loeve expansion of the slowness function, by the Fast Marching Method. The error of this approximation in the Hellinger metric is deduced in terms of the truncation level of the slowness and the grid size in the Fast Marching Method resolution. It is well known that the plain Markov Chain Monte Carlo procedure for sampling the posterior probability is highly expensive. We develop and justify the convergence of a Multilevel Markov Chain Monte Carlo method. Using the heap sort procedure in solving the forward eikonal equation by the Fast Marching Method, our Multilevel Markov Chain Monte Carlo method achieves a prescribed level of accuracy for approximating the posterior expectation of quantities of interest, requiring only an essentially optimal level of complexity. Numerical examples confirm the theoretical results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑