Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods

DOI10.1137/090767418zbMath1227.65092OpenAlexW2054478891MaRDI QIDQ3095050

Kolja Brix, Ralf Massjung, Alexander Voß

Publication date: 28 October 2011

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f8bb71c6980f1634abbe273232233c0af9e6a3f2

zbMATH Keywords

algorithmsnumerical examplesdiscontinuous Galerkin methodconnectivityadaptive methodmultilevel methodlinear transport equationmultiscale methodsneighboring algorithmpointerless data structures

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Initial-boundary value problems for first-order hyperbolic equations (35L04)

Related Items

A selective immersed discontinuous Galerkin method for elliptic interface problems ⋮ A Tetrahedral Space-Filling Curve for Nonconforming Adaptive Meshes ⋮ Adaptive multiresolution discontinuous Galerkin schemes for conservation laws

Uses Software

• ALBERTA
• igpm_t_lib