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

Maxwell Equations的显式映射帐篷调度方案

An Explicit Mapped Tent Pitching Scheme for Maxwell Equations

Jay Gopalakrishnan, Matthias Hochsteger, Joachim Schöberl, Christoph Wintersteiger

摘要:

本文提出了一种新的数值方法来求解不定常Maxwell方程组,该方法也适用于一般的线性双曲型方程。它是基于时空域的非结构化分区为帐篷状区域,尊重因果关系。如果在帐篷底部有一个近似解,则方程可以局部展开到帐篷顶部。通过将帐篷映射到空间域与时间间隔的张量积的域,可以构造通过非结构化网格推进解的完全显式方案。这项工作突出了标准显式龙格库塔格式在这种情况下使用时出现的困难,并提出了一种替代的结构感知泰勒时间步进技术。因此,显式方法的构造,允许可变的时间步长和局部的改进,而不损害高阶精度的空间和时间。这些映射帐篷俯仰(MTP)计划导致高度并行的算法,利用现代计算机体系结构非常好。

英文摘要:

We present a new numerical method for solving time dependent Maxwell equations, which is also suitable for general linear hyperbolic equations. It is based on an unstructured partitioning of the spacetime domain into tent-shaped regions that respect causality. Provided that an approximate solution is available at the tent bottom, the equation can be locally evolved up to the top of the tent. By mapping tents to a domain which is a tensor product of a spatial domain with a time interval, it is possible to construct a fully explicit scheme that advances the solution through unstructured meshes. This work highlights a difficulty that arises when standard explicit Runge Kutta schemes are used in this context and proposes an alternative structure-aware Taylor time-stepping technique. Thus explicit methods are constructed that allow variable time steps and local refinements without compromising high order accuracy in space and time. These Mapped Tent Pitching (MTP) schemes lead to highly parallel algorithms, which utilize modern computer architectures extremely well.

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

↑