arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.10012math.NAcs.NA
收藏

基于惩罚的集成方法的数值分析

Numerical Analysis of Penalty-based Ensemble Methods

Rui Fang

AI总结:

针对流体流动集成预测计算成本高的问题,提出带共享系数矩阵的惩罚式集成方法,解耦压速降内存,给出稳定性证明与误差估计,拓展至含随机变量的Navier-Stokes方程,实验验证其准确高效。

摘要:

流体流动的混沌特性以及初始条件中的不确定性限制了可预测性。初始条件中出现的微小误差可能呈指数级增长,直至达到$\u213c$(1)的饱和量级。集成预测通过对初始条件及其他数据略有不同的多次运行结果取平均,以生成更准确的结果并拓展可预测时限,但这类方法的计算成本可能很高。我们提出了一种采用共享系数矩阵的基于惩罚的集成方法,以降低所需内存与计算成本,从而支持更大的集成规模。惩罚方法通过放松不可压缩条件来解耦压力与速度,进而降低内存需求。本报告给出了该基于惩罚的集成方法的稳定性证明与误差估计,借助蒙特卡洛采样将其拓展至含随机变量的Navier-Stokes方程,并通过三项数值实验验证了该方法的准确性与效率。

英文摘要:

The chaotic nature of fluid flow and the uncertainties in initial conditions limit predictability. Small errors that occur in the initial condition can grow exponentially until they saturate at $\mathcal{O}$(1). Ensemble forecasting averages multiple runs with slightly different initial conditions and other data to produce more accurate results and extend the predictability horizon. However, they can be computationally expensive. We develop a penalty-based ensemble method with a shared coefficient matrix to reduce required memory and computational cost and thereby allow larger ensemble sizes. Penalty methods relax the incompressibility condition to decouple the pressure and velocity, reducing memory requirements. This report gives stability proof and an error estimate of the penalty-based ensemble method, extends it to the Navier-Stokes equations with random variables using Monte Carlo sampling, and validates the method's accuracy and efficiency with three numerical experiments.

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

↑