{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81695"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81695","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Spacetime Meshing for Discontinuous Galerkin Methods","abstract":"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 O. Our algorithm uses a near-optimal number of spacetime elements, each with bounded temporal aspect ratio for any finite prefix of O. When d ≤ 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 salver. Our meshing algorithm thus supports an efficient parallelizable solution strategy by SDG methods.","abstract_html":"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 O. Our algorithm uses a near-optimal number of spacetime elements, each with bounded temporal aspect ratio for any finite prefix of O. When d ≤ 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 salver. Our meshing algorithm thus supports an efficient parallelizable solution strategy by SDG methods.","abstract_has_math":false,"creators":["Thite, Shripad Vidyadhar"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Jeff Erickson"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:20:03Z","date_published":"2015-09-25T20:20:03Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3199155"],"render_values":[{"text":"(MiAaPQ)AAI3199155","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81695","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Jeff Erickson"]},{"key":"dc:creator","label":"Author","values":["Thite, Shripad Vidyadhar"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:20:03Z","10000-01-01","2005"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81695","(MiAaPQ)AAI3199155"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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 O. Our algorithm uses a near-optimal number of spacetime elements, each with bounded temporal aspect ratio for any finite prefix of O. When d ≤ 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 salver. Our meshing algorithm thus supports an efficient parallelizable solution strategy by SDG methods.","Made available in DSpace on 2015-09-25T20:20:03Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3199155.pdf: 3983880 bytes, checksum: 73b3e417d1a865260f623edaebda2dd3 (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82976 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","123 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."]},{"key":"dc:title","label":"Title","values":["Spacetime Meshing for Discontinuous Galerkin Methods"]}]}],"canonical_facts":{"dc:contributor":["Jeff Erickson"],"dc:creator":["Thite, Shripad Vidyadhar"],"dc:date":["2015-09-25T20:20:03Z","10000-01-01","2005"],"dc:description":["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 O. Our algorithm uses a near-optimal number of spacetime elements, each with bounded temporal aspect ratio for any finite prefix of O. When d ≤ 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 salver. Our meshing algorithm thus supports an efficient parallelizable solution strategy by SDG methods.","Made available in DSpace on 2015-09-25T20:20:03Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3199155.pdf: 3983880 bytes, checksum: 73b3e417d1a865260f623edaebda2dd3 (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82976 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","123 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."],"dc:identifier":["http://hdl.handle.net/2142/81695","(MiAaPQ)AAI3199155"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Spacetime Meshing for Discontinuous Galerkin Methods"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}