PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 2013SIAM Journal on Scientific Computing110 citationsOpen Access

hp-Version Composite Discontinuous Galerkin Methods for Elliptic Problems on Complicated Domains

View Full Paper
PAPaola F. AntoniettiSGStefano GianiPHPaul Houston

Key Points

Key points are not available for this paper at this time.

Abstract

In this paper we introduce the hp-version discontinuous Galerkin composite finite element method for the discretization of second-order elliptic partial differential equations. This class of methods allows for the approximation of problems posed on computational domains which may contain a huge number of local geometrical features, or microstructures. While standard numerical methods can be devised for such problems, the computational effort may be extremely high, as the minimal number of elements needed to represent the underlying domain can be very large. In contrast, the minimal dimension of the underlying composite finite element space is independent of the number of geometric features. The key idea in the construction of this latter class of methods is that the computational domain is no longer resolved by the mesh; instead, the finite element basis (or shape) functions are adapted to the geometric details present in. In this paper, we extend these ideas to the discontinuous Galerkin setting, based on employing the hp-version of the finite element method. Numerical experiments highlighting the practical application of the proposed numerical scheme will be presented.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Antonietti et al. (2013) studied this question.

synapsesocial.com/papers/6a221436c7675eb28596fd4fhttps://doi.org/10.1137/120877246
Ask AI
Helpful
Bookmark
Share
View Full Paper