基于二次流形的非线性模型降阶:通过具有维度依赖正则化的贪心算法
Nonlinear Model Order Reduction on Quadratic Manifolds via Greedy Algorithms with Dimension-Dependent Regularization
AI总结:
本文提出一种改进的二次流形方法,结合双贪心算法和物理参数贪心算法,平衡降阶模型的精度与稳定性,提升计算效率。
摘要:
传统投影基降阶建模通过将全模型投影到线性子空间来近似,当解流形的Kolmogorov n-宽度快速衰减时,降阶模型(ROM)可成为高效且准确的模拟器。然而,对于参数偏微分方程,若Kolmogorov n-宽度缓慢衰减,则所需线性子空间维度变得非常大,从而影响计算效率。为解决这一限制,最近提出了二次流形方法。这些数据驱动方法首先通过在大量快照上最小化线性投影误差来识别二次映射,通常借助正则化技术解决关联的最小化问题,然后利用此映射构建ROMs。本文提出并测试了一种新的二次流形方法增强方案,通过引入一种首次提出的双贪心算法来处理正则化参数,结合标准贪心算法处理物理参数。我们的方法在精度和稳定性之间取得平衡,导致一种高效且数据稀疏的算法。在线性传输、声波、对流扩散和Burgers方程上的数值实验展示了所提算法的准确性、效率和稳定性。
英文摘要:
Traditional projection-based reduced-order modeling approximates the full-order model by projecting it onto a linear subspace. With a fast-decaying Kolmogorov $n$-width of the solution manifold, the resulting reduced-order model (ROM) can be an efficient and accurate emulator. However, for parametric partial differential equations with slowly decaying Kolmogorov $n$-width, the dimension of the linear subspace required for a reasonable accuracy becomes very large, which undermines computational efficiency. To address this limitation, quadratic manifold methods have recently been proposed. These data-driven methods first identify a quadratic mapping by minimizing the linear projection error over a large set of snapshots, often with the aid of regularization techniques to solve the associated minimization problem, and then use this mapping to construct ROMs. In this paper, we propose and test a novel enhancement to this quadratic manifold approach by introducing a first-of-its-kind double-greedy algorithm on the regularization parameters coupled with a standard greedy algorithm on the physical parameter. Our approach balances the trade-off between the accuracy of the quadratic mapping and the stability of the resulting nonlinear ROM, leading to a highly efficient and data-sparse algorithm. Numerical experiments conducted on equations such as linear transport, acoustic wave, advection-diffusion, and Burgers' demonstrate the accuracy, efficiency, and stability of the proposed algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。