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

多面体网格上 Yang–Mills 方程的两种任意阶保约束格式

Two arbitrary-order constraint-preserving schemes for the Yang--Mills equations on polyhedral meshes

Jérôme Droniou, Jia Jia Qian

AI总结:

针对多面体网格上的 Yang–Mills 方程,提出两种基于 DDR 复形与 Lagrange 乘子的任意阶格式,可保持非线性约束并实现 O(h^{k+1}) 收敛。

摘要:

本文提出并研究了用于 Yang–Mills 方程的两种数值格式。Yang–Mills 方程可视为建立在 Lie 代数值函数上的 Maxwell 方程的非线性推广,并与广义相对论的某些表述具有相似之处。两种格式均基于 Discrete de Rham(DDR)方法构建,并继承其主要特征:任意阶精度,以及适用于一般多面体网格。它们利用 DDR 的复形性质,并结合 Lagrange 乘子方法,在离散层面保持与 Yang–Mills 方程相关的一项非线性约束。我们还证明这些格式满足离散能量耗散(该耗散仅来自隐式时间推进)。文中讨论了格式实际实现方面的若干问题;特别是,如何组装局部贡献,以在结合来自 Lie 代数的张量化时,尽量降低处理非线性项所付出的代价。数值测试采用制造解进行,结果表明,两种格式在势场和电场的 L^2 范数中均表现出 O(h^{k+1}) 的收敛性(前提是时间步长也处于该阶),其中 k 是为 DDR 复形选取的多项式次数。我们还通过数值方式展示了约束的保持。

英文摘要:

Two numerical schemes are proposed and investigated for the Yang--Mills equations, which can be seen as a nonlinear generalisation of the Maxwell equations set on Lie algebra-valued functions, with similarities to certain formulations of General Relativity. Both schemes are built on the Discrete de Rham (DDR) method, and inherit from its main features: an arbitrary order of accuracy, and applicability to generic polyhedral meshes. They make use of the complex property of the DDR, together with a Lagrange-multiplier approach, to preserve, at the discrete level, a nonlinear constraint associated with the Yang--Mills equations. We also show that the schemes satisfy a discrete energy dissipation (the dissipation coming solely from the implicit time stepping). Issues around the practical implementations of the schemes are discussed; in particular, the assembly of the local contributions in a way that minimises the price we pay in dealing with nonlinear terms, in conjunction with the tensorisation coming from the Lie algebra. Numerical tests are provided using a manufactured solution, and show that both schemes display a convergence in $L^2$-norm of the potential and electrical fields in $\mathcal O(h^{k+1})$ (provided that the time step is of that order), where $k$ is the polynomial degree chosen for the DDR complex. We also numerically demonstrate the preservation of the constraint.

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

↑