Abstract
The objective of this work is to study finite element methods for approximating the solution of convection equations on surfaces embedded in . We propose the discontinuous Galerkin (DG) isogeometric analysis (IgA) formulation to solve convection problems on implicitly defined surfaces. Three numerical experiments shows that the numerical scheme converges with the optimal convergence order.
1. Introduction
Surface partial differential equations (SPDEs) arise in natural sciences and applied areas, such as minimal surface equation, Willmore flow, transport of surfactants along interfaces in multiphase fluids [], and lipid interactions in cell membranes []. In this paper, we consider the DG-IgA methods for the following model problem:
where denotes the surface divergence, is a smooth two-dimensional surface without boundary embedded in . is the advective velocity with , is reaction coefficient. We call this model problem the convection equation on surface . The problem (1) has a unique solution satisfying , where is surface measure. Moreover, for source term we have .
To ensure the existence and uniqueness of a solution to the model problem (1.1), we adopt the following hypothesis: There exists a positive constant such that
Finite element methods of SPDEs have been extensively developed. G. Dziuk [] first used the finite element method for solving the surface elliptic problem. A. Bonito and J. E. Pasciak [] designed and analyzed multigrid algorithms for the Laplace-Beltrami operator on a smooth and closed surface. DG methods for solving the first-order hyperbolic problems were defined in [,,,]. Since DG methods have well-known stability and local conservation in numerical application of partial differential equation problems [,] and capture solution blow-ups, it is natural to extend the DG approximation to PDEs on surfaces or manifolds. Ref. [] extended the discontinuous Galerkin (DG) methods to the first-order hyperbolic and advection-dominated problems on surfaces.
IgA has been introduced in [] as a new tool for solving numerically PDEs with the complicated geometric domains, in particular, surfaces. DG-IgA methods have been applied for approximating solutions of elliptic problems on surfaces [,]. Ref. [] developed DG-IgA numerical schemes for solving problems on segmentations with gaps. Ref. [] studied NURBS-based isogeometric analysis for the computation of flows about rotating components. In [], a new stabilized symmetric Nitsche method was proposed for enforcement of Dirichlet boundary conditions for elliptic problems in Cut-IgA. The remainder of the paper is organized as follows: First, we introduce some preliminaries about IgA and discrete NURBS finite space . Then we derive the DG-IgA scheme of convection problem (1.1). Finally, we present three numerical experiments to illustrate the discrete formulation.
2. Model Problem and Discretization
2.1. Differential Operators on Surfaces
Let us consider a two-dimensional surface defined in the physical space . Assume that the surface is characterized by a geometrical mapping from a parameter space . Let be a local parameterization of , where the vector-valued independent variable is called parametric coordinate. Indeed, X defines the geometrical mapping as follows:
To define surface gradient, we introduce the Jacobi matrix as
So, the metric tensor is represented by
The inverse of is denoted by . The tangential or surface gradient is given by
So, we can deduce the tangential or surface divergence. For is a vector field on , we have
Remark that the vector field may not be tangential to surface . However, the 2-dimensional vector is the projection of in parametric coordinate , which is a tangent vector field of . So, the definition of surface divergence is well-posed.
Let denote the usual space on the surface with norm
Furthermore, we use standard notations and for Sobolev spaces on with norm and semi-norm
To present the weak form of problem (1), we introduce the Stokes theorem on surface . Let be a vector field on surface , , then the following identity holds:
2.2. Isogeometric Analysis
To apply the IgA methodology of the problem (1), the domain is partitioned into some closed sub-patches such that
We denote the set of sub-patches as .
Without loss of generality, we simply assume a parametric domain of unit length, i.e., . For each patch , we associate the knot vectors on , which defines a partition , where are 2-dimensional closed elements. We refer to as the parametric mesh of patch and denote . Any patch can be represented by a parametrization map as follows
where are the control points and are B-spline basis functions or NURBS of degree k [], denotes the number of basis functions on patch .
We obtain the partition of the patch , whose vertices are the images of the vertices of the corresponding parametric partition by the map . Now we can construct the partition of the domain , denoted by as follows,
The set of all the edges of partition is denoted by as follows,
We denote the faces of all patches as defined by
Let and denote the size of element and the length of the face respectively. is the mesh size of patch . The global mesh size of partition is defined as
We assume that the shape of the elements is regular and quasi-uniform, i.e., and .
Next, we define the broken space on the physical domain associated with by using the introduced push-forward function , for any ,
Now we can define the broken Sobolev space :
To apply DG method to problem (1), we introduce the jump of on . For , using the notation , we define
where denotes the unit normal vector of on pointing exterior to .
2.3. DG-IgA Discretization
Next, we introduce the finite element space associated with the partition . In general, the basis function of IgA on the patch are pushed forward from the basis function of the parametric domain by considering a composition with , i.e., for any basis function ,
The DG finite element space is defined by
The DG-IgA approximation is formulated as follows: Find such that
where
where is the stability parameter, defined as
for .
The bilinear map can be modified. Indeed, by using the continuity of and the function of in each patch, i.e., and for any , we have
Similarly, we can define the outflow faces . So, the bilinear map can be modified as follows
We can derive the discrete coercivity, stability and consistency of above numerical scheme with a similar technique in []. Due to the discontinuity of , it needs a few skills to prove the discrete coercivity. So there exists a unique discrete solution satisfying DG-IgA scheme (5). Here we briefly show the a priori error result without detailed proof. We introduce the dual or adjoint weak form: Find such that
for all . With the above adjoint weak form, inverse inequality and the approximation of the interpolant operator, we can prove the following result.
3. Numerical Experiments
In this section, we present some numerical experiments of convection problems on surface. Numerical examples are presented for a sphere and a quarter of a cylinder.
3.1. Numerical Experiment 1
We first consider the model problem (1) on the unit sphere
subject to the compatibility condition , where and . We select the source function f such that the exact solution is , where are the spherical coordinates.
We divide the unit sphere into 6 patches. For each patch, the knot vector is taken as to represent the geometry of each patch. We generate the mesh by refining the parameter element of each patch, whose mesh size is denoted by h. We show the patches and the uniform meshes of the sphere for in Figure 1(Left).
Figure 1.
Sphere Case. (Left): The patches and meshes; (Right): Numerical solution.
The numerical errors and convergence results are given in Table 1 for and 3, respectively. In Figure 2, we present the convergence histories of errors. These results show that the IgA-DG method yields convergent solution. We present the numerical solution of convection problem (1) on the sphere in Figure 1(Right).
Table 1.
Errors and convergence order of sphere case for and 3.
Figure 2.
Error convergence result for sphere case.
3.2. Numerical Experiment 2
Here we continue to consider the model problem on the surface of torus
subject to the compatibility condition , where and . The torus is the surface
with and . We take coordinates as
and select the source function f such that the exact solution is .
We divide the torus into 8 patches. For each patch, we take the knot vector as to give the geometrical representation. We plot the patches and the uniform meshes of the torus for in Figure 3(Left).
Figure 3.
Torus Case. (Left): The patches and meshes; (Right): Numerical solution.
The numerical errors and convergence rates of this problem for and 3 are shown in Table 2. Table 3 indicate that the rates are also for norm. Figure 4 shows the convergence history of errors. Finally, we plot the numerical solution of convection problem (1) on torus in Figure 3(Right).
Table 2.
Errors and convergence orders for the torus for and 3.
Table 3.
Errors and convergence order of cylinder case for and 3.
Figure 4.
Error convergence result for torus case.
3.3. Numerical Experiment 3
Next, we solve on the surface of a square of the cylinder the model problem
where . The domain is the surface of a quarter of the cylinder, shown in Figure 5. In contrast to the case of sphere, this problem needs the boundary condition determined by . Then, writing to denote the system of cylindrical coordinate, we impose an appropriate boundary condition g for u and source function f so that the exact solution is .
Figure 5.
Cylinder Case. (Left): The patches and meshes; (Right): Numerical solution.
We consider the model problem on the surface of a square of the cylinder with continuous and discontinuous coefficient .
(1) We take continuous coefficient as . We divide the cylinder into 9 patches. For each patch, we take the knot vector as to give the geometrical representation. Similarly, we plot the patches and the uniform meshes of the cylinder for in Figure 5(Left).
We present numerical errors and convergence rates of this problem for and 3 in Table 3. Table 3 indicate that the rates are also for norm. Figure 6 shows the convergence history of errors. Finally, we plot the numerical solution of convection problem (1) on cylinder in Figure 5(Right).
Figure 6.
Error convergence result for cylinder case.
(2) We consider the discontinuous advective velocity as
where the index is the patch number. Observe that the source function is discontinuous across the patches according to the choice of .
According to the discontinuity of , we divide the cylinder into 4 patches. For each patch, we take the knot vector as to give the geometrical representation. Similarly, we plot the patches and the uniform meshes of the cylinder for in Figure 7(Left), where patch 1 and patch 4 are painted blue, and patch 2, 3 are painted yellow.
Figure 7.
Cylinder Case. (Left): The patches and meshes; (Right): Numerical solution.
The numerical errors and convergence rates of this problem for and 3 are shown in Table 4. Table 4 indicate that the rates are also for norm. Figure 8 shows the convergence history of errors. Finally, we plot the numerical solution of convection problem (1) on cylinder in Figure 7(Right).
Table 4.
Errors and convergence orders for the cylinder for and 3.
Figure 8.
Error convergence result for cylinder case.
4. Conclusions
In this paper, we present the new penalty discontinuous Galerkin (DG) isogeometric analysis(IgA) methods to solve convection problems with continuous or discontinuous coefficient on implicitly defined surfaces. For further purpose, it is worthy studying the stability and error analysis of this method and more practical problems on surfaces.
Author Contributions
Conceptualization and methodology, C.X.; formal analysis, software and validation, L.W.; visualization, X.Y.; writing—review and editing, H.W. All authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by the National Basic Research and Development Program of China grant number 2017YFC1502201, NSFC grant number 11672032, NSFC grant number 10871218 and NSFC grant number 61873036.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Milliken, W.J.; Stone, H.A.; Leal, L.G. The effect of surfactant on transient motion of newtonian drops. Phys. Fluids A 1993, 5, 69–79. [Google Scholar] [CrossRef]
- Elliott, C.M.; Stinner, B. Modeling and computation of two phase geometric biomembranes using surface finite elements. J. Comput. Phys. 2010, 229, 6585–6612. [Google Scholar] [CrossRef]
- Dziuk, G. Finite elements for the Beltrami operator on arbitrary surfaces. Partial differential equations and calculus of variations. Lect. Notes Math. 1988, 1357, 142–155. [Google Scholar]
- Bonito, A.; Pasciak, J.E. Convergence analysis of variational and non-variational multi-grid algorithms for the Laplace-Beltrami operator. Math. Comp. 2012, 81, 1263–1288. [Google Scholar] [CrossRef]
- Houston, P.; Schwab, C.; Süli, E. Discontinuous hp-finite element methods for advection-diffusion-reaction problems. SIAM J. Numer. Anal. 2002, 39, 2133–2163. [Google Scholar] [CrossRef]
- Xiong, C.; Li, Y. Error analysis for optimal control problem governed by convection diffusion equations: DG method. J. Comput. Appl. Math. 2011, 235, 3163–3177. [Google Scholar] [CrossRef][Green Version]
- Xiong, C.; Luo, F.; Ma, X.; Li, Y. A priori error analysis for optimal distributed control problem governed by the first order linear hyperbolic equation: hp-streamline diffusion discontinuous galerkin method. J. Numer. Math. 2016, 24, 125–134. [Google Scholar] [CrossRef]
- Xiong, C.; Li, Y. A posteriori error estimators for optimal distributed control governed by the first-order linear hyperbolic equation: DG method. NMPDEs 2011, 27, 491–506. [Google Scholar] [CrossRef]
- Xiong, C.; Becker, R.; Luo, F.; Ma, X. A priori and a posteriori error analysis for the mixed discontinuous Galerkin finite element approximations of the biharmonic problems. NMPDEs 2017, 33, 318–353. [Google Scholar] [CrossRef]
- Wang, L.; Xiong, C.; Wu, H.; Luo, F. A priori and a posteriori error analysis for discontinuous Galerkin finite element approximations of biharmonic eigenvalue problems. Adv. Comput. Math. 2013, 45, 2623–2646. [Google Scholar] [CrossRef]
- Dedner, A.; Madhavan, P. Discontinuous Galerkin Methods for Hyperbolic and Advection-Dominated Problems on Surfaces. 2015. Available online: https://arxiv.org/pdf/1505.06752.pdf (accessed on 20 December 2020).
- Hughes, T.J.R.; Cottrell, J.A.; Bazilevs, T. Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement. Comput. Methods Appl. Mech. Engrg. 2005, 194, 4135–4195. [Google Scholar] [CrossRef]
- Langer, U.; Toulopoulos, I. Analysis of multipatch discontinuous Galerkin IgA approximations to elliptic boundary value problems. Comput. Vis. Sci. 2015, 17, 217–233. [Google Scholar] [CrossRef]
- Zhang, F.; Xu, Y.; Chen, F. Discontinuous Galerkin methods for isogeometric analysis for elliptic equations on surfaces. Commun. Math. Stat. 2014, 2, 431–461. [Google Scholar] [CrossRef][Green Version]
- Hofer, C.; Langer, U.; Toulopoulos, I. Discontinuous Galerkin Isogeometric Analysis of Elliptic Diffusion Problems on Segmentations with Gaps. Comput. Math. Appl. 2015, 72, 1811–1827. [Google Scholar] [CrossRef]
- Bazilevs, Y.; Hughes, T.J.R. NURBS-based isogeometric analysis for the computation of flows about rotating components. Comput. Mech. 2008, 43, 143–150. [Google Scholar] [CrossRef]
- Elfverson, D.; Larson, M.G.; Larsso, K. A new least squares stabilized Nitsche method for cut isogeometric analysis. Comput. Methods Appl. Mech. Eng. 2019, 349, 1–16. [Google Scholar] [CrossRef]
- Schumaker, L.L. Spline Functions: Basic Theory, 3rd ed.; Cambridge University Press: Cambridge, UK, 2007. [Google Scholar]
- Brezzi, F.; Marini, L.D.; Süli, E. Discontinuous Galerkin methods for first-order hyperbolic problems. Math. Model. Methods Appl. Sci. 2004, 14, 1893–1903. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).