Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 2009 | public
Journal Article

Adaptive spacetime meshing for discontinuous Galerkin methods

Thite, Shripad

Abstract

Spacetime-discontinuous Galerkin (SDG) finite element methods are used to solve hyperbolic spacetime partial differential equations (PDEs) to accurately model wave propagation phenomena arising in important applications in science and engineering. Tent Pitcher is a specialized algorithm, invented by Üngör and Sheffer (2000) and extended by Erickson et al. (2005) to construct an unstructured simplicial (d + 1)-dimensional spacetime mesh over an arbitrary d-dimensional space domain. Tent Pitcher is an advancing front algorithm that incrementally adds groups of elements to the evolving spacetime mesh. It supports an accurate, local, and parallelizable solution strategy by interleaving mesh generation with an SDG solver. When solving nonlinear PDEs, previous versions of Tent Pitcher must make conservative worst-case assumptions about the physical parameters which limit the duration of spacetime elements. Thus, these algorithms create a mesh with many more elements than necessary. In this paper, we extend Tent Pitcher to give the first spacetime meshing algorithm suitable for efficient simulation of nonlinear phenomena using SDG methods. We adapt the duration of spacetime elements to changing physical parameters due to nonlinear response. Given a triangulated 2-dimensional Euclidean space domain M corresponding to time t = 0 and initial and boundary conditions of the underlying hyperbolic spacetime PDE, we construct an unstructured tetrahedral mesh in the spacetime domain E^2 x R. For every target time T ≥ 0, our algorithm meshes the spacetime volume M x [0, T] with a bounded number of non-degenerate tetrahedra. A recent extension of Tent Pitcher due to Abedi et al. (2004) adapts the spatial size of spacetime elements in 2D x time to a posteriori estimates of numerical error. Our extension of Tent Pitcher retains the ability to perform adaptive refinement and coarsening of the mesh. We thus obtain the first adaptive nonlinear Tent Pitcher algorithm to build spacetime meshes in 2D x time.

Additional Information

© 2008 Elsevier B.V. Received 6 October 2006. Received in revised form 1 July 2008. Accepted 2 July 2008. Available online 24 July 2008. Communicated by S. Arya. Research presented in this paper was conducted at the Department of Computer Science and the Center for Process Simulation and Design, University of Illinois at Urbana-Champaign; the author was supported in part by NSF ITR grant DMR 01-21695. The author thanks the other current and former members of the CPSD spacetime group at UIUC with whom he has collaborated directly—Reza Abedi, Jonathan Booth, Shuo-Heng Chung, Jeff Erickson, Yong Fan, Michael Garland, Damrong Guoy, Robert Haber, Morgan Hawker, Mark Hills, Sanjay Kale, Jayandran Palaniappan, John Sullivan, and Yuan Zhou—especially Jeff Erickson and Robert Haber. Thanks for valuable feedback to the anonymous referees for the 20th ACM Symposium on Computational Geometry (SoCG) and the 13th International Meshing Roundtable (IMR 2004), where related papers appeared. The author gratefully acknowledges time during post-doctoral positions at TU-Eindhoven and at Caltech to work on this journal paper. Funding from the Center for Process Simulation and Design (CPSD) at the University of Illinois at Urbana-Champaign is gratefully acknowledged. CPSD is funded primarily by the National Science Foundation under the ITR initiative, with joint sponsorship by the Division of Materials Research, and the Directorate for Computer and Information Science and Engineering. The author's research was supported in part by NSF ITR grant DMR 01-21695. Special thanks to the anonymous referees for invaluable suggestions which helped improve the presentation of this paper.

Additional details

Created:
August 22, 2023
Modified:
October 17, 2023