有限差分近似于PDE系统强一致性的算法方法
Algorithmic approach to strong consistency analysis of finite difference approximations to PDE systems
AI总结:
本文提出了一种算法方法,用于分析多项式非线性偏微分方程系统有限差分近似的强一致性,通过微分Thomas分解和差分类比分解联合验证近似的一致性,应用于不可压缩纳维-斯托克斯方程的强一致差分近似。
摘要:
对于广泛的一类多项式非线性偏微分方程系统,我们提出了一种算法方法,用于其在笛卡尔网格上的有限差分近似强一致性分析。首先,我们将微分Thomas分解应用于输入系统,得到解集的划分。我们考虑输出的简单子系统,其中包含感兴趣的解。然后,针对该子系统,我们提出了一种验证其有限差分近似强一致性的算法。为此,我们开发了微分Thomas分解的差分类比,两者共同允许验证近似的强一致性。作为我们方法的应用,我们展示了如何产生不可压缩纳维-斯托克斯方程(包括压力泊松方程)的强一致差分近似。
英文摘要:
For a wide class of polynomially nonlinear systems of partial differential equations we suggest an algorithmic approach to the s(trong)-consistency analysis of their finite difference approximations on Cartesian grids. First we apply the differential Thomas decomposition to the input system, resulting in a partition of the solution set. We consider the output simple subsystem that contains a solution of interest. Then, for this subsystem, we suggest an algorithm for verification of s-consistency for its finite difference approximation. For this purpose we develop a difference analogue of the differential Thomas decomposition, both of which jointly allow to verify the s-consistency of the approximation. As an application of our approach, we show how to produce s-consistent difference approximations to the incompressible Navier-Stokes equations including the pressure Poisson equation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。