Abstract
Space-time discontinuous Galerkin (DG) methods provide a solution for a wide variety of numerical problems such as inviscid Burgers equation and elastodynamic analysis. Recent research shows that it is possible to solve a DG system using an element-by-element procedure if the space-time mesh satisfies a cone constraint. This constraint requires that the dihedral angle of each interior mesh face with respect to the space domain is less than or equal to a specified angle function α(). Whenever there is a face that violates the cone constraint, the elements at the face must be coupled in the solution. In this paper we consider the problem of generating a simplicial space-time mesh where the size of each group of elements that need to be coupled is bounded by a constant number k. We present an algorithm for generating such meshes which is valid for any nD×TIME domain (n is a natural number). The k in the algorithm is based on a node degree in an n-dimensional space domain mesh.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
