一种用于浅水方程的贪心非侵入式降阶模型
A greedy non-intrusive reduced order model for shallow water equations
AI总结:
针对大规模环境流中的时变浅水问题,提出结合POD与RBF插值的NIROM及新型psr-greedy算法,并通过海岸与河流二维数值实验验证其性能。
摘要:
在本工作中,我们开发了非侵入式降阶模型(NIROM),该模型将本征正交分解(POD)与径向基函数(RBF)插值方法相结合,为大规模环境流应用中出现的时间相关问题构建高效的降阶模型。通过评估具有代表性的河流流动测试问题的准确性和鲁棒性,将 POD-RBF NIROM 的性能与传统的非线性 POD(NPOD)模型进行了比较。研究了不同的贪心算法,以确定 RBF 近似插值点的近最优分布。提出了一种新的幂缩放残差贪心(psr-greedy)算法,以解决现有贪心方法的一些主要缺点。这些贪心算法的相对性能通过涉及海岸和河流动力学的真实二维(2D)浅水流动应用的数值实验进行了研究。
英文摘要:
In this work, we develop Non-Intrusive Reduced Order Models (NIROMs) that combine Proper Orthogonal Decomposition (POD) with a Radial Basis Function (RBF) interpolation method to construct efficient reduced order models for time-dependent problems arising in large scale environmental flow applications. The performance of the POD-RBF NIROM is compared with a traditional nonlinear POD (NPOD) model by evaluating the accuracy and robustness for test problems representative of riverine flows. Different greedy algorithms are studied in order to determine a near-optimal distribution of interpolation points for the RBF approximation. A new power-scaled residual greedy (psr-greedy) algorithm is proposed to address some of the primary drawbacks of the existing greedy approaches. The relative performances of these greedy algorithms are studied with numerical experiments using realistic two-dimensional (2D) shallow water flow applications involving coastal and riverine dynamics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。