Spacetime Meshing for Discontinuous Galerkin Methods

Thite, Shripad Vidyadhar

Permalink

https://hdl.handle.net/2142/11078 Copy

Description

Title

Spacetime Meshing for Discontinuous Galerkin Methods

Author(s)

Thite, Shripad Vidyadhar

Issue Date

2005-08

Keyword(s)

computer science

Abstract

Important applications in science and engineering, such as modeling traffic flow, seismic waves, electromagnetics, and the simulation of mechanical stresses in materials, require the high-fidelity numerical solution of hyperbolic partial differential equations (PDEs) in space and time variables. Spacetime discontinuous Galerkin (SDG) finite element methods are used to solve such PDEs arising from wave propagation phenomena. To support an accurate and efficient solution procedure using SDG methods and to exploit the flexibility of these methods, we give a meshing algorithm to construct an unstructured simplicial spacetime mesh over an arbitrary simplicial space domain. Our algorithm is the first adaptive spacetime meshing algorithm suitable for efficient solution of nonlinear phenomena using spacetime discontinuous Galerkin finite element methods. Given a triangulated d-dimensional Euclidean space domain M (a simplicial complex) corresponding to time t=0 and initial conditions of the underlying hyperbolic spacetime PDE, we construct an unstructured simplicial mesh of the (d+1)-dimensional spacetime domain Q. Our algorithm uses a near-optimal number of spacetime elements, each with bounded temporal aspect ratio for any finite prefix of Q. When the dimension d is at most 2, our algorithm varies the size of spacetime elements to an a posteriori numerical estimate. Certain facets of our mesh satisfy gradient constraints that allow interleaving mesh generation with the SDG solver. Our meshing algorithm thus supports an efficient parallelizable solution strategy by SDG methods.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11078

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections