...
首页> 外文期刊>Water resources research >Fast iterative implementation of large-scale nonlinear geostatistical inverse modeling
【24h】

Fast iterative implementation of large-scale nonlinear geostatistical inverse modeling

机译:大规模非线性地统计反演的快速迭代实现

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

[1] In nonlinear geostatistical inverse problems, it often takes a significant amount of computational cost to form linear geostatistical inversion systems by linearizing the forward model. More specifically, the storage cost associated with the sensitivity matrix H (m × n, where m and n are the numbers of measurements and unknowns, respectively) is high, especially when both m and n are large in for instance, 3-D tomography problems. In this research, instead of explicitly forming and directly solving the linear geostatistical inversion system, we use MINRES, a Krylov subspace method, to solve it iteratively. During each iteration in MINRES, we only compute the products Hx and H~T x for any appropriately sized vectors x, for which we solve the forward problem twice. As a result, we reduce the memory requirement from (O)(mn) to (O)(m) + (O)(n). This iterative methodology is combined with the Bayesian inverse method in Kitanidis (1996) to solve large-scale inversion problems. The computational advantages of our methodology are demonstrated using a large-scale 3-D numerical hydraulic tomography problem with transient pressure measurements (250,000 unknowns and ~ 100,000 measurements). In this case, ~200 GB of memory would otherwise be required to fully compute and store the sensitivity matrix H at each Newton step during optimization. The CPU cost can also be significantly reduced in terms of the total number of forward simulations. In the end, we discuss potential extension of the methodology to other geostatistical methods such as the Successive Linear Estimator.
机译:[1]在非线性地统计学反问题中,通过线性化正演模型来形成线性地统计学反演系统通常需要大量的计算成本。更具体地说,与灵敏度矩阵H(m×n,其中m和n分别是测量次数和未知数)相关的存储成本很高,尤其是在例如3-D断层扫描中m和n都很大时问题。在这项研究中,我们没有明确形成和直接求解线性地统计反演系统,而是使用MINRES(一种Krylov子空间方法)来迭代求解。在MINRES中的每次迭代期间,我们仅针对任何适当大小的向量x计算乘积Hx和H〜T x,为此我们两次解决了前向问题。结果,我们将内存需求从(O)(mn)减少为(O)(m)+(O)(n)。这种迭代方法与Kitanidis(1996)中的贝叶斯逆方法相结合,解决了大规模的反演问题。我们的方法的计算优势是通过大规模的3-D数值液压层析成像问题进行的,其中包括瞬态压力测量(250,000个未知数和〜100,000个测量值)。在这种情况下,否则在优化过程中的每个牛顿步长将需要约200 GB的内存来完全计算和存储灵敏度矩阵H。就正向仿真的总数而言,CPU成本也可以大大降低。最后,我们讨论了将该方法扩展到其他地统计方法(如连续线性估计器)的潜在可能性。

著录项

  • 来源
    《Water resources research》 |2014年第1期|198-207|共10页
  • 作者单位

    Earth Sciences Division, Lawrence Berkeley National Laboratory, One Cyclotron Rd., Berkeley, CA 94720, USA;

    Earth Sciences Division, Lawrence Berkeley National Laboratory, Berkeley, California, USA;

    Department of Civil and Environmental Engineering, Stanford University, Stanford, California, USA;

    Earth Sciences Division, Lawrence Berkeley National Laboratory, Berkeley, California, USA;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号