Foundations of space-time finite element methods: polytopes, interpolation, and integration
Cory V. Frontin, Gage S. Walters, Freddie D. Witherden, Carl W. Lee,, David M. Williams, David L. Darmofal

TL;DR
This paper develops the numerical foundation for four-dimensional space-time finite element methods by constructing elements, polynomial bases, and quadrature rules, enabling more accurate and efficient simulations in 4D settings.
Contribution
It introduces a systematic procedure for constructing 4D elements, explicit orthonormal bases, and symmetric quadrature rules capable of high-degree polynomial integration.
Findings
Explicit expressions for polynomial bases on 4-polytopes
Quadrature rules that integrate degree 17 polynomials exactly
Successful numerical experiments validating the methods
Abstract
The main purpose of this article is to facilitate the implementation of space-time finite element methods in four-dimensional space. In order to develop a finite element method in this setting, it is necessary to create a numerical foundation, or equivalently a numerical infrastructure. This foundation should include a collection of suitable elements (usually hypercubes, simplices, or closely related polytopes), numerical interpolation procedures (usually orthonormal polynomial bases), and numerical integration procedures (usually quadrature rules). It is well known that each of these areas has yet to be fully explored, and in the present article, we attempt to directly address this issue. We begin by developing a concrete, sequential procedure for constructing generic four-dimensional elements (4-polytopes). Thereafter, we review the key numerical properties of several canonical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
