arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.10656math.NAcs.NAphysics.flu-dyn
收藏

自适应稀疏插值加速时不定常基非线性随机降阶建模

Adaptive sparse interpolation for accelerating nonlinear stochastic reduced-order modeling with time-dependent bases

Mohammad Hossein Naderi, Hessam Babaee

摘要:

基于不定常基(TDBs)的随机降阶建模已被证明是从随机偏微分方程(SPDE)中提取和利用低维流形的成功方法。基于不定常基求解秩- $r$降阶模型(ROM)的名义计算成本,也称为TDB-ROM近似等于求解$r$随机样本的全阶模型。到目前为止,只有线性或二次SPDE才能实现这种标称性能,但代价是高度侵入性的过程。另一方面,对于具有非多项式非线性的问题,求解TDB发展方程的计算成本与求解全阶模型相同。在这项工作中,我们提出了一个自适应稀疏插值算法,使随机TDB-ROM实现标称计算成本的通用非线性SPDE。我们的算法使用离散经验插值方法(DEIM)构造了一个低秩近似的SPDE的右手边。该算法不需要任何离线计算,因此,低秩近似可以适应任何瞬态变化的动态飞行。我们还提出了一种秩自适应策略来控制稀疏插值的误差。我们的算法通过对状态空间和随机空间的自适应采样来实现计算加速。我们用两个例子说明了我们的方法的有效性:(1)一维随机Burgers方程,(2)受100维随机扰动的二维可压缩斯托克斯方程。在所有情况下,所提出的算法的结果在数量级减少的计算成本。

英文摘要:

Stochastic reduced-order modeling based on time-dependent bases (TDBs) has proven successful for extracting and exploiting low-dimensional manifold from stochastic partial differential equations (SPDEs). The nominal computational cost of solving a rank-$r$ reduced-order model (ROM) based on time-dependent basis, a.k.a. TDB-ROM, is roughly equal to that of solving the full-order model for $r$ random samples. As of now, this nominal performance can only be achieved for linear or quadratic SPDEs -- at the expense of a highly intrusive process. On the other hand, for problems with non-polynomial nonlinearity, the computational cost of solving the TDB evolution equations is the same as solving the full-order model. In this work, we present an adaptive sparse interpolation algorithm that enables stochastic TDB-ROMs to achieve nominal computational cost for generic nonlinear SPDEs. Our algorithm constructs a low-rank approximation for the right hand side of the SPDE using the discrete empirical interpolation method (DEIM). The presented algorithm does not require any offline computation and as a result the low-rank approximation can adapt to any transient changes of the dynamics on the fly. We also propose a rank-adaptive strategy to control the error of the sparse interpolation. Our algorithm achieves computational speedup by adaptive sampling of the state and random spaces. We illustrate the efficiency of our approach for two test cases: (1) one-dimensional stochastic Burgers' equation, and (2) two-dimensional compressible Navier-Stokes equations subject to one-hundred-dimensional random perturbations. In all cases, the presented algorithm results in orders of magnitude reduction in the computational cost.

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

↑