Papers › Robust Approaches to Handling Complex Geometries with Galerkin Difference Methods

Robust Approaches to Handling Complex Geometries with Galerkin Difference Methods

15 Jun 2018arXiv:1806.06103links table onlyarchive 2025-07-28

Jeremy E. Kozdon, Lucas C. Wilcox, Thomas Hagstrom, Jeffrey W. Banks

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

The Galerkin difference (GD) basis is a set of continuous, piecewise polynomials defined using a finite difference like grid of degrees of freedom. The one dimensional GD basis functions are naturally extended to multiple dimensions using the tensor product constructions to quadrilateral elements for discretizing partial differential equations. Here we propose two approaches to handling complex geometries using the GD basis within a discontinuous Galerkin finite element setting: (1) using non-conforming, curvilinear GD elements and (2) coupling affine GD elements with curvilinear simplicial elements. In both cases the (semidiscrete) discontinuous Galerkin method is provably energy stable even when variational crimes are committed and in both cases a weight-adjusted mass matrix is used, which ensures that only the reference mass matrix must be inverted. Additionally, we give sufficient conditions on the treatment of metric terms for the curvilinear, nonconforming GD elements to ensure that the scheme is both constant preserving and conservative. Numerical experiments confirm the stability results and demonstrate the accuracy of the coupled schemes.

PaperPDFCode

Code

bfam/GDComplexGeometries officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections