arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1209.5455math.NAcs.NA
收藏

通过预测降低非线性隐式降阶模型的时间复杂度

Decreasing the temporal complexity for nonlinear, implicit reduced-order models by forecasting

Sandia National Laboratories(桑迪亚国家实验室)

Kevin Carlberg, Jaideep Ray, Bart van Bloemen Waanders

AI总结:

针对非线性隐式降阶模型,提出利用Gappy POD预测未来时间步的未知变量作为牛顿法初始猜测,从而减少线性系统求解次数,降低时间复杂度。

摘要:

非线性常微分方程的隐式数值积分需要在每个时间步求解一个非线性代数方程组。每个方程组通常通过牛顿类方法求解,这涉及一系列线性系统求解。大多数针对非线性常微分方程的模型降阶技术利用系统空间行为的先验知识来降低每个线性系统求解的计算复杂度。然而,降阶模拟中线性系统求解的次数通常与全阶模拟大致相同。我们提出利用模型时间行为的先验知识来:1)预测未来时间步降阶非线性方程组中的未知变量,2)在降阶模型模拟过程中将该预测用作牛顿类求解器的初始猜测。为了计算预测,我们提出使用Gappy POD方法。目标是生成准确的初始猜测,使得牛顿求解器收敛所需的迭代次数大大减少,从而降低降阶模型模拟中线性系统求解的次数。

英文摘要:

Implicit numerical integration of nonlinear ODEs requires solving a system of nonlinear algebraic equations at each time step. Each of these systems is often solved by a Newton-like method, which incurs a sequence of linear-system solves. Most model-reduction techniques for nonlinear ODEs exploit knowledge of system's spatial behavior to reduce the computational complexity of each linear-system solve. However, the number of linear-system solves for the reduced-order simulation often remains roughly the same as that for the full-order simulation. We propose exploiting knowledge of the model's temporal behavior to 1) forecast the unknown variable of the reduced-order system of nonlinear equations at future time steps, and 2) use this forecast as an initial guess for the Newton-like solver during the reduced-order-model simulation. To compute the forecast, we propose using the Gappy POD technique. The goal is to generate an a ccurate initial guess so that the Newton solver requires many fewer iterations to converge, thereby decreasing the number of lin ear-system solves in the reduced-order-model simulation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑