DeepAI AI Chat
Log In Sign Up

An Explicit Mapped Tent Pitching Scheme for Maxwell Equations

by   Jay Gopalakrishnan, et al.

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.


Convergence analysis of some tent-based schemes for linear hyperbolic systems

Finite element methods for symmetric linear hyperbolic systems using uns...

Stability of structure-aware Taylor methods for tents

Structure-aware Taylor (SAT) methods are a class of timestepping schemes...

Structure aware Runge-Kutta time stepping for spacetime tents

We introduce a new class of Runge-Kutta type methods suitable for time s...

Generalized implementation of the order-preserving mapping for mapped WENO schemes

A serious and ubiquitous issue in existing mapped WENO schemes is that m...