arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1209.5028math-phcs.NAmath.MPmath.NAphysics.comp-ph
收藏

利用演化-投影技术的不变量离散化方案

Invariant Discretization Schemes Using Evolution-Projection Techniques

McGill University(麦吉尔大学)

Alexander Bihlo, Jean-Christophe Nave

AI总结:

本文通过演化-投影技术构造保持一维线性热方程最大李对称群子群的不变量有限差分格式,并分析其离散误差和收敛速度。

摘要:

确定了保持一维线性热方程最大李不变群子群的有限差分离散化方案。这些不变方案是通过对计算坐标中热方程的非不变方案进行不变化过程构建的。我们提出了一种新的方法来处理移动离散网格,这对于不变数值方案通常是不可或缺的。其思想是使用不变网格方程,该方程仅针对单个积分步骤确定下一时间层的网格点位置,然后使用不变插值方案将获得的解投影到规则网格上。这保证了方案的不变性,并允许在更简单的固定网格上工作。建立了不变方案的离散误差,并估计了其收敛速度。通过数值测试,揭示了使用所提出的演化-投影策略的不变量离散化方案的数值性质。

英文摘要:

Finite difference discretization schemes preserving a subgroup of the maximal Lie invariance group of the one-dimensional linear heat equation are determined. These invariant schemes are constructed using the invariantization procedure for non-invariant schemes of the heat equation in computational coordinates. We propose a new methodology for handling moving discretization grids which are generally indispensable for invariant numerical schemes. The idea is to use the invariant grid equation, which determines the locations of the grid point at the next time level only for a single integration step and then to project the obtained solution to the regular grid using invariant interpolation schemes. This guarantees that the scheme is invariant and allows one to work on the simpler stationary grids. The discretization errors of the invariant schemes are established and their convergence rates are estimated. Numerical tests are carried out to shed some light on the numerical properties of invariant discretization schemes using the proposed evolution-projection strategy.

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

↑