2014
DOI: 10.1007/s40304-015-0049-y
|View full text |Cite
|
Sign up to set email alerts
|

Discontinuous Galerkin Methods for Isogeometric Analysis for Elliptic Equations on Surfaces

Abstract: We propose a method that combines isogeometric analysis (IGA) with the discontinuous Galerkin (DG) method for solving elliptic equations on 3-dimensional (3D) surfaces consisting of multiple patches. DG ideology is adopted across the patch interfaces to glue the multiple patches, while the traditional IGA, which is very suitable for solving partial differential equations (PDEs) on (3D) surfaces, is employed within each patch. Our method takes advantage of both IGA and the DG method. Firstly, the time-consuming… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 31 publications
0
8
0
Order By: Relevance
“…2 (right). An analogous condition is required for v (4) . Examples of two-patch domains, which violate one of these three conditions, are visualized in Fig.…”
Section: Preliminariesmentioning
confidence: 96%
“…2 (right). An analogous condition is required for v (4) . Examples of two-patch domains, which violate one of these three conditions, are visualized in Fig.…”
Section: Preliminariesmentioning
confidence: 96%
“…The BIDG method seamlessly combines exact geometric design (CAD) with high-order accurate analysis (DGFEM), as schematically shown in figure 1. Some groundwork for BIDG-type methods is provided in [3,6,47,55,57], with patchbased methods recently being presented in [40,41,72] for elliptic problems. Also, please note the remark at the end of the appendix for a brief discussion of what is exactly meant by "isogeometric" throughout this paper.…”
Section: Introductionmentioning
confidence: 99%
“…We will also consider multipatch dG IgA of diffusion problems of the form (1) on sufficiently smooth, open and closed surfaces Ω in R 3 , where the gradient ∇ must now be replaced by the surface gradient ∇ Ω , see, e.g., [18], and the patches Ω i , into which Ω is decomposed, are now images of the parameter domain Ω = (0, 1) 2 by the mapping Φ i : Ω ⊂ R 2 → Ω i ⊂ R 3 . The case of matching meshes was considered and analyzed in [28] by two of the co-authors, see also [35] for a similar work. It is clear that the results for non-matching spaces and for mesh grading presented here for the volumetric (2d and 3d) case can be generalized to diffusion problems on open and closed surfaces.…”
Section: Indroductionmentioning
confidence: 99%
“…with t := min{s, k}, provided that the solution u of our surface diffusion problem (35) belongs to H 1+s (T H (Ω )) = W 1+s,2 (T H (Ω )) with some s > 1/2. In the case t = k, estimate (39) yields the convergence rate O(h k ) with respect to the dG norm, whereas the Aubin-Nitsche trick provides the faster rate O(h k+1 ) in the L 2 norm.…”
Section: Discretization Error Estimatesmentioning
confidence: 99%