4.6 Article

A two-stage Markov chain Monte Carlo method for seismic inversion and uncertainty quantification

期刊

GEOPHYSICS
卷 84, 期 6, 页码 R1003-R1020

出版社

SOC EXPLORATION GEOPHYSICISTS
DOI: 10.1190/GEO2018-0893.1

关键词

-

资金

  1. National Science Foundation's Enriched Doctoral Training Program, DMS grant [1514808]
  2. Science without Borders/CNPq-Brazil [400169/2014-2]
  3. UT Dallas 3D+4D Seismic Imaging and Inversion Research Consortium
  4. Direct For Mathematical & Physical Scien
  5. Division Of Mathematical Sciences [1514808] Funding Source: National Science Foundation

向作者/读者索取更多资源

Bayesian methods for full-waveform inversion allow quantification of uncertainty in the solution, including determination of interval estimates and posterior distributions of the model unknowns. Markov chain Monte Carlo (MCMC) methods produce posterior distributions subject to fewer assumptions, such as normality, than deterministic Bayesian methods. However, MCMC is computationally a very expensive process that requires repeated solution of the wave equation for different velocity samples. Ultimately, a large proportion of these samples (often 40%-90%) is rejected. We have evaluated a two-stage MCMC algorithm that uses a coarse-grid filter to quickly reject unacceptable velocity proposals, thereby reducing the computational expense of solving the velocity inversion problem and quantifying uncertainty. Our filter stage uses operator upscaling, which provides near-perfect speedup in parallel with essentially no communication between processes and produces data that are highly correlated with those obtained from the full fine-grid solution. Four numerical experiments demonstrate the efficiency and accuracy of the method. The two-stage MCMC algorithm produce the same results (i.e., posterior distributions and uncertainty information, such as medians and highest posterior density intervals) as the Metropolis-Hastings MCMC. Thus, no information needed for uncertainty quantification is compromised when replacing the one-stage MCMC with the more computationally efficient two-stage MCMC. In four representative experiments, the two-stage method reduces the time spent on rejected models by one-third to one-half, which is important because most of models tried during the course of the MCMC algorithm are rejected. Furthermore, the two-stage MCMC algorithm substantially reduced the overall time-pertrial by as much as 40%, while increasing the acceptance rate from 9% to 90%.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据