Next Article in Journal
On the Hardness of Lying under Egalitarian Social Welfare
Previous Article in Journal
Efficiency of Commercial Banking in Developing Countries
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Solution of Exterior Quasilinear Problems Using Elliptical Arc Artificial Boundary

1
School of Mathematical Sciences, Nanjing Normal University, Nanjing 210023, China
2
Department of Mathematics, Shanghai Maritime University, Shanghai 200136, China
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(14), 1598; https://doi.org/10.3390/math9141598
Submission received: 31 May 2021 / Revised: 3 July 2021 / Accepted: 6 July 2021 / Published: 7 July 2021

Abstract

:
In this paper, the method of artificial boundary conditions for exterior quasilinear problems in concave angle domains is investigated. Based on the Kirchhoff transformation, the exact quasiliner elliptical arc artificial boundary condition is derived. Using the approximate elliptical arc artificial boundary condition, the finite element method is formulated in a bounded region. The error estimates are obtained. The effectiveness of our method is showed by some numerical experiments.

1. Introduction

In many fields of scientific and engineering computing, such as heat transfer, magnetostatics or compressible flow, it is necessary to deal with problems in unbounded domains. The method of artificial boundary conditions [1,2], which is also named coupled of finite element method and natural boundary element method [3,4,5] or DtN finite element method [6,7], is a normal method used to solve this kind of problem numerically.
The method can be summarized in the following four steps: (i) By introducing an artificial boundary Γ R , truncate the original infinite domain Ω into two subdomains: a finite computational subdomain Ω i and an unbounded residual subdomain Ω e . (ii) By dissecting the problem in Ω e , obtain a relation on Γ R involving the solution u and its derivatives. (iii) Use the relation as an approximate boundary condition on Γ R , to earn a well posed problem confined in Ω i . (iv) Use finite element method or other numerical methods to solve the problem in Ω i .
The relation derived in (ii) and used in (iii) is called an artificial boundary condition, natural integral equation or DtN map. Natural boundary reduction reduces the boundary value problem into a hypersingular integral equation on the artificial boundary. It has many advantages, such as the positive-definite symmetry of stiffness matrices, the stability of approximate solutions, and can be coupled with the finite element method naturally and directly. The method has been used to solve linear problems in last century. It has also been successfully extended to nonlinear problems in recent years.
Suppose Ω is an infinite domain with a concave angle α , and 0 < α 2 π . The boundaries of Ω are disintegrated into three disjoint parts: Γ 0 , Γ α and Γ (see Figure 1), i.e., Ω = Γ 0 Γ α Γ , Γ 0   Γ α = , Γ 0   Γ = and Γ α   Γ = . The boundary Γ is a simple smooth curve part, Γ 0 and Γ α are two half lines.
We consider the following quasilinear problem
{ · ( a ( x , u ) u ) = f ,           in Ω , u n = 0 ,         on   Γ 0 Γ α , u = 0 ,         on   Γ , u ( x )   is   bounded ,         as   | x | ,
where a ( x , u ) and f are given functions with some properties which will be decribed later.
Problem (1) has numerous physical applications, e.g., in the field of magnetostatics, where u is the magnetic scalar potential and a is the magnetic permeability; in the field of compressible flow, where u is the velocity potential and a is the density. There have been many numerical results about problems of this kind in bounded domains, for example, the existence and uniqueness of weak solution [8,9], the finite element method [10,11,12], the mixed finite element method [13,14,15], the discontinuous Galerkin finite element method [16,17,18], the weak Galerkin finite element method [19], and the adaptive finite element method [20,21].
The circular artificial boundary was used for exterior quasilinear problems in early years [22,23]. The elliptical artificial boundary was generalised later for elongated domains problems [24]. The circular arc boundary was often selected for problems in unbounded domains with concave angles [25], but for the problems in elongated concave angle domains, an elliptical arc boundary which leads to a smaller computational domain is much better than the circular arc case (see Figure 2).
In this paper, we propose a new method of elliptical arc artificial boundary conditions for the numerical solution of quasilinear problems in exterior elongated domains with concave angles.
Suppose that the given function a ( · , · ) satisfies [8]
C 0 a ( x , u ) C 1 ,   u ,   and   for   almost   all   x Ω ,
and
| a ( x , u ) a ( x , v ) | C L | u v | ,   u , v ,   and   for   almost   all   x Ω ,
where C 0 , C 1 and C L are three positive constants. We also assume that a s , 2 a s 2 are continuous. Additionally, we suppose that f L 2 ( Ω ) has compact support, i.e., there exists a constant μ 0 > 0 , such that
supp f Ω μ 0 = { x 2 | | x | μ 0 } .
Moreover, we assume that
a ( x , u ) a 0 ( u ) ,   when   | x | μ 0 .
The rest of this paper is organized as follows. We derive the exact quasilinear elliptical arc artificial boundary condition in Section 2. In Section 3, we formulate the finite element approximation and give an new error estimate. In Section 4, we give some numerical experiments to show the efficiency and feasibility of our method. Some conclusions are given in Section 5.
In the following sections, we denote C as a general positive constant independent of μ 1 , N and h , where N and h will be defined in Section 2 and Section 3, respectively. The constant C has different meaning in different place.

2. Exact Quasilinear Elliptical Arc Artificial Boundary Condition

We first introduce the elliptical arc artificial boundary Γ μ 1 = { ( x , y ) | x 2 a 2 + y 2 b 2 = 1 , ( x , y ) Ω , a > b > 0 } to enclose supp f , which divides Ω into a bounded computational domain Ω i and an unbounded domain Ω e (see Figure 2b). Let 2 f 0 denote the distance between two foci of the previous ellipse, we introduce the elliptic co-ordinates ( μ , φ ) such that artificial boundary Γ μ 1 coincides with elliptical arc { ( μ , φ ) | μ = μ 1 ,   0 < φ < α } , where f 0 = a 2 b 2 , μ 1 = ln a + b a 2 b 2 . Thus, the Cartesian co-ordinates ( x , y ) are related to the elliptic co-ordinates ( μ , φ ) , that is x = f 0 cos h μ cos φ , y = f 0 sin h μ sin φ .
Then, problem (1) can be rewritten in the following coupled form:
{ · ( a ( x , u ) u ) = f ,           in Ω i , u n = 0 ,         on   Γ 0 i   Γ α i , u = 0 ,         on   Γ ,
{ · ( a 0 ( u ) u ) = 0 ,           in Ω e , u n = 0 ,         on   Γ 0 e Γ α e , u ( x )   is   bounded ,         as   | x | ,
u ( x )   and   a 0 ( u ) u n   are   continuous   on   the   artificial   boundary   Γ μ 1 ,
where Γ 0 i = Γ 0   Ω i , Γ α i = Γ α   Ω i , Γ 0 e = Γ 0   Ω e , and Γ α e = Γ α   Ω e .
We introduce the so-called Kirchhoff transformation [26]:
w ( x ) = 0 u ( x ) a 0 ( ξ ) d ξ ,   for   x Ω e .
The transformation is invertible because a 0 ( u ) is a positive function. Notice that
w = a 0 ( u ) u ,
we can transform the quasilinear problem (7) into the following linear problem
{ Δ w = 0 ,           in Ω e , w n = 0 ,         on   Γ 0 e Γ α e , w ( x )   is   bounded ,         as   | x | .
Suppose w ( x ) is the solution of problem (11). By Fourier series expansion, we have
w ( μ , φ ) = b 0 2 + n = 1 + b n e ( μ 1 μ ) n π α cos n π φ α ,
where
b n = 2 α 0 α w ( μ 1 , ϕ ) cos n π ϕ α d ϕ ,   n = 0 , 1 , 2 , .
It is easy to obtain
w μ ( μ , φ ) | μ = μ 1 = 2 π α 2 n = 1 + n 0 α w ( μ 1 , ϕ ) cos n π ϕ α cos n π φ α d ϕ .
Since
w n = 1 J 0 w μ ,
where J 0 = f 0 2 ( cos h 2 μ 1 cos 2 φ ) , and
w n = a 0 ( u ) u n ,
we obtain the exact artificial boundary condition of u on Γ μ 1 :
a 0 ( u ) u n = 2 π α 2 J 0 n = 1 + n 0 α ( 0 u ( μ 1 , ϕ ) a 0 ( y ) d y ) cos n π ϕ α cos n π φ α d ϕ K u ( μ 1 , φ ) .
The difference between this artificial boundary condition and that in circular arc case is only a factor 1 J 0 [25], so it does not increase the computational complexity of the stiff matrix from artificial boundary. In the meantime, an elliptical arc artificial boundary is advantageous in that it may be used to enclose some narrow region with concave angle efficiently, so it is much better than the circular arc one.
By the exact quasilinear artificial boundary condition (17), we have
{ · ( a ( x , u ) u ) = f ,           in Ω i , u n = 0 ,         on   Γ 0 i   Γ α i , u = 0 ,         on   Γ , a 0 ( u ) u n = K u ( μ 1 , φ ) ,         on   Γ μ 1 .
Let V = { v H 1 ( Ω i ) | v | Γ = 0 } , then problem (18) is equivalent to the variational problem as follows:
{ Find   u V ,       such   that A ( u ; u , v ) + B ( u ; u , v ) = F ( v ) ,       v V ,
where
A ( w ; u , v ) = Ω i a ( x , w ) u · v d x ,  
B ( w ; u , v ) = n = 1 + 2 n π 0 α 0 α a 0 ( w ( μ 1 , ϕ ) ) u ϕ ( μ 1 , ϕ ) v φ ( μ 1 , φ ) sin n π ϕ α sin n π φ α d ϕ d φ ,
F ( v ) = Ω i f ( x ) v ( x ) d x .  
In practice, we must truncate the infinite series in (17) by finite terms, let
K N u = 2 π α 2 J 0 n = 1 N n 0 α ( 0 u ( μ 1 , ϕ ) a 0 ( y ) d y ) cos n π ϕ α cos n π φ α d ϕ .
Consider the following approximation problem:
{ · ( a ( x , u N ) u N ) = f ,           in Ω i , u N n = 0 ,         on   Γ 0 i   Γ α i , u N = 0 ,         on   Γ , a 0 ( u N ) u N n = K N u N ,         on   Γ μ 1 .
It is equivalent to the variational problem as follows:
{ Find   u N V ,       such   that A ( u N ; u N , v ) + B N ( u N ; u N , v ) = F ( v ) ,       v V ,
where
B N ( w ; u , v ) = n = 1 N 2 n π 0 α 0 α a 0 ( w ( μ 1 , ϕ ) ) u ϕ ( μ 1 , ϕ ) v φ ( μ 1 , φ ) sin n π ϕ α sin n π φ α d ϕ d φ .
For s , we introduce the equivalent definition of Sobolev spaces H s ( Γ μ 1 ) as follows [27]:
  H s ( Γ μ 1 ) v ( μ 1 , φ ) = b 0 2 + n = 1 + b n cos n π φ α   and   b 0 2 2 + n = 1 + ( 1 + n 2 ) s b n 2 < .
The norm of H s ( Γ μ 1 ) can be defined as follows:
v ( μ 1 , φ ) s , Γ μ 1 = [ b 0 2 2 + n = 1 + ( 1 + n 2 ) s b n 2 ] 1 2 .
Then, we have the following results.
Lemma 1. 
B ( u ; u , v ) and B N ( u ; u , v ) are both a symmetric, semi-definite and continuous bilinear form on V × V .
Proof. 
For u , v V , we assume that
u ( μ 1 , ϕ ) = b 0 2 + n = 1 + b n cos n π ϕ α ,
v ( μ 1 , φ ) = d 0 2 + n = 1 + d n cos n π φ α ,
taking the derivative with respect to ϕ and φ , we obtain
u ϕ ( μ 1 , ϕ ) = n = 1 + n π α b n sin n π ϕ α ,
v φ ( μ 1 , φ ) = n = 1 + n π α d n sin n π φ α ,
then we have
| B ( u ; u , v ) | C ( n = 1 + n b n 2 ) 1 2 ( n = 1 + n d n 2 ) 1 2     C u 1 2 , Γ μ 1 v 1 2 , Γ μ 1 C u 1 , Ω i v 1 , Ω i .
In the same way, we obtain
| B N ( u ; u , v ) | C ( n = 1 N n b n 2 ) 1 2 ( n = 1 N n d n 2 ) 1 2 C u 1 , Ω i v 1 , Ω i .
Next, we show that B ( u ; u , v ) and B N ( u ; u , v ) are semi-definite. For any given v V , we consider the following auxiliary problem:
{ · ( a ( x , u ) u ) = 0 ,           in Ω e , u n = 0 ,         on   Γ 0 e   Γ α e , u = v ,         on   Γ μ 1 , u ( x )   is   bounded ,         as   | x | ,  
the solution u of the above problem satisfies
a 0 ( u ) u n = K u ( μ 1 , φ ) .
If we multiply (27) by u and integrate over Ω e , then we can obtain
B ( u ; u , u ) = Ω e a 0 ( u ) | u | 2 d x 0 .
In the same way, we obtain
B N ( u ; u , u ) 0 .
This completes the proof. □

3. Finite Element Approximation

Suppose J h is a regular and quasi-uniform triangulation on Ω i , s.t.
Ω i = K J h K ,
where K is a (curved) triangle, h denote the maximal side of the triangles. Let
V h = { v h V , v h |   K   is   a   linear   polynomial ,     K J h } .
Then, the approximation problem of (25) is
{ Find   u h N V h ,       such   that A ( u h N ; u h N , v h ) + B N ( u h N ; u h N , v h ) = F ( v h ) ,       v h V h .
Lemma 2. 
The variational problems (19), (25) and (30) are uniquely solvable.
Proof. 
From (2), it is easy to shown that the bilinear form A ( u ; u , v ) is V -elliptic and bounded in V , i.e., there exist constants C 0 , C 1 > 0 , such that
| A ( u ; v , v ) | C 0 v 1 , Ω i 2 ,
| A ( u ; u , v ) | C 1 u 1 , Ω i v 1 , Ω i .
Combining with Lemma 1, we can deduce that A ( u ; u , v ) + B ( u ; u , v ) is also V -elliptic and bounded in V . By (3), a ( x , u ) is uniformly Lipschitz continuous with respect to u . Since these conditions hold, it is known [8] that variational problem (19) has a unique solution u V for all f L 2 ( Ω ) . In the same way, we obtain that the variational problems (25) and (30) are uniquely solvable. □
We let u , u N H 2 ( Ω i ) and u h V h be the solution of problems (19), (25) and (30), respectively. We also assume that
V h V   W 1 , 2 + ε ( Ω i )   for   some   ε ( 0 , 1 ) .
Moreover, we require that { V h } h 0 is a family of finite dimensional subspaces of V     C ( Ω i ) , s.t.
v   V     C ( Ω i ) ,   there   exists   { v h }   : v h V h ,   v v h 0 ,   as   h 0 ,
v h 1 , 2 + ε , Ω i C ( v )   for   any   h ,
where C ( v ) > 0 is independent of h .
It is obvious that the continuous piecewise polynomial spaces (29) satisfy (31). Furthermore, if we suppose v h = Π h v , and Π h : v v h is the interpolation operator, we have
v h 1 , 2 + ε , Ω i Π h v v 1 , 2 + ε , Ω i + v 1 , 2 + ε , Ω i C ( v ) .
Following the convergence theory in [5,8], we have the following result:
lim h 0 u h N u N 1 , Ω i = 0     and     u N V     W 1 , 2 + ε ( Ω i ) ,   N 0 .
Moreover, we can obtain the following lemma.
Lemma 3. 
Suppose u be the solution of (19) and u N be the solution of (25). Then, we have
lim N + u u N 1 , Ω i = 0 .
Proof. 
From (2) and Lemma 2, we have
u N 1 , Ω i 2 C ( A ( u N ; u N , u N ) + B ( u N ; u N , u N ) ) = C ( F ( u N ) + B ( u N ; u N , u N ) B N ( u N ; u N , u N ) ) C ( f 0 , Ω i · u N 1 , Ω i + | B ( u N ; u N , u N ) B N ( u N ; u N , u N ) | )
For u N V , we assume that
w N ( μ , ϕ ) = 0 u N ( μ , ϕ ) a 0 ( ξ ) d ξ = b 0 2 + n = 1 + b n e ( μ 0 μ ) n π α cos n π ϕ α ,     μ > μ 0 ,
u N ( μ 1 , φ ) = d 0 2 + n = 1 + d n cos n π φ α ,
then we have
| B ( u N ; u N , u N ) B N ( u N ; u N , u N ) | = | n = N + 1 + 2 n π 0 α 0 α w N ϕ ( μ 1 , ϕ ) u N φ ( μ 1 , φ ) sin n π ϕ α sin n π φ α d ϕ d φ | = n = N + 1 + n π 2 e ( μ 0 μ 1 ) n π α b n d n C e ( μ 0 μ 1 ) ( N + 1 ) π α ( n = N + 1 + n b n 2 ) 1 2 ( n = N + 1 + n d n 2 ) 1 2 C e ( μ 0 μ 1 ) ( N + 1 ) π α w N 1 2 , Γ μ 0 u N 1 2 , Γ μ 1 C e ( μ 0 μ 1 ) ( N + 1 ) π α u N 1 , Ω i 2 .
From μ 1 > μ 0 , we deduce that { u N } is bounded in V . Therefore, we obtain a subsequence { u N n } , s.t. u N n u ¯ V . Then, similar with Lemma 3.4 of [22], we have (35). □
Finally, we obtain the convergence result as follows.
Theorem 1. 
Suppose u H 2 ( Ω i ) , andletassumptions (31)–(33) be satisfied. Then, we have
lim h 0 , N + u u h N 1 , Ω i = 0 .
Next, we give the error estimates. We assume that the solution u of problem (1) satisfies
u | Ω i V     W k , 2 + ε ( Ω i ) ,   ε > 0 ,   k 2 .
For simplicity, we define the following notation
D ( u ; u , v ) A ( u ; u , v ) + B ( u ; u , v ) ,
D N ( u N ; u N , v ) A ( u N ; u N , v ) + B N ( u N ; u N , v ) ,
D N ( u h N ; u h N , v h ) A ( u h N ; u h N , v h ) + B N ( u h N ; u h N , v h ) .
Then, problems (19), (25) and (30) can be reduced to the simple forms, respectively. Let us introduce the bilinear form D ( u ; · , · ) and D N ( u N ; · , · ) defined by
D ( u ; v , z ) = Ω i a s ( x , u ) v u · z d x + Ω i a ( x , u ) v · z d x + 0 α 0 α a 0 s ( u ) v u ϕ ( μ 1 , ϕ ) z φ ( μ 1 , φ ) n = 1 + 2 n π sin n π ϕ α sin n π φ α d ϕ d φ + 0 α 0 α a 0 ( u ) v ϕ ( μ 1 , ϕ ) z φ ( μ 1 , φ ) n = 1 + 2 n π sin n π ϕ α sin n π φ α d ϕ d φ ,
D N ( u N ; v , z ) = Ω i a s ( x , u N ) v u N · z d x + Ω i a ( x , u N ) v · z d x + 0 α 0 α a 0 s ( u N ) v u N ϕ ( μ 1 , ϕ ) z φ ( μ 1 , φ ) n = 1 N 2 n π sin n π ϕ α sin n π φ α d ϕ d φ + 0 α 0 α a 0 ( u N ) v ϕ ( μ 1 , ϕ ) z φ ( μ 1 , φ ) n = 1 N 2 n π sin n π ϕ α sin n π φ α d ϕ d φ .
Let V denote the dual of V . Notice that D ( u ; · , · ) is bounded on V × V since (2) and a s ( · , u ( · ) ) are continuous. Then, we have an operator T :   V V , s.t.
( T v , z ) = D ( u ; v , z ) ,     v , z V .
Similar with Lemma 2.2 of [23], we have the following lemma.
Lemma 4. 
The bilinear form ( T v , v ) defined by D ( u ; v , v ) satisfies the following inequality
( T v , v ) + K ( v 0 , Ω i 2 + v 1 2 , Γ μ 1 2 ) C v 1 , Ω i 2 ,     v V ,
where K     0 is a sufficient large constant.
We assume that
D ( u ; v , z ) = 0 ,     z V v = 0 .
Let I : V V denote the canonical injection. We obtain that operator J : V V defined by J ( v ) = ( I ( v ) , 0 ) is also compact since V is compactly embedded in L 2 ( Ω i ) . Thus the Fredholm alternative applies for T . We have that T : V V is an isomorphism.
According to Theorem 10.1.2 of [28], under the conditions (19), (38) and (39), there exists an h 0   ( 0 , 1 ] , such that the following inf-sup condition is satisfied.
sup z V h D ( u ; v , z ) z 1 , Ω i α 1 v 1 , Ω i ,     v V h ,
for some constant α 1 > 0 independent of h ( h < h 0 ) .
We define the Galerkin projection with respect to D ( u ; · , · ) , P h : V V h
D ( u ; P h v , z ) = D ( u ; v , z ) ,     z V h .
Then, we obtain
v P h v 1 , p , Ω i C inf v h V h v v h 1 , p , Ω i C h σ ,
where 2 p ,   0 < σ < 1 .
Lemma 5. 
u h N V h is a solution of (30) if, and only if, this equation,
D N ( u N ; u N u h N , v ) = R ( u N ; u h N , v ) ,       v V h ,
holds, where
R ( u N ; u h N , v ) Ω i ( 0 1 ( 2 a s 2 ( x , w h N ) w h N · v ) ( 1 t ) d t ) ( d h N ) 2 d x + 2 Ω i ( 0 1 ( a s ( x , w h N ) d h N · v ) ( 1 t ) d t ) d h N d x + 0 α 0 α ( 0 1 ( 2 a 0 s 2 ( w h N ) w h N ϕ v φ n = 1 N 2 n π sin n π ϕ α sin n π φ α ) ( 1 t ) d t ) ( d h N ) 2 d ϕ d φ   + 2 0 α 0 α ( 0 1 ( a 0 s ( w h N ) d h N ϕ v φ n = 1 N 2 n π sin n π ϕ α sin n π φ α ) ( 1 t ) d t ) d h N d ϕ d φ .
with  w h N = u N + t ( u h N u N ) ,   d h N = u h N u N .
Proof. 
Let η ( t ) D N ( w h N ; w h N , v ) . Then, by (25), (30), and
η ( 1 ) = η ( 0 ) + η ( 0 ) + 0 1 η ( t ) ( 1 t ) d t ,
we can get the desired result.
Let
M h { v V h | v 1 , , Ω i 1 + u N 1 , , Ω i } ,
Then, following [23,29], we have the Lemma as follows.
Lemma 6. 
There exists a constant C > 0 independent of h , such that
| R ( u N ; v , z ) | C ( u N v 1 , Ω i 2 + u N v 1 , Ω i ) z 1 , Ω i ,     v M h ,       z V h .
We define a nonlinear mapping ψ :   V h V h as follows. ψ ( v ) is the unique solution of
D ( u ; ψ ( v ) , z ) = D ( u ; u , z ) R ( u ; v , z ) ,     z V h ,
for any given v V h . Let
E h { v V h | v P h v 1 , , Ω i C h σ } ,
then we have
Lemma 7. 
The nonlinear mapping ψ is continuousfrom E h to E h .
Proof. 
By (43), we have
D ( u ; ψ ( v ) ψ ( v n ) , z ) = R ( u ; v n , z ) R ( u ; v , z ) .
Combining (45) with (40), we obtain the operator ψ is continuous, i.e.,
lim v n v ψ ( v n ) = ψ ( v ) .
For any v E h ,
v 1 , , Ω i u N v 1 , , Ω i + u N 1 , , Ω i ,
u N v 1 , , Ω i u N P h u N 1 , , Ω i + P h u N v 1 , , Ω i ,
u N P h u N 1 , , Ω i u N Π h u N 1 , , Ω i + Π h u N P h u N 1 , , Ω i .
By the fact that J h is quasi-uniform, according to [30], we have the inverse inequality, as follows:
w 1 , , Ω i C ( log 1 h ) 1 2 w 1 , Ω i ,     w V h .
Combining the definition of E h with (41) and (49), we obtain
u N v 1 , , Ω i 1 .
This means that v M h . By the definition of P h , (43) can be rewritten as
D ( u N ; ψ ( v ) P h u N , z ) = R ( u N ; v , z ) ,     z V h .
Then, by (40), Lemmas 5 and 6, we have
ψ ( v ) P h u N 1 , Ω i C sup z V h | D ( u ; ψ ( v ) P h u N , z ) | z 1 , Ω i C ( u N v 1 , Ω i 2 + u N v 1 , Ω i ) C ( u N P h u N 1 , Ω i 2 + P h u N v 1 , Ω i 2 + u N P h u N 1 , Ω i + P h u N v 1 , Ω i ) C h σ .
This implies that ψ :   E h E h . □
Theorem 2. 
Suppose u V     W k , 2 + ε   ( Ω i ) be a solution of problem (1), with ε > 0 ,   k 2 . And we also assume that u | Γ μ 0 H k 1 2   ( Γ μ 0 ) and u satisfies (39). With sufficiently small h , the finite element Equation (30) has an approximate solution u h N V h , such that
u u h N 1 , Ω i C ( h σ + 1 ( N + 1 ) k 1 e ( μ 0 μ 1 ) ( N + 1 ) π α u k 1 2 , Γ μ 0 ) .
Proof. 
From Lemma 7 and Brouwer’s fixed point theorem, there exists u h N V h , such that ψ ( u h N ) = u h N . By Lemma 5, we deduce that u h N is a solution of (30). Furthermore, by (41) and u h N E h , we obtain
u N u h N 1 , Ω i u N P h u N 1 , Ω i + P h u N u h N 1 , Ω i C h σ .
For any u N V , from Lemma 3, we have
| B ( u N ; u N , v ) B N ( u N ; u N , v ) | C e ( μ 0 μ 1 ) ( N + 1 ) π α ( n = N + 1 + ( 1 + n 2 ) 1 2 b n 2 ) 1 2 ( n = N + 1 + ( 1 + n 2 ) 1 2 d n 2 ) 1 2 C 1 ( N + 1 ) k 1 e ( μ 0 μ 1 ) ( N + 1 ) π α ( n = N + 1 + ( 1 + n 2 ) k 1 2 b n 2 ) 1 2 ( n = N + 1 + ( 1 + n 2 ) 1 2 d n 2 ) 1 2 C 1 ( N + 1 ) k 1 e ( μ 0 μ 1 ) ( N + 1 ) π α u k 1 2 , Γ μ 0 v 1 , Ω i .
It follows from (25) that
D ( u N ; u N , v ) = A ( u N ; u N , v ) + B ( u N ; u N , v ) = F ( v ) + B ( u N ; u N , v ) B N ( u N ; u N , v ) .
Let η ( t ) = D ( u + t ( u N u ) ; u + t ( u N u ) , v ) , we obtain
0 1 D ( u + t ( u N u ) ; u N u , v ) d t = D ( u N ; u N , v ) D ( u ; u , v ) .
By (19), (38), (39) and [28], we have
u u N 1 , Ω i C sup v V 0 1 D ( u + t ( u N u ) ; u N u , v ) d t v 1 , Ω i C | B ( u N ; u N , v ) B N ( u N ; u N , v ) | v 1 , Ω i C 1 ( N + 1 ) k 1 e ( μ 0 μ 1 ) ( N + 1 ) π α u k 1 2 , Γ μ 0 .
Combining (51) with (52), we obtain
u u N 1 , Ω i u u N 1 , Ω i + u N u h N 1 , Ω i C ( h σ + 1 ( N + 1 ) k 1 e ( μ 0 μ 1 ) ( N + 1 ) π α u k 1 2 , Γ μ 0 ) .
This completes the proof. □

4. Numerical Examples

We computed three numerical examples using the method developed above to test the effectiveness of the method.
Example 1. 
We take Ω = { ( μ , φ ) | μ > μ 0 ,   0 < φ < 2 π } , Γ = { ( μ , φ ) | μ = μ 0 , 0 < φ < 2 π } , Γ 0 = { ( μ , 0 ) | μ > μ 0 } , Γ α = { ( μ , 2 π ) | μ > μ 0 } , Γ μ 1 = { ( μ 1 , φ ) | μ 1 > μ 0 , 0 < φ < 2 π } , f 0 = 1.5 , μ 0 = 1 and a ( x , u ) = 1 1 + u 2 . The exact solution of original problem is u = tan 2 cosh μ cos φ f 0 ( cosh 2 μ + cos 2 φ ) . Figure 3 shows Mesh h of subdomain Ω i   ( μ 1 = 2 ) . The numerical results are given in Table 1, Figure 4 and Figure 5.
Example 2. 
We take Ω = { ( μ , φ ) | μ > μ 0 ,   0 < φ < 3 π 2 } , Γ = { ( μ , φ ) | μ = μ 0 , 0 < φ < 3 π 2 } , Γ 0 = { ( μ , 0 ) | μ > μ 0 } , Γ α = { ( μ , 3 π 2 ) | μ > μ 0 } , Γ μ 1 = { ( μ 1 , φ ) | μ 1 > μ 0 , 0 < φ < 3 π 2 } , f 0 = 1.5 , μ 0 = 1 and a ( x , u ) = 1 1 u 2 . The exact solution of original problem is u = sin 4 ( cosh 2 μ cos 2 φ sinh 2 μ sin 2 φ ) f 0 2 ( cosh 2 μ + cos 2 φ ) 2 . Figure 6 shows Mesh h of subdomain Ω i   ( μ 1 = 2 ) . The numerical results are given in Table 2, Figure 7 and Figure 8.
Example 3. 
We take Ω = { ( x , y ) | x 2 + 2 y 2 > 2 ,   y > 0 } , Γ = { ( x , y ) | x 2 + 2 y 2 = 2 , y > 0 } = { ( μ , ϕ ) | μ = μ 0 ,   0 < ϕ < π } , where f 0 = 1 and μ 0 = ln ( 2 + 1 ) . Γ 0 = { ( x , 0 ) | x > 2 } , Γ α = { ( x , 0 ) | x < 2 } , Γ μ 1 = { ( μ 1 , ϕ ) | μ 1 = 2 , 0 < ϕ < π } and
a ( x , u ) = { 4 x 2 y 2 + 1 1 u 2 ,       2 x 2 + 2 y 2 4 , 1 1 u 2 ,       x 2 + 2 y 2 > 4 ,
f ( x ) = { 4 x 2 y 2 ( x 2 + y 2 ) 2 sin x x 2 + y 2 2 x x 2 + y 2 cos x x 2 + y 2 ,       2 x 2 + 2 y 2 4 , 0 ,       x 2 + 2 y 2 > 4 .
The exact solution of original problem is u = sin x x 2 + y 2 . Figure 9 shows Mesh h of subdomain Ω i . The numerical results are given in Table 3, Figure 10 and Figure 11.
The numerical experiments show that the errors can be reduced by refining the finite element mesh, increasing the order of the artificial boundary condition or enlarging the location of the artificial boundary. Numerical experiments are identical with the theoretical analysis and show that the proposed method is very effective.

5. Conclusions

In this paper, we propose an artificial boundary method using elliptical arc artificial boundary for exterior quasilinear problems in concave angle domains. Based on the Kirchhoff transformation, we obtain the exact and a series of approximate boundary conditions. We formulate the finite element approximation in a bounded region using the approximate elliptical arc artificial boundary condition. We also provide error estimates depend on the finite element mesh, the order of the artificial boundary condition and the location of artificial boundary. Our numerical examples show the efficiency of our method.
An elliptical arc artificial boundary is advantageous in that it may be used to enclose slender obstacles with a concave angle efficiently, so that only a small computational domain in the immediate vicinity of the obstacle is need. It is much better than the circular arc one since it does not increase the computational complexity of the stiff matrix from artificial boundary. Using the elliptical arc boundary condition we proposed in this paper, one can design other numerical methods, for example, the non-overlapping and overlapping domain decomposition methods to solve the exterior quasilinear problems in concave angle domains. The results in this paper extend many related results about the numerical methods for quasilinear problems in unbounded domains.

Author Contributions

Y.C. and Q.D. contributed equally to this work. Both authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (No. 11371198).

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

  1. Han, H.; Wu, X. Approximation of infinite boundary condition and its application to finite element methods. J. Comput. Math. 1985, 3, 179–192. [Google Scholar]
  2. Han, H.; Wu, X. The Artificial Boundary Method—Numerical Solutions of Partial Differential Equations on Unbounded Domains; Tsinghua University Press: Beijing, China, 2009. [Google Scholar]
  3. Feng, K. Finite element method and natural boundary reduction. In Proceedings of International Congress Mathematicians; Polish Academy Press: Warszawa, Poland, 1983. [Google Scholar]
  4. Feng, K.; Yu, D. Canonical integral equations of elliptic boundary value problems and their numerical solutions. In Proceedings of China-France Symposium on the Finite Element Methods; Science Press: Beijing, China, 1983. [Google Scholar]
  5. Yu, D. Natural Boundary Integral Method and Its Applications; Kluwer Academic Publishers: Amsterdam, The Netherlands, 2002. [Google Scholar]
  6. Keller, J.B.; Givoli, D. Exact non-reflecting boundary conditions. J. Comput. Phys. 1989, 82, 172–192. [Google Scholar] [CrossRef]
  7. Grote, M.J.; Keller, J.B. On non-reflecting boundary conditions. J. Comput. Phys. 1995, 122, 231–243. [Google Scholar] [CrossRef] [Green Version]
  8. Hlavacek, I.; Krizek, M.; Maly, J. On Galerkin approximations of a quasi-linear nonpotential elliptic problem of a nonmonotone type. J. Math. Anal. Appl. 1994, 184, 168–189. [Google Scholar] [CrossRef] [Green Version]
  9. Hlavacek, I. A note on the Neumann problem for a quasilinear elliptic problem of a nonmonotone type. J. Math. Anal. Appl. 1997, 211, 365–369. [Google Scholar] [CrossRef] [Green Version]
  10. Chow, S. Finite element error estimates for non-linear elliptic equations of monotone type. Numer. Math. 1989, 54, 373–393. [Google Scholar] [CrossRef]
  11. Liu, W. Finite element approximations of a nonlinear elliptic equation arising from biomaterial problems in elastic-plastic mechanics. Numer. Math. 2000, 86, 491–506. [Google Scholar] [CrossRef]
  12. Korotov, S.; Křížek, M. Finite element analysis of varitional crimes for a quasilinear elliptic problem in 3D. Numer. Math. 2000, 84, 549–576. [Google Scholar] [CrossRef]
  13. Milner, F.A. Mixed finite element methods for quasilinear second-order elliptic problems. Math. Comput. 1985, 44, 303–320. [Google Scholar] [CrossRef]
  14. Meddahi, S. On a mixed finite element formulation of a second-order quasilinear problem in the plane. Numer. Methods Part. Differ. Equ. 2004, 20, 90–103. [Google Scholar] [CrossRef]
  15. Karchevsky, M.; Fedotov, A. Error estimates and iterative procedure for mixed finite element solution of second-order quasi-linear elliptic problems. Comput. Methods Appl. Math. 2004, 4, 445–463. [Google Scholar] [CrossRef]
  16. Houston, P.; Robson, J.; Suli, E. Discontinuous Galerkin finite element approximation of quasilinear elliptic boundary value problems I: The scalar case. IMA J. Numer. Anal. 2005, 25, 726–749. [Google Scholar] [CrossRef]
  17. Houston, P.; Suli, E.; Wihler, T.P. A posteriori error analysis of hp-version discontinuous Galerkin finite-element methods for second-order quasi-linear elliptic PDEs. IMA J. Numer. Anal. 2008, 28, 245–273. [Google Scholar] [CrossRef]
  18. Bi, C.; Ginting, V. A posteriori error estimates of discontinuous Galerkin method for nonmonotone quasi-linear elliptic problems. J. Sci. Comput. 2013, 55, 659–687. [Google Scholar] [CrossRef]
  19. Sun, S.; Huang, Z.; Wang, C. Weak galerkin finite element method for a class of quasilinear elliptic problems. Appl. Math. Lett. 2018, 79, 67–72. [Google Scholar] [CrossRef]
  20. Garau, E.M.; Morin, P.; Zuppa, C. Convergence of an adaptive Kačanov FEM for quasi-linear problems. Appl. Numer. Math. 2011, 61, 512–529. [Google Scholar] [CrossRef]
  21. Guo, L.; Bi, C. Adaptive finite element method for nonmonotone quasi-linear elliptic problems. Comput. Math. Appl. 2021, 93, 94–105. [Google Scholar] [CrossRef]
  22. Han, H.; Huang, Z.; Yin, D. Exact artificial boundary conditions for quasilinear elliptic equations in unbounded domains. Commun. Math. Sci. 2008, 6, 71–83. [Google Scholar] [CrossRef] [Green Version]
  23. Liu, D.; Yu, D. A FEM-BEM formulation for an exterior quasilinear elliptic problem in the plane. J. Comput. Math. 2008, 26, 378–389. [Google Scholar]
  24. Liu, B.; Du, Q. On the coupled of NBEM and FEM for an anisotropic quasilinear problem in elongated domains. Am. J. Comput. Math. 2012, 2, 143–155. [Google Scholar] [CrossRef] [Green Version]
  25. Liu, B.; Du, Q. The Coupling of NBEM and FEM for quasilinear problems in a bounded or unbounded domain with a concave angle. J. Comput. Math. 2013, 31, 308–325. [Google Scholar]
  26. Ingham, D.B.; Kelmanson, M.A. Boundary Integral Equation Analyses of Singular, Potential, and Biharmonic Problems; Springer: Beilin/Heidelberg, Germany, 1984. [Google Scholar]
  27. Chen, Y.; Du, Q. Solution of exterior problems using elliptical arc artificial boundary. Eng. Lett. 2016, 24, 202–206. [Google Scholar]
  28. Chen, C.; Zhou, J. Boundary Element Methods; Academic Press: London, UK, 1992. [Google Scholar]
  29. Meddahi, S.; Gonzalez, M.; Perez, P. On a FEM-BEM formulation for an exterior quasilinear problem in the plane. SIAM J. Numer. Anal. 2000, 37, 1820–1837. [Google Scholar] [CrossRef] [Green Version]
  30. Xu, J. Theory of Multilevel Methods. Ph.D. Thesis, Cornell University, Ithaca, NY, USA, 1989. [Google Scholar]
Figure 1. The illustration of domain Ω.
Figure 1. The illustration of domain Ω.
Mathematics 09 01598 g001
Figure 2. Two different artificial boundaries: (a) The circular arc artificial boundary Γ R ; (b) The elliptical arc artificial boundary Γ μ 1 .
Figure 2. Two different artificial boundaries: (a) The circular arc artificial boundary Γ R ; (b) The elliptical arc artificial boundary Γ μ 1 .
Mathematics 09 01598 g002
Figure 3. Mesh h of Ω i for Example 1.
Figure 3. Mesh h of Ω i for Example 1.
Mathematics 09 01598 g003
Figure 4. L ( Ω i ) errors against N for Example 1 ( μ 1 = 2 ) .
Figure 4. L ( Ω i ) errors against N for Example 1 ( μ 1 = 2 ) .
Mathematics 09 01598 g004
Figure 5. L ( Ω i ) errors against μ 1 for Example 1 (N = 20).
Figure 5. L ( Ω i ) errors against μ 1 for Example 1 (N = 20).
Mathematics 09 01598 g005
Figure 6. Mesh h of Ω i for Example 2.
Figure 6. Mesh h of Ω i for Example 2.
Mathematics 09 01598 g006
Figure 7. L ( Ω i ) errors against N for Example 2 ( μ 1 = 2 ) .
Figure 7. L ( Ω i ) errors against N for Example 2 ( μ 1 = 2 ) .
Mathematics 09 01598 g007
Figure 8. L ( Ω i ) errors against μ 1 for Example 2 ( N = 20 ) .
Figure 8. L ( Ω i ) errors against μ 1 for Example 2 ( N = 20 ) .
Mathematics 09 01598 g008
Figure 9. Mesh h of Ω i for Example 3.
Figure 9. Mesh h of Ω i for Example 3.
Mathematics 09 01598 g009
Figure 10. The errors on the artificial boundary against mesh for Example 3 ( N = 10 ) .
Figure 10. The errors on the artificial boundary against mesh for Example 3 ( N = 10 ) .
Mathematics 09 01598 g010
Figure 11. The errors on the artificial boundary against N for Example 3 ( Mesh   h / 8 ) .
Figure 11. The errors on the artificial boundary against N for Example 3 ( Mesh   h / 8 ) .
Mathematics 09 01598 g011
Table 1. The errors against mesh for Example 1 (μ1 = 2, N = 20).
Table 1. The errors against mesh for Example 1 (μ1 = 2, N = 20).
Mesh L 2 ( Ω i ) Error L ( Ω i ) Error
h 0.0782600.034508
h / 2 0.0158600.008414
h / 4 0.0035460.002088
h / 8 0.0008400.000521
Table 2. The errors against mesh for Example 2 ( μ 1 = 2 , N = 20 ) .
Table 2. The errors against mesh for Example 2 ( μ 1 = 2 , N = 20 ) .
Mesh L 2 ( Ω i ) Error L ( Ω i ) Error
h0.0648700.033738
h/20.0116090.007163
h/40.0026510.001776
h/80.0006360.000444
Table 3. The errors against mesh for Example 3 ( N = 10 ) .
Table 3. The errors against mesh for Example 3 ( N = 10 ) .
Mesh L 2 ( Ω i ) Error L ( Ω i ) Error
h 0.0917400.054584
h / 2 0.0182870.013246
h / 4 0.0040440.003287
h / 8 0.0009500.000820
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Chen, Y.; Du, Q. Solution of Exterior Quasilinear Problems Using Elliptical Arc Artificial Boundary. Mathematics 2021, 9, 1598. https://doi.org/10.3390/math9141598

AMA Style

Chen Y, Du Q. Solution of Exterior Quasilinear Problems Using Elliptical Arc Artificial Boundary. Mathematics. 2021; 9(14):1598. https://doi.org/10.3390/math9141598

Chicago/Turabian Style

Chen, Yajun, and Qikui Du. 2021. "Solution of Exterior Quasilinear Problems Using Elliptical Arc Artificial Boundary" Mathematics 9, no. 14: 1598. https://doi.org/10.3390/math9141598

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop