2020
DOI: 10.1007/s11831-020-09502-5
|View full text |Cite
|
Sign up to set email alerts
|

HDGlab: An Open-Source Implementation of the Hybridisable Discontinuous Galerkin Method in MATLAB

Abstract: This paper presents , an open source MATLAB implementation of the hybridisable discontinuous Galerkin (HDG) method. The main goal is to provide a detailed description of both the HDG method for elliptic problems and its implementation available in . Ultimately, this is expected to make this relatively new advanced discretisation method more accessible to the computational engineering community. presents some features not available in other implementations of the HDG method that can be found in the free domain… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 16 publications
(12 citation statements)
references
References 252 publications
0
12
0
Order By: Relevance
“…However, the larger number of elements with shared boundaries also means that we need more grid points than SpEC to reach the same accuracy for a black-hole binary initial-data problem. Variations of the DG scheme, such as a hybridizable DG method, can provide a possible resolution to this effect [64][65][66]. Even without changing the DG scheme, we expect that optimizations of our binary compact-object domain can significantly reduce the number of grid points required to reach a certain accuracy.…”
Section: Discussionmentioning
confidence: 99%
“…However, the larger number of elements with shared boundaries also means that we need more grid points than SpEC to reach the same accuracy for a black-hole binary initial-data problem. Variations of the DG scheme, such as a hybridizable DG method, can provide a possible resolution to this effect [64][65][66]. Even without changing the DG scheme, we expect that optimizations of our binary compact-object domain can significantly reduce the number of grid points required to reach a certain accuracy.…”
Section: Discussionmentioning
confidence: 99%
“…Let ũh and ξh be two potential reconstructions of u and ξ respectively and consider qh = q = −ν∇u and ζh = ζ = −ν∇ξ. Noting that in this case s∓ h = s ∓ h , so that s∓ h can be rewritten as shown in equation (B.2), the exact representation for the quantity of interest (19) yields after some rearrangements to…”
Section: Exact Representation For the Quantity Of Interest -Enhanceme...mentioning
confidence: 99%
“…Also, goal-oriented error indicators are provided to enhance the convergence of adaptive remeshing for non-smooth problems. HDG methods have gained popularity in the last decade due to their reduced computational cost with respect to classical discontinuous Galerkin methods while retaining superconvergence properties [19]. Also, a very attractive feature is that a simple post-process of the solution yields equilibrated H(div; Ω) approximations of the fluxes.…”
Section: Introductionmentioning
confidence: 99%
“…In some studies, the reduction in terms of computing time has also been demonstrated [1]. Out of the many possible high-order methods available, the hybridisable discontinuous Galerkin (HDG) [2,3] is an attractive option due to the reduced number of degrees of freedom, compared to other DG methods, and the ability to introduce the stabilisation required in convection dominated flows [4].…”
mentioning
confidence: 99%