首页> 外文OA文献 >Analysis and improvement of the nonlinear iterative techniques for groundwater flow modelling utilising MODFLOW
【2h】

Analysis and improvement of the nonlinear iterative techniques for groundwater flow modelling utilising MODFLOW

机译:基于MODFLOW的地下水流非线性迭代技术的分析与改进。

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

As groundwater models are being used increasingly in the area of resource allocation, there has been an increase in the level of complexity in an attempt to capture heterogeneity, complex geometries and detail in interaction between the model domain and the outside hydraulic influences. As models strive to represent the real world in ever increasing detail, there is a strong likelihood that the boundary conditions will become nonlinear. Nonlinearities exist in the groundwater flow equation even in simple models when watertable (unconfined) conditions are simulated. This thesis is concerned with how these nonlinearities are treated numerically, with particular focus on the MODFLOW groundwater flow software and the nonlinear nature of the unconfined condition simulation.One of the limitations of MODFLOW is that it employs a first order fixed point iterative scheme to linearise the nonlinear system that arises as a result of the finite difference discretisation process, which is well known to offer slow convergence rates for highly nonlinear problems. However, Newton's method can achieve quadratic convergence and is more effective at dealing with higher levels of nonlinearity. Consequently, the main objective of this research is to investigate the inclusion of Newton's method to the suite of computational tools in MODFLOW to enhance its flexibility in dealing with the increasing complexity of real world problems, as well as providing a more competitive and efficient solution methodology. Furthermore, the underpinning linear iterative solvers that MODFLOW currently utilises are targeted at symmetric systems and a consequenceof using Newton's method would be the requirement to solve non-symmetric Jacobian systems. Therefore, another important aspect of this work is to investigate linear iterative solution techniques that handle such systems, including the newer Krylov style solvers GMRES and BiCGSTAB. To achieve these objectives a number of simple benchmark problems involving nonlinearities through the simulation of unconfined conditions were established to compare the computational performance of the existing MODFLOW solvers to the new solution strategies investigated here. One of the highlights of these comparisons was that Newton's method when combined with an appropriately preconditioned Krylov solver was on average greater than 40% more CPU time efficient than the Picard based solution techniques. Furthermore, a significant amount of this time saving came from the reduction in the number of nonlinear iterations due to the quadratic nature of Newton's method. It was also found that Newton's method benefited more from improved initial conditions than Picard's method. Of all the linear iterative solvers tested, GMRES required the least amount of computational effort. While the Newton method involves more complexity in its implementation, this should not be interpreted as prohibitive in its application. The results here show that the extra work does result in performance increase, and thus the effort is certainly worth it.
机译:随着地下水模型在资源分配领域越来越多地使用,复杂性水平不断提高,试图捕获模型域与外部水力影响之间的异质性,复杂的几何形状和细节。随着模型努力以越来越多的细节表示真实世界,边界条件很有可能会变成非线性。当模拟地下水位(无限制)条件时,即使在简单模型中,地下水流量方程中也存在非线性。本文关注的是如何对这些非线性进行数值处理,尤其关注MODFLOW地下水流量软件和无限制条件模拟的非线性性质。MODFLOW的局限性在于它采用一阶不动点迭代方案来线性化由有限差分离散化过程产生的非线性系统,众所周知,它可以为高度非线性问题提供较慢的收敛速度。但是,牛顿法可以实现二次收敛,并且在处理更高级别的非线性时更有效。因此,本研究的主要目的是研究将牛顿方法包含到MODFLOW中的计算工具套件中,以增强其处理现实世界中日益复杂的问题的灵活性,并提供更具竞争力和效率的解决方案方法。此外,MODFLOW当前使用的基础线性迭代求解器针对对称系统,使用牛顿法的结果将是求解非对称雅可比系统的要求。因此,这项工作的另一个重要方面是研究处理此类系统的线性迭代求解技术,包括较新的Krylov风格求解器GMRES和BiCGSTAB。为了实现这些目标,通过无限制条件的模拟,建立了许多涉及非线性的简单基准问题,以将现有MODFLOW求解器的计算性能与此处研究的新求解策略进行比较。这些比较的亮点之一是,与适当预处理的Krylov求解器结合使用时,牛顿方法平均比基于Picard的解决方案技术多40%的CPU时间效率。此外,由于牛顿法的二次性质,减少了非线性迭代次数,因此节省了大量时间。还发现,牛顿法比皮卡德法受益于改善的初始条件。在测试的所有线性迭代求解器中,GMRES所需的计算量最少。尽管牛顿法在其实施中涉及更多的复杂性,但是在其应用中不应将其解释为过高的。这里的结果表明,额外的工作确实可以提高性能,因此付出的努力无疑是值得的。

著录项

  • 作者

    Durick Andrew Michael;

  • 作者单位
  • 年度 2004
  • 总页数
  • 原文格式 PDF
  • 正文语种 {"code":"en","name":"English","id":9}
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号