An Adaptive Newton–ASPEN Solver for Complex Reservoir Models

Knut-Andreas Lie, O. Møyner, Ø. Klemetsdal
{"title":"An Adaptive Newton–ASPEN Solver for Complex Reservoir Models","authors":"Knut-Andreas Lie, O. Møyner, Ø. Klemetsdal","doi":"10.2118/212199-ms","DOIUrl":null,"url":null,"abstract":"\n Standard Newton methods that are used to advance fully implicit or adaptive implicit schemes in time often suffer from slow or stagnant convergence when natural initial guesses are too far from the solution or the discrete flow equations contain nonlinearities that are unbalanced in time and space. Nonlinear solvers based on local-global, domain-decomposition strategies have proved to be significantly more robust than regular Newton but come at a higher computational cost per iteration. The chief example of one such strategy is additive Schwarz preconditioned exact Newton (ASPEN) that rigorously couples local solves, which in sum have little cost compared with a Newton update, with a global update that has a cost comparable to a regular Newton solve.\n We present strategies for combining Newton and ASPEN to accelerate the nonlinear solution process. The main feature is a set of novel monitoring strategies and systematic switching criteria that prevent oversolving and enable us to optimize the choice of solution strategy. At the start of each nonlinear iteration, convergence monitors are computed and can be used to choose the type of nonlinear iteration to perform as well as methods, tolerances, and other parameters used for the optional local domain solves. The convergence monitors and switching criteria are inexpensive to compute.\n We observe the advantages and disadvantages of local-global domain decomposition for practical models of interest for oil recovery and CO2 storage and demonstrate how the computational runtime can be (significantly) reduced by adaptively switching to regular Newton's method when nonlinearities are balanced throughout the physical domain and the local solves provide little benefit relative to their computational cost.","PeriodicalId":205933,"journal":{"name":"Day 2 Wed, March 29, 2023","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Day 2 Wed, March 29, 2023","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2118/212199-ms","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Standard Newton methods that are used to advance fully implicit or adaptive implicit schemes in time often suffer from slow or stagnant convergence when natural initial guesses are too far from the solution or the discrete flow equations contain nonlinearities that are unbalanced in time and space. Nonlinear solvers based on local-global, domain-decomposition strategies have proved to be significantly more robust than regular Newton but come at a higher computational cost per iteration. The chief example of one such strategy is additive Schwarz preconditioned exact Newton (ASPEN) that rigorously couples local solves, which in sum have little cost compared with a Newton update, with a global update that has a cost comparable to a regular Newton solve. We present strategies for combining Newton and ASPEN to accelerate the nonlinear solution process. The main feature is a set of novel monitoring strategies and systematic switching criteria that prevent oversolving and enable us to optimize the choice of solution strategy. At the start of each nonlinear iteration, convergence monitors are computed and can be used to choose the type of nonlinear iteration to perform as well as methods, tolerances, and other parameters used for the optional local domain solves. The convergence monitors and switching criteria are inexpensive to compute. We observe the advantages and disadvantages of local-global domain decomposition for practical models of interest for oil recovery and CO2 storage and demonstrate how the computational runtime can be (significantly) reduced by adaptively switching to regular Newton's method when nonlinearities are balanced throughout the physical domain and the local solves provide little benefit relative to their computational cost.
复杂油藏模型的自适应Newton-ASPEN求解器
当自然初始猜测离解太远或离散流动方程包含时间和空间不平衡的非线性时,用于推进全隐式或自适应隐式方案的标准牛顿方法往往会出现缓慢或停滞的收敛。基于局部-全局、区域分解策略的非线性解算器已被证明比常规牛顿算法鲁棒得多,但每次迭代的计算成本更高。这种策略的主要例子是加性施瓦茨预条件精确牛顿(ASPEN),它严格耦合了局部解,总的来说,与牛顿更新相比,局部解的成本很少,而全局更新的成本与常规牛顿求解相当。我们提出了将牛顿和ASPEN相结合的策略来加速非线性求解过程。主要特点是一套新颖的监测策略和系统的切换标准,防止过度求解,使我们能够优化解决方案策略的选择。在每次非线性迭代开始时,计算收敛监视器,并可用于选择要执行的非线性迭代类型以及用于可选局部域解的方法、公差和其他参数。收敛监视器和切换准则的计算成本较低。我们观察了局部-全局域分解对石油开采和二氧化碳储存的实际模型的优缺点,并展示了当非线性在整个物理域中平衡并且局部解决方案相对于其计算成本几乎没有好处时,如何通过自适应切换到常规牛顿方法来(显着)减少计算运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信