首页> 外文会议>International conference on computational science and its applications >Convergence Analysis of MCMC Methods for Subsurface Flow Problems
【24h】

Convergence Analysis of MCMC Methods for Subsurface Flow Problems

机译:地下流动问题的MCMC方法的收敛性分析

获取原文

摘要

In subsurface characterization using a history matching algo-rithm subsurface properties are reconstructed with a set of limited data. Here we focus on the characterization of the permeability field in an aquifer using Markov Chain Monte Carlo (MCMC) algorithms, which are reliable procedures for such reconstruction. The MCMC method is serial in nature due to its Markovian property. Moreover, the calculation of the likelihood information in the MCMC is computationally expensive for subsurface flow problems. Running a long MCMC chain for a very long period makes the method less attractive for the characterization of subsurface. In contrast, several shorter MCMC chains can substantially reduce computation time and can make the framework more suitable to subsurface flows. However, the convergence of such MCMC chains should be carefully studied. In this paper, we consider multi-MCMC chains for a single-phase flow problem and analyze the chains aiming at a reliable characterization.
机译:在使用历史记录进行地下特征描述的算法中,利用一组有限的数据重建了地下特征。在这里,我们专注于使用Markov Chain Monte Carlo(MCMC)算法表征含水层中的渗透率场,这是进行此类重构的可靠程序。 MCMC方法由于具有马尔可夫性质,因此本质上是串行的。此外,对于地下流动问题,MCMC中似然信息的计算在计算上是昂贵的。运行很长的MCMC链很长时间会使该方法对地下特征的吸引力降低。相反,几条较短的MCMC链可以大大减少计算时间,并且可以使框架更适合于地下流动。但是,应仔细研究此类MCMC链的收敛性。在本文中,我们考虑针对单相流问题的多MCMC链,并针对可靠的特征进行分析。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号