English

Robust Approaches to Handling Complex Geometries with Galerkin Difference Methods

Numerical Analysis 2021-06-03 v2 Numerical Analysis

Abstract

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.

Keywords

Cite

@article{arxiv.1806.06103,
  title  = {Robust Approaches to Handling Complex Geometries with Galerkin Difference Methods},
  author = {Jeremy E. Kozdon and Lucas C. Wilcox and Thomas Hagstrom and Jeffrey W. Banks},
  journal= {arXiv preprint arXiv:1806.06103},
  year   = {2021}
}

Comments

30 pages, 14 figures

R2 v1 2026-06-23T02:31:40.536Z