Skip to main content
Heliyon logoLink to Heliyon
. 2025 Feb 18;11(4):e42724. doi: 10.1016/j.heliyon.2025.e42724

Domain decomposition and mortar mixed approach for nonlinear elliptic equations modeling flow in porous media

Muhammad Arshad a, Adil Mehmood a, Zabidin Salleh b,, Sumaira Saleem Akhtar c, Suliman Khan d, Mustafa Inc e,f,g
PMCID: PMC11891703  PMID: 40066045

Abstract

The equations describe the behavior of steady state flow in porous medium generally results in elliptic partial differential equations with coefficient represents the permeability of the medium. This article presents the extension of mortar mixed method for second order nonlinear elliptic equations that describes flow in porous media. The domain is decomposed into non-overlapping regions with each partitioned independently. The grids on subdomains are allowed to be non-matching across the subdomains internal boundaries. The fixed point argument (FPA) is employed to establish the existence and uniqueness of discrete problem, and optimal order error estimates are provided for approximations. The computational results are given to validate the theory.

Keywords: Nonlinear equations, Darcy law, Mortar methods, Mixed methods, Existence, Numerical results

1. Introduction

The nonlinear partial differential equations have become of fundamental importance in computational science and engineering. Besides other important applications, the nonlinear partial differential equations appear in the field of dynamics, finance and quantum mechanics. In modern scientific approach, many complicated industrial problems require accurate and efficient numerical methods to support and guide the theoretically established results. The remarkable development in technology provided sufficient resources to develop fast numerical methods with precise algorithms which are capable to deal with the solution of challenging models in many practical applications.

Let Ω be a polygonal domain in R2 with boundary ∂Ω, we consider second order nonlinear elliptic equation in divergence form

(A(x,p(x))p(x)=f(x,p(x))inΩ, (1.1)

with boundary condition

p(x)=g(x),onΩ, (1.2)

where x=(x,y). Introducing the flux variable u=A(p)p, the mixed form of (1.1)(1.2) is given by

u=A(x,p(x))p,inΩ, (1.3)
u=f(x,p(x)),inΩ, (1.4)
p=g,onΩ. (1.5)

For the sake of simplicity, we shall drop the variable x in the notation below. Equations (1.3)(1.4) represents Darcy velocity and mass conservation respectively. The coefficient A(p) denotes pressure dependent permeability. We assume that A(p) has continuous derivatives up order two such that

0<aA(p)b<.

For the purpose of simplicity, we examine the Dirichlet boundary condition. However a more general boundary condition can be applied in a similar way. The formulation framework can be adjusted to apply other type of boundary condition. We assume that the problem has H2+ϵ,0<ϵ<1 regularity where Hr denote the standard Sobolev space. We have H2+ϵ regularity, for example, fHϵ(Ω), gH3/2+ϵ(Ω) and domain Ω is smooth enough [30], [27], [38].

Darcy law has many important applications including water flow through an aquifer. Also the Darcy law combined with equation of mass conservation models ground water flow which play a crucial role in hydrology. Applications in hydrology include the disposal of nuclear waste, ground water transport and soil drainage etc. In many applications, it is important to have careful risk assessment, for example, nuclear waste disposal. Thus the accurate and efficient approximation is required. Another crucial application of subsurface flow is petroleum engineering. In petroleum reservoir, Darcy law interprets oil water and gas flows. Other than geomechanical engineering, porous media flows appeared in many industrial applications, e.g., biomedical modeling, filtration technology, etc.

The numerical approximation of the mathematical models describing subsurface flow is highly effected by the physical properties of the medium, for example, permeability and porosity in porous media flow [10], [37], [45]. Permeability measures the ability of medium to transmit fluid through a specific point of domain which fluctuate over small distances with the variation in properties of the surface. The permeability also varies when the region of interest consists of rocks. The traditional approaches to tackle such problems require a very fine mesh to resolve the variation in physical attributes for an accurate approximation which yield a huge system of algebraic equations [42], [32]. The main difficulty in using direct approaches is the computational cost. Therefore, it is necessary to adopt some alternate approaches which provide accuracy and efficiency by reducing the computational complexity of the system of equations encountered by the corresponding technique. In recent years, the efficient and accurate approximation of the mathematical models in geomechanics have been grown to large extent. Particularly, the numerical solution of the equations modeling fluid flow in porous media has become of interest due to their applications in diverse fields.

The domain decomposition methods referred as divide and conquer techniques have been widely used to handle these difficulties. The domain decomposition methods reduce the computational burden by dividing the domain and solving the partial differential equation over small regions. The main advantages of domain decomposition methods are their capability to handle the problems posed on complex physical domains, ability to deal with the partial differential equations possessing different behavior on different regions of the domain, and the enhancement of parallel computation. Several types of domain decomposition methods have been proposed and analyzed [1], [21], [22], [11], [29].

The mixed finite element methods are proven to be highly effective in flow related problems due to their physical attributes such as mass conservation property. In the approximation of physical models related to fluid dynamics, the mixed finite element methods provide the accurate representation of conservation. Moreover, the mixed methods are capable to approximate two unknown simultaneously with same accuracy. The mixed finite element methods have been widely considered for many areas, especially the flow problems [3], [6], [8], [36], [9], [42]. Moreover, the mixed methods have been extensively analyzed and implemented for elliptic [49], [43], [15], [13], [50], [16], [40], [41], [44], [35], [14], [20], [23], [34] and parabolic [4], [17], [28], [33] partial differential equations.

In 2000, Arbogast et al. [5] invented the multiblock methodology based on domain decomposition and mortar method. In this technique the domain is divided into several small regions separated by interfaces. The subdomains and interface are partitioned on same scale and mixed finite element method is applied on each block to solve the subproblems locally. Comparing to the other domain decomposition methods, the mortar mixed method offers great flexibility to use different models on the different subdomain blocks [26], [48] and different numerics [47], [48] and it allows to use the adaptive techniques [52] to improve the accuracy locally where needed. Moreover, this approach is suitable to handle complex geometry and discontinuous coefficients. Furthermore, the linear system encountered by this formulation can be easily implemented in parallel by using parallel domain decomposition algorithm which enhance the efficiency of method. The mixed method methods on locally refined grids [24], [25] employ the concept of slave and worker nodes to impose continuity of flux on internal boundaries and allow nested grids but the grids on neighboring subdomains are required to matching on interface. The mortar mixed technique provides better approximation on non-matching grids. Since the adjacent regions on domain are discretized using different grids, therefore, the normal trace of velocity space is not available as Langrange multiplier space. Hence a finite element space named mortar space is constructed on interface to couple the global problem. This method gives optimal order convergence provided that the interface space has one order higher approximation than the normal trace of velocity space. This method has been further applied to different equations [31], [51], [7], [9], [53].

This study is dedicated to the extension of mortar mixed method for second order elliptic equations with pressure dependent coefficient. We provide the analysis and the implementation of the method for the model problem under consideration. Observe that the pressure dependence of coefficient turns (1.3) into nonlinear Darcy equation. Thus to establish the existence of solution for discrete problem, we follow the fixed-point argument developed in [40], [44]. To apply this argument, we construct a map from an appropriate function space to itself, and thus the existence of a solution for the discrete problem follows from the Brouwer fixed-point theorem. Next, we derive the optimal order convergence for both velocity and pressure approximations. We propose a pressure dependent interface formulation and provide an error bound for mortar interface pressure. We provided the implementation procedure for our method and presented the algorithms for iterative methods. Fixed-point iteration and Newton Raphson methods are used in implementation to solve discretized nonlinear system. We implemented the method on four, eight and sixteen subdomains and presented the numerical results.

For sake of convenience and clarity of presentation, we now introduce the following notations and symbols. For a domain DR2, the L2(D) and (L2(D))d inner product is denoted by (,)D. Similarly the L2(D) or (L2(D))2 norm is denoted by D. For a non-negative integer m or 1q<, Wm,q(D) represent the Sobolev space. The norm and semi norm on Sobolev space is denoted by m,q,D and ||m,q,D respectively. The notation ,B and B represent the L2 inner product and norm on the boundary B of domain D. Moreover, H(div,D) denote the square integrable functions whose weak divergence is also L2(D), that is, H(div,D)={uL2(D):uL2(D)}. Hereafter, subscript in the above notation will be dropped if D=Ω. Finally, the vectors will be denoted by boldface letters.

The remaining of the study is organized as follows. The mathematical foundation needed to create the method in later sections is presented in next section. We give the projection operators and weak velocities in Section 3. The discrete form of the method is presented in Section 4. Section 5 consist of The unique solvability of discrete system. The optimal order convergence for approximations is derived in Section 6. Section 7 is dedicated to proof of uniqueness of solution for the discrete system. Section 8 provides interface formulation and error bound for interface pressure approximation. The implementation procedure along with numerical results is presented in Section 9. Finally, the findings of article are concluded in Section 10.

2. Mathematical preliminaries

Our method is based on domain decomposition so we begin by decomposing the domain into finite number of small blocks which restrict the computational cost. Let us divide the domain into nb subdomain blocks {Ki,1inb} such that Ω¯=i=1nbKi which are non-overlapping, that is, KiKj=,ij. Let

γij=KiKj,γ=1i<jnbγij,γi=Kiγ=KiΩ,

denote the interface between two subdomains, the whole interface and the interface related to the ith subdomain. In sense of domain decomposition, we define the weak spaces as follows

Ui=H(div;Ki),Si=L2(Ki),Lij=H1/2(γij),U=i=1nbUi,S=i=1nbSi=L2(Ω),L=1i<jnbLi.

We define the norm on U as follows

vU=(v2+vΩ˜2)1/2wherek,Ω˜=(i=1nb(k,Ki2))1/2.

We partition each Ki independently into a conforming quasi-uniform triangulation Thi such that the maximal element diameter is hi, for 1inb. For the analysis, we set h=max1inbhi. We mention that two grids on the neighboring blocks Ki can be non-matching on interface. We denote by Th, the partition of whole domain Ω, that is, Th=i=1nbThi. Then the discrete spaces for mixed formulation are defined by [49], [43], [13], [14]

UhiUi,ShiSi,Uh=i=1nbUhi,Sh=i=1nbShi,

where Uh contains the polynomial of degree k and the normal components of vectors in Uh are continuous between the elements on each Ki but not across the interface.

The interface γij is then divided into quasi-uniform grids Thij. The mortar space on the interface γij containing the piece-wise polynomials of degree at least k+1, whether continuous or discontinuous, is denoted by LhijL2(γij). For a two dimensional domain, the interface has dimension one, and the polynomials of degree k+1 make up the interface space Lhij. Let

Lh=1i<jnbLhij,

be the corresponding global interface space. Note that, if the space is discontinuous then the mesh Thij need not to be conforming. For each block Ki, we define the L2 projection Qhi:L2(γi)Uhiνi such that for any φL2(γi)

φQhiφ,ψνiγi=0,ψUhi. (2.1)

Projection Qhi maps the mortar space into the normal trace of velocity space on each block Ki.

Assumption 2.1

For the projectionQdefined in(2.1), there exists a constant C independent of h such that

mC[Qhimγij+Qhjmγij],mLh,1i<jnb. (2.2)

Condition (2.2) impose a limit on the mortar degree of freedom. In practice, this condition holds (cf. [54], [46]. Under the condition (2.2), our scheme (4.4)(4.6) is solvable, accurate and stable. Here after any function mLh is taken as extended by zero on ∂Ω. We mention that the partition Thij do not need to be conforming if the space Lhij is discontinuous however conformity is necessary for error analysis.

3. Weakly continuous velocities and projection operators

First, we introduce some projection operators which will be used to compensate the analysis in sequence. We define the projection Ph:L2(γ)Lh satisfying

ψPhψ,mγ=0,for anyψL2(γ)andmLh.

Let π:SSh be the orthogonal L2projection into Sh defined by

(wπw,ξ)=0,wS,ξSh. (3.1)

Recall that

Uhi=Shi,

and there exists a projection operator Πi of (H1/2+ϵ(Ki))dUi onto Uhi (for any ϵ>0) satisfying

((Πiφφ),ξ)Ki=0,ξShi,(φΠiφ)νi,vνiKi=0,vUhi, (3.2)

for any φ(H1/2+ϵ(Ki))dUi. Observe that for any element face/edge e, φ(H1/2+ϵ(Ki)),φν|eHϵ(e); hence Πi is well defined. Also the H3/2+ϵ regularity assumption ensures that we can apply Πi to the flux arising from our elliptic problem. Mathew [39] provides that for any φ(Hϵ(Ki))d, 0<ϵ<1 with φ=0 then Πiφ is well defined and following approximation properties hold

ΠiφKiCφϵ,Ki,ΠiφφKiChϵφϵ,Ki.

Here r is the Hrnorm. We mention that the argument given in [39] for Raviart-Thomas spaces can be extended [30] for any of the mixed spaces under consideration to show that Πiφ is well defined and for any φ(Hϵ(Ki))dUi

ΠiφKiC[φϵ,Ki+φKi].

The above defined projection operators have the following approximation estimates [15], [18], [50]

ψPhψs,γijCψr,γijhr+s,0rk+2,0sk+2, (3.3)
wπwCwrhr,0rl+1, (3.4)
φΠiφCφr,Kihr,1rk+1, (3.5)
(φΠiφ)KiCφr,Kihr,0rr+1, (3.6)
φQhiφs,γijCφr,γijhr+s,0rr+1,0sk+1, (3.7)
φΠiφ)νis,γijCφr,γijhr+s,0rk+1,0sk+1. (3.8)

Note that Bound (3.3)(3.4) and (3.6)(3.8) are L2 projection estimates [18] while approximations (3.5) can be found in [15], [50]. Here r denote the Hrnorm and s is the Hs norm. The projection operator Πi and Qhi satisfied

Πiφ=π(φ),(Πiφ)νi=Qhi(φνi).

Following inequalities shall be used in the subsequent analysis

qr,γijCqr+1/2,Ki, (3.9)
φνiKCh1/2φKi, (3.10)
q,vνKiq1/2,γijvH(div;Ki). (3.11)

Bound (3.9) is the nonstandard trace theorem which can be found in (see [30], Theorem 1.5.2.1). The local inverse inequality (3.10) is given in [5]. Finally the bound (3.11) is proved in [15], [49]

For the purpose of analysis, we define the weakly continuous velocities [5] as

Uhc={vUh:i=1nbv|Kiνi,mγi=0,for allmLh}. (3.12)

4. Numerical method

The weak formulation of the (1.3)(1.5) is stated by; uUi,wWi,λL such that

(α(p)u,v)Ki=(p,v)Kiλ,vνiγig,vνiKiγ,vUi, (4.1)
(u,w)Ki=(f(p),w)Ki,wSi, (4.2)
i=1nbuνi,mγi=0,mL, (4.3)

for 1inb. Here uνi denote the normal flux on each subdomain with νi outer unit normal to subdomain block Ki. Equation (4.3) imposes the weak continuity of normal flux with respect to mortar space L. Note that λ is the pressure on interface γ.

The mortar mixed approximation to the system (4.1)(4.3) is read as; find uhUh,phSh,λhLh such that for 1inb

(α(ph)uh,v)Ki=(ph,v)Kiλh,vνiγig,vνiKiγi,vUhi, (4.4)
(uh,w)Ki=(f(ph),w)KiwShi, (4.5)
i=1nbuhνi,mγi=0,mLh, (4.6)

where last equation enforces flux continuity across mortar interface in weak sense with respect to mortar space. We shall employ mixed finite element method on each block Ki to solve the problem locally. The unknown λh approximate the mortar pressure p.

An application of continuous weak velocities (3.12) returns gloabl counter part of (4.4)(4.6) which is read as; find uhUhc,phSh satisfying

(α(ph)uh,v)=i=1nb(ph,v)Kig,vνiΩ,vUhc, (4.7)
i=1nb(uh,w)Ki=(f(ph),w),wSh. (4.8)

Under Hypothesis 2.1, the following lemma holds (cf. [5]).

Lemma 4.1

There exists a projectionΠ0:(H1/2+ϵ(Ω))UUhcsuch that

((Π0φφ),τ)Ω=0,τSh,

satisfying

Π0φΠφCi=1nbφr+1/2,Kihr+1/2,0rk+1,Π0φφCi=1nbφr,Kihr,1rk+1,

wherein Πφ|Ki=Πiφ.

5. Existence of solution for discrete problem

We will demonstrate that the discrete problem has a unique solution in this section. We will apply the fixed-point argument (FPA) to establish the existence result. Prior to address existence, we will review the following version of Taylor's theorem. For ρSh the relation

α(ρ)α(p)=α˜(ρ)(pρ)=αp(p)(pρ)+α˜pp(ρ)(pρ)2. (5.1)

holds. Here

α˜p(ρ)=01αp(ρ+t[pρ])dt,α˜pp(ρ)=01(1t)αpp(p+t[ρp])dt,

are bounded functions in Ω¯. Also

f(ρ)f(p)=f˜p(ρ)(pρ)=fp(p)(pρ)+f˜pp(ρ)(pρ)2. (5.2)

Subtracting (4.7) - (4.8) from (4.1)(4.2) and using (5.1), (5.2) we obtain the error equations

(α(p)(uuh),v)K=i=1nb{(pph,v)Ki(α˜(ph)(pph)uh,v)Kip,vνiγi},vUhc, (5.3)
i=1nb((uuh),w)Ki=(f˜p(ph)(pph),w),wSh. (5.4)

Further modification in (5.3)(5.4) using (5.1) and (5.2) with ρ=ph leads to the system

(α(p)(uuh),v)i=1nb(pph,v)Ki+(Γ(pph),v)=(α˜p(ph)(pph)(uuh),v)+(α˜pp(ph)(pph)2u,v)i=1nbp,vνiγi,vUhc, (5.5)
i=1nb((uuh),w)Ki(β(pph),w)Ki)=(f˜pp(ph)(pph)2,w),wSh, (5.6)

where Γ=α˜p(p)u and β=fp(p). Making use of projection operators Πi,π,Ph, their properties (3.1), (3.2) and weakly continuous velocities, the system (5.5)(5.6) returns

(α(p)(Πuuh),v)i=1nb(πpph,v)Ki+(Γ(πpph),v)=(α(p)(Πuu),v)+(Γ(πpp),v)+(α˜p(ph)(pph)(uuh),v)(α˜pp(ph)(pph)2u,v)i=1nbpPhp,vνiγi,vUhc,i=1nb((Πuuh),w)(β(πpph),w)=(β(pπp),w)+(f˜pp(ph)(pph)2,w),wSh.

Define the operator J:H2(Ω)L2(Ω) by

Jω=(A(p)ω+A(p)Γω)βω.

The adjoint J of the operator J is defined by

Jχ=(A(p)χ)+A(p)Γχβχ.

We assume that the restrictions of operators J and J to H2(Ω)H01(Ω) have bounded inverses; that is, there exists a unique ϕH2(Ω)H01(Ω) such that Jϕ=ψ (respectively Jϕ=ψ) for any ψL2(Ω) and

ϕ2Cψ.

Let the map Φ:Uhc×ShUhc×Sh be given by

Φ(η,ρ)=(y,z);where(y,z)is the solution of the system
i=1nb{(α(p)(Πiuy),v)Ki(πpz,v)Ki+(Γ(πpz),v)Ki}=i=1nb{α(p)(Πiuu),v)Ki+(Γ(πpp),v)Ki+(α˜p(ρ)(pρ)(uη),v)Ki+(α˜pp(ρ)(pρ)2,v)KipPhp,vνiγi}vUhc, (5.7)
i=1nb{((Πiuy),w)Ki(β(πpz),w)Ki=i=1nb{β(pπp),w)Ki+(f˜pp(ρ)(pρ)2,w)Ki},wSh. (5.8)

Observe that the system (5.7)(5.8) accord with the mixed method for linear operator J. Thus existence of (5.7)(5.8) for small h follows from [5] with [19]. Hence (y,z) is the solution of the system of the form

(α(p)ψ,v)(φ,v)+(Γφ,v)=F(v),vUhc, (5.9)
(ψ,w)(βφ,w)=G(w),wSh. (5.10)

Problem (5.9) - (5.10) has unique solution (ψ,φ)Uhc×Sh for sufficiently small h and any FU,GS where existence follows from uniqueness. Consequently, the existence of solution for (uh,ph)Uhc×Sh for the system (4.7)(4.8) is similar to show that the map Φ has a fixed point. Therefore, the existence of solution for (4.7)(4.8) follows from Brouwer fixed point theorem if we prove that Φ maps a ball of Uhc×Sh to itself. For this purpose, we need the following lemma.

Lemma 5.1

Let2θ<. LetωUhc,q(L2(Ω))2,rL2(Ω)andq˜L2(γ), ifτShsatisfies

i=1nb{(α(p)ω,v)Ki(τ,v)Ki+(Γτ,v)Ki}=i=1nb{(q,v)Ki+q˜,vνiγi}vUhc, (5.11)
i=1nb{(ω,w)Ki(βτ,w)Ki}=i=1nb(r,w)KiwSh, (5.12)

then there exists a constant C such that

τ0,θCi=1nb[h2/θωKi+h1+2/θ(1δ0k)ωKi+qKi+rKi+q˜1/2,γi], (5.13)

for sufficiently small h whereδijdenote the Kronecker symbol.

Proof

Let θ be the conjugate exponent of θ. Let φW2,θ(Ω) be the unique solution of adjoint problem

Jφ=ψ,inΩφ=0,onΩ,

satisfying the elliptic regularity estimate

φ2,θCψ0,θ.

Now

(τ,ψ)=(τ,Jφ)=i=1nb(τ,(A(p)φ)+A(p)Γφβφ)Ki.

Using (3.1), (3.2), (5.11), (5.12) and integration by part, we have the relation

(τ,ψ)=i=1nb{(q,A(p)φ)Ki+(q,ΠiA(p)φA(p)φ)Ki+(α(p)ω,A(p)φΠiA(p)φ)Ki}+(Γτ,A(p)φΠiA(p)φ)Ki(ω,φPhφ)Ki+(βτ,Phφφ)Ki+(r,Phφφ)Ki(r,φ)Ki+q˜,ΠiA(p)φνiγi.

Then the estimate (5.13) follows from [40], [8]. □

We shall now address our main theorem regarding existence of solution of discrete problem. Let Uh=Uh and Sh=Sh with stronger norm vUh=v0,2+ϵ+divv and w=w0,(4+2ϵ)/ϵ respectively. The solvability of discrete system follows from the following theorem.

Theorem 5.1

For sufficiently smallδ>0, the map Φ maps a ball of radius δ of Uh×Sh into itself.

Proof

Let θ=4+2ϵϵ>4 so that 1θ+12+ϵ=12. Note that ϵ<1 implies θ>4. Let

Πuηδ,andπpρδ<1.

Applying Lemma 5.1 to (5.7) - (5.8) with

ω=Πuy,τ=πpz,q=α(p)(Πuu)+Γ(πpp)+α˜p(ρ)(pρ)(uη)+α˜pp(ρ)(pρ)2,r=β(pπp)f˜pp(ρ)(pρ)2,q˜=pPhp,

and using (3.5), (3.4), (3.3) and (3.9) and Sobolev imbedding inequalities [2], we see that

τ0,θCi=1nb[h2/θΠuyKi+h1+2/θ(1δ0k)(Πuy)Ki+α(p)ΠiuuKi+Γ(πpp)Ki+α˜p(ph)(pρ)(uη)Ki+α˜pp(ph)(pρ)2Ki+β(pπp)Ki+f˜pp(ph)(pρ)2Ki+pPhp1/2,γi]Ci=1nb[h2/θΠiuyU+hp2,Ki+pρ0,4,Ki2+pρ0,θ,Kiuη0,2+ϵ,Ki+pPhp1/2,Ki]Ci=1nb[h2/θΠiuyU+hp2,Ki+pπp0,θ,Ki2+πpρ0,θ,Ki2+(pπp0,θ,Ki+πpρ0,θ,Ki)(uΠiu0,2+ϵ,Ki+Πiuη0,2+ϵ,Ki)Ci=1nb[h2/θΠiuyU+hp2,Ki+δ2+(hp1,θ,Ki+δ)(hu1,2+ϵ,Ki+δ)]Ci=1nb[h2/θΠiuyU+(h+δ2)p2+ϵ2]. (5.14)

If we move the last term in (5.7) to the right, making left hand side of (5.7)(5.8) mixed method for the operator (A(p)), then we have the estimate

ΠuyUCi=1nb[πpzKi+qKi+rKi+q˜1/2,Ki]Ci=1nb[πpz0,θ+(h+δ2)]. (5.15)

Combining (5.15) and (5.14), we obtain

πpz0,θC[hθ/2πpz0,θ,Ki+(h+δ2)]. (5.16)

For sufficiently small h, we have from (5.16)

πpz0,θC1[h+δ2]. (5.17)

A combination of (5.16) and (5.17) yield

ΠuyUC2[h+δ2]. (5.18)

Since the mesh under consideration is quasi-uniform so inverse estimate and (5.18) implies

Πuy0,2+ϵCϵhϵ/(2+ϵ)ΠuyCϵhϵ/(2+ϵ)C2[h+δ2]C3[h2/(2+ϵ)+δ2hϵ/(2+ϵ)]. (5.19)

Adding (5.18) and (5.19), we see that

ΠuyU2C3[h2/(2+ϵ)+δ2hϵ/(2+ϵ)]. (5.20)

Choosing δ=4C3h2/(2+ϵ) then equation (5.20) suggests that 2C3h2/(2+ϵ)δ/2 and 2C3δ2hϵ/(2+ϵ)δ/2. Thus we must have δ[(4C3)1hϵ/(2+ϵ),4C3hϵ/(2+ϵ)]. Therefore, (5.17) and (5.20) imply

πpz0,θδ,ΠuyUδ. (5.21)

Hence Φ maps the ball of radius δ centered at (Πu,πp) onto itself. Existence is established. □

6. Error estimates

This section is dedicated to a priori error estimates for proposed method. In ordered to derive error estimates, we need the following bounds (cf. [40]).

Corollary 6.1

For0<ϵ<1andθ=(4+2ϵ)/ϵ, there exists a sequence of discrete solutions{uh,ph}{u,p},h0satisfying

max{uuh0,2+ϵ,pph0,θ}Ch2/(2+ϵ),

Moreover,

uh0,C(1+p2+ϵ2). (6.1)

Using first order Taylor expansion, the error equations (5.5)(5.6) can be written in the form

(α(p)(uuh),v)i=1nb(pph,v)Ki+p,vνiγi+(α˜p(ph)(pph)uh,v)=0,vUhc, (6.2)
i=1nb((uuh),w)Ki=(f˜p(ph)(pph),w),wSh, (6.3)

where αp˜ and f˜p are bounded functions.

Note that the mixed finite element method for the operator L:H2(Ω)H01(Ω)L2(Ω) define

Lω=(A(x,p)ω+A(x,p)[α˜p(ph)uh]ω),

with formal adjoint

Lχ=(A(x,p)χ)+A(x,p)[α˜p(ph)uh]χ,

corresponds to the error equations (6.2)(6.3). Following technical lemma is required to apply the duality argument in the derivation of convergence estimates.

Lemma 6.1

There existsh0>0such that ifh<h0. The operatorLhas a bounded inverse mapping fromH2(Ω)ontoH2(Ω)H01(Ω).

Theorem 6.1

If condition(2.2)holds, then for solutions{uh,ph}of the system(4.4)(4.6), there exists a positive constant C independent of h such that

(uuh)Ci=1nb[ur,Ki+ur,Ki+pr+1,Ki]hr,1rk+1.uuhCi=1nb[ur,Ki+pr+1,Ki]hr,1rk+1.pphCi=1nb[ur,Ki+pr+1,Ki]hr,1rmin{k+1,l+1}.

Proof

For convenience, we introduce the notations

d=uuh,e=Πiuuh,Λ=pph,τ=πpp.

Rewrite the system (6.2)(6.3) and using above notations, we arrived at

i=1nb{(α(p)e,v)Ki(τ,v)Ki+([α˜(ph)uh]τ,v)Ki}=i=1nb{(α(p)(Πuu),v)Ki+([α˜p(ph)uh](πpp),v)Ki+Ppp,vνiγi},vUh0, (6.4)
i=1nb{(e,w)Ki(f˜p(ph)τ,w)Ki}=(f˜p(ph)(pπp),w)Ki,wSh. (6.5)

Applying Lemma 5.1 to the system (6.4)(6.5) with condition θ=2 combined with Lemma 6.1 and utilizing (3.3), (3.4), (3.5), (3.9), and (6.1), we observe that

τi=1nb[heKi+h2δ0keKi+ΠiuuKi+πppKi+Ppp1/2,γi]Ci=1nb[heKi+h2δ0keKi+hrur,Ki+hrpr+1]. (6.6)

Now using Πi and π, we rewrite (5.5)(5.6) in the form

i=1nb{(α(p)e,v)Ki(τ,v)Ki}=i=1nb{(Πiuu,v)Ki(α˜p(ph)uhΛ,v)Ki+pPhp,vνiγi},vUh0,i=1nb(e,w)=(f˜p(ph)Λ,w),wWh,

then the estimate

eUCi=1nb[ΠiuuKi+uh0,ΛKi+ΛKi+pPhp1/2,γi], (6.7)

is obtained from (6.1) [12] (adopting the same procedure as did to obtain (5.17)). Using (3.3) (3.5) and (3.9), (6.7) implies

eUCi=1nb[hrur,Ki+ΛKi+hrpr+1,Ki]. (6.8)

Substituting (6.8) in (6.6), we see that

τCi=1nb[hrur,Ki+hΛKi+hrpr+1,Ki]. (6.9)

Combining triangle inequality with (6.9) and (3.4), we arrived at

Λ=pphpπp+τCi=1nb[hrpr,Ki+hrur,Ki+hΛKi+hrpr+1,Ki].

For sufficiently small h, the above relation implies that

ΛCi=1nb[hrur,Ki+hrpr+1,Ki]. (6.10)

Put back (6.10) in (6.8)

eUCi=1nb[hrur,Ki+hrpr+1,Ki]. (6.11)

Applying triangle inequality and using (6.11) and (3.5), we see that

de+uΠuCi=1nb[hrur,Ki+hrpr+1,Ki]. (6.12)

Finally using (6.11) and (3.6), we obtain

di=1nb[eKi+(uΠu)Ki].Ci=1nb[hrur,Ki+hrur,Ki+hrpr+1,Ki].

 □

7. Uniqueness

Let {uhi,phi}i=12Uhc×Sh be the solution of (4.7)(4.8) satisfying Theorem 6.1 provided that they satisfy (5.21). Then the system (4.7)(4.8) implies that

(α(ph1)uh1,v)=i=1nb(ph1,v)Kig,vνiΩ,vUhc, (7.1)
i=1nb(uh1,w)Ki=(f(ph1),w),wSh, (7.2)

and

(α(ph2)uh2,v)Ki=i=1nb(ph2,v)Kig,vνiΩ,vUhc, (7.3)
i=1nb(uh2,w)Ki=(f(ph2),w),wSh. (7.4)

Subtracting (7.3)(7.4) from (7.1)(7.2), we see that

(α(ph1)uh1α(ph2)uh2,v)=i=1nb(ph1ph2,v)Ki,vUhc, (7.5)
i=1nb((uh1uh2),w)Ki=(f(ph1)f(ph2),w),wSh. (7.6)

Using (5.1) and (5.2), we get

α(ph1)uh1α(ph2)uh2=α(ph1)(uh1uh2)+α˜p(ph1)(ph1ph2)uh2. (7.7)
f(ph1)f(ph2)=f˜p(ph1)(ph2ph1)=f˜p(ph1)(ph1ph2). (7.8)

Substituting (7.7) and (7.8) in (7.5) - (7.6), and using the notations

P=ph1ph2,Q=uh1uh2,

we see that

i=1nb{(α(ph1)Q,v)Ki(P,v)Ki+(α˜p(ph1)uh2P,v)Ki}=0,vUhc, (7.9)
i=1nb(Q,w)Ki(f˜p(ph1),w)Ki=0,wSh. (7.10)

Then we have the following bound (cf. [19])

QCP, (7.11)
QCP. (7.12)

Now modifying the term α(ph1)Q, we can rewrite the system (7.9)(7.10) in the form

i=1nb{α(p)Q,v)Ki(P,v)Ki+(α˜p(ph1)uh2P,v)Ki}=i=1nb(α˜p(ph1)(pph1)Q,v)Ki,vUhc, (7.13)
i=1nb{(Q,w)Ki(f˜p(ph1)P,w)Ki=0},wSh. (7.14)

Applying Lemma 5.1 to (7.13)(7.14) with θ=2, we see that

PCi=1nb[h(QKi+QKi)]. (7.15)

Combining (7.11), (7.12) and (7.15), we have

PChP, (7.16)

which in turn implies that, for sufficiently small h, P0, that is, P=0. Hence (7.11) gives Q=0. Thus ph1=ph2 and uh1=uh2.

8. Mortar interface formulation

We now turn our attention to the mortar interface formulations and present the error estimate for the approximation to the mortar pressure. The accuracy of the data transmission between the subdomains is indicated by the order of convergence in interface space. For this, let us define the pressure dependent bilinear form Dh=L2(γ)×L2(γ)R by

Dh(λ,m)=i=1nbDh,i(λ,m)=i=1nbuh(λ)νi,mγi,λ,mL2(γ).

where uh(λ)Uh×Sh is a component of solution (uh(λ),ph(λ)) solves the local problem

(α(ph)uh(λ),v)Ki=(ph(λ),v)Kiλ,vνiγi,vUhi,(uh,w)Ki=0,wShi,

for 1inb with given λ and f=0,g=0.

Next, we define the linear functional Gh:L2(γ)R by

Gh=i=1nbGh,i(m)=i=1nbu¯h,νi,mγi,

where (u¯h,p¯h)Uh×Sh solves the problem

(α(ph)u¯h,v)Ki=(p¯h,v)Kig,vνKiγ,vUhi,(u¯h,w)Ki=(f(ph),w)Ki,wShi,

for 1inb with λ=0 and given f and g.

It is easy to show [29] that the solution of the discrete system (4.4)-(4.6) satisfies the problem

Dh(λh,m)=Gh(m),mLh,

with

uh=uh(λh)+u¯h,ph=ph(λh)+p¯h.

Lemma 8.1

The interface bilinear formDh(,)is symmetric and positive semi-definite onL2(γ). If condition(2.2)holds, thenDh(,)is positive definite onLh. Moreover

Dh,i(m,m)=(α(ph)uh(m),uh(m))Ki0. (8.1)

Let us define the semi-norm induced by the bilinear form Dh(,) on L2(γ) by

mDh=Dh(m,m),mL2(γ).

Theorem 8.1

I f condition(2.2)holds, then for the interface pressureλhthere exists a positive constant C such that

pλhi=1nb[pr+1+uuh]hr.

Proof

Note that (uh(m),ph(m))Uh×Wh satisfy

(α(ph)uh(m),v)Ki=(ph(m),v)Kig,vνiKiγ,vUh,i, (8.2)
(uh(m),w)Ki=(f,w)Ki,wSh,i, (8.3)

with

uh(m)=uh(m)+u¯,ph(m)=ph(m)+p¯h,mL2(γ).

Particularly, uh(λh)=uh and ph(λh)=ph, the linearity of uh() along with (8.1) gives

pλhC[uh(p)uh(λh)C[uh(p)uh(λh)]C[uh(p)u+uuh]. (8.4)

The standard mixed method for (4.4)(4.6) and (8.2)(8.3) yields [40]

uh(p)uKiChrpr+1,Ki,1rk+1. (8.5)

Finally, (6.12), (8.4) and (8.5) conclude that

pλhDhC[hrpr+1+uuh].

 □

9. Implementation and numerical results

Before presenting the numerical results, we will briefly describe the implementation of our discrete scheme for the equations under consideration, that is, nonlinear elliptic problems. We will test both the Fixed-Point Iteration (FPI) and Newton-Raphson method (NRM) for the linearization of discrete system. Moreover, we will present the algorithms for both the methods.

9.1. Fixed-point iteration (FPI)

Let {uh0,ph0,λh0} be the initial guess to the solution of discrete nonlinear system (4.4)(4.6). Then, we construct the sequence {uhn,phn,λhn}Uh×Sh×Lh satisfying the relation

(α(phn)uhn+1,v)Ki=(phn+1,v)Kiλhn+1,vνiγig,vνiKiγ,vUhi, (9.1)
(uhn+1,w)Ki=(f(phn),w)Ki,wShi, (9.2)
i=1nbuhn+1νi,mγi,mLh. (9.3)

Observe that the system (9.1)(9.3) is linear for each n. Let Di=(α(phn)uhn+1,v)Ki,Ei=(phn+1,v)Ki,g˜i=g,vνiKiγ,f˜i=(f(phn),w)Ki, then the standard mixed system on each block Ki yields

[DiEiEiT0][αiβi]=[g˜if˜i], (9.4)

where αi,βi denote the degree of freedom of subdomain unknowns uh and ph respectively for 1inb. Let ξi=(αi,βi),1inb be the vector related to subdomain unknowns and let μ be the vector associated with mortar degree of freedom. The system (9.1)(9.3) returns the global matrix form

[A100B10A20B200AnbBnbC1C2Cnb0][ξ1ξ2ξnbμ]=[F1F2Fnb0], (9.5)

with Bi=λhn+1,vνiγi,Ci=BiT,Fi=[g˜,f˜] and Ai are the matrices given in (9.4). We mention that each row of the matrix on the left hand side of (9.5) arises from mixed approximation for 1inb. The matrices Bi are corresponding to the local approximation on each γi for 1inb. The last row, i.e., Ci,1inb impose the weak continuity of flux variable across the interface γij.

The system (9.5) can be reduced to a lower dimensional mortar interface problem involving only the mortar pressure as follows;

ξi=Ai1(FiBiμ),1inb, (9.6)
i=1nbCiξi=0, (9.7)

Using (9.6) in (9.7), we see that

i=1nbCi(Ai1(FiBiμ))=0,

which implies

Bμ=L, (9.8)

where B=i=1nbCiAi1Bi and L=i=1nbCiAi1Fi. Thus eliminating the subdomain unknowns we obtain the interface problem (9.8). Solving (9.8) for μ and substituting in (9.6), we obtain

ξi=Ai1(FiBiB1L).

We describe the implementation procedure of FPI for nonlinear elliptic problems in Algorithm 1.

Algorithm 1.

Algorithm 1

Fixed-point Iteration (FPI) for mortar mixed method.

9.2. Newton Raphson method (NRM)

We now derive the Newton Raphson method (NRM) for our nonlinear mixed system (4.4)(4.6). Let {uh0,ph0,λh0} be the given initial guess such that

uhn+1=uhn+δuh,phn+1=phn+δph,λhn+1=λhn+δλh. (9.9)

for n0 where δuh,δph,δλh are the correction terms. Then the system (4.4)(4.6) implies

(α(phn+1)uhn+1,v)Ki=(phn+1,v)Kiλhn+1,vνiγig,vνiKiγi,vUhi, (9.10)
(uhn+1,w)Ki=(f(phn+1),w)Ki,wShi, (9.11)
i=1nbuhn+1νi,mγi=0,mLh. (9.12)

Using (9.9) and Taylor expansion by neglecting the second order and higher terms, the system (9.10) - (9.12) implies

(α(phn)δuh,v)Ki+(αp(phn)uhnδph,v)Ki(δph,v)Ki+δλh,vνiγi=(α(phn)uhn,v)Ki+(phn,v)Kiλhn,vνiγig,vνiγi,vUhi, (9.13)
(δuh,w)Ki(fp(phn)δph,w)Ki=(f(phn),w)Ki(uhn,w)Ki,wShi, (9.14)
i=1nbδuhνi,mγi=i=1nbuhnνi,mγi,mLh. (9.15)

We mention that (9.13)(9.15) is a linear algebraic system corresponding to mortar mixed formulation of nonlinear elliptic equations. The system (9.13)(9.15) can be solved for {δuh,δph} for 1inb. Thus for given initial guess {uh0,ph0,λh0} solve (9.13)(9.15) and update solution by using (9.9) on each step of Newton-Raphson iteration.

Let {δuhi,δphi,δλhi} denote the correction terms locally on each subdomain Ki. Moreover, let αi,γi,1inb denote the degree of freedom related to δuhi and δphi. Let δξ1=(α1,γ1),δξ2=(α2,γ2),δξn=(αnb,γnb). Let Z be the vector corresponding to degree of freedom of interface unknown δλh. Then the linear system (9.13)(9.15) takes the form

[A1000B10A200B2000AnbBnbC1C20Cnb0][δξ1δξ2δξnbZ]=[F1F2FnbG], (9.16)

with

[DiEi+E˜iEiTHi][αiβi]=[g˜if˜i],

representing the local mixed finite element system on each subdomain block Ki. Furthermore, Bi=δλh,vνiγi,Ci=BiT,G=i=1nbuhnνi,mγi and

Fi=[g,vνiKiγi(α(phn)uhn,v)Kiλhn,vνiγi+(phn,v)Ki(f(phn),w)Ki(uhn,w)Ki].

Here matrices Ai come from the application of mixed method locally on each subdomain and Bi is the interface matrix associated to interface γij. The matrices Ci are corresponding to the condition of weak continuity across the subdomain interface. System (9.16) implies

δξi=Ai1(FiBiZ),1inb, (9.17)
i=1nbCiδξi=G, (9.18)

Then similar to FPI (as we did to ge (9.8)), we have

BZ=L, (9.19)

with

B=i=1nbCiAi1Bi,L=G+i=1nbCiAi1Fi

which gives the interface problem containing only mortar pressure variable. Solving (9.19) for Z and substituting in (9.17)(9.18), we recover the local subdomain unknowns uh and ph. The implementation procedure for NRM for nonlinear elliptic equation is given in Algorithm 2.

Algorithm 2.

Algorithm 2

Newton-Raphson method (NRM) for mortar mixed method.

9.3. Numerical results

To confirm the theoretical finding established in the article, we now present computational results. The computational experiments are performed on two dimensional unit square domain with Dirichlet boundary conditions. In all the examples we use tolerance 108 to control nonlinear solves. The Discrete errors are calculated in L2 norms. We implement the linearized discrete system (9.1)(9.3) for FPI and (9.13)(9.15) for NRM. The implementation procedure for both methods is provided in Algorithm 1, Algorithm 2. We consider four, eight and sixteen subdomains to perform the experiments. In the case of four subdomains our interface is along x=1/2,y=1/2. In eight subdomains, the interface is along x=1/4,1/2,3/4,y=1/2. For the sixteen subdomains case, we divide the domain so that the interface is along x=1/4,1/2,3/4,y=1/4,1/2,3/4. The graphical visualization of domain decomposition is depicted in Figure 1, Figure 2, Figure 3 where interface skeletons are shown by red lines.

Figure 1.

Figure 1

Domain decomposition for nb = 4.

Figure 2.

Figure 2

Domain decomposition for nb = 8.

Figure 3.

Figure 3

Domain decomposition for nb = 16.

The local problem posed on each subdomain is solved by using the lowest order Raviart Thomas space. For the triangle TTh(RT0)., the Raviart Thomas space of index k (RTk) is defined by

RTk(T)=(Pk(T))d+xPk(T),k0,

where Pk(T) denote the space of polynomials of degree less than or equal to k on T. Then the Raviart Thomas (RTk) approximation space is defined by

RTk(T)={φ|φRTk(T)for allTThi,φnijis constant for alleijεh},

where εh is the collection of interior edges of triangulation Thi and nij denote the unit normal to eij. For k=0, the lowest order Raviart Thomas space is

RT0(T)={φ:TR2,φ(x)=(ax1+b1,ax2+b2),a,b1,b2R}

The most common choice in the implementation of mixed finite element method is RT0P0, that is, lowest order Raviart Thomas space for velocity and constant space for pressure, thus we choose

Uhi=RT0(T)=(P0(T))d+xP0(T),Shi(T)=P0(T).

The interelement continuity ensures that UhiUi and ShiSi. The constant in the basis function φi is calculated such that

φinj={1,if i=j0,ifij.

where nj is the normal vector associated with the sides of triangle. The interface pressure unknown is approximated by the linear polynomial. We considered both the Fixed-point iteration and Newton's Raphson method to solve the nonlinear problem. The FPI and NRM number of iterations are reported which reflect the efficiency of the numerical method.

Example 9.1

We consider the domain Ω a unit square (0,1)×(0,1) with coefficient A(p)=2+p2. The exact solution is taken to be

p(x,y)=sin(πx)sin(πy). (9.20)

The solution u and right hand side f is calculated using (9.20).

The discrete norm errors (DNEs) calculated in L2errors and convergence rate (CRs) for Example 9.1 using FPI are presented in Table 9.1. It is observed that the pressure and velocity approximations have optimal order convergence of O(h). The order of convergence for interface pressure approximation to λ is of O(h2). The convergence rates and discrete errors for different level of grids refinements for Example 9.1 for NRM are displayed in 9.2. The table returns optimal order convergence for subdomain scalar and vector variables. For interface pressure approximation, the rate of convergence is O(h2). Results of numerical experiments for Example 9.1 on eight subdomains are shown in Table 9.3, Table 9.4. The results are produced using FPI and NRM. We report L2 discrete errors, order of convergence and number of iteration for the iterative methods. We acquired the optimal order convergence of O(h2) for both velocity and pressure approximations which matches theoretical results established in previous sections. The interface pressure approximation has convergence of order O(h2).

Table 9.1.

DNEs and CRs for Example 9.1 using FPI ; nb = 4.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 9 1.15E+00 1.31E-01 8.16E-03
16 9 5.72E-01 1.01 6.52E-02 1.01 2.19E-03 1.90
32 9 2.86E-01 1.00 3.26E-02 1.00 5.67E-04 1.95
64 9 1.43E-01 1.00 1.63E-02 1.00 1.44E-04 1.98
128 9 7.14E-02 1.00 8.14E-03 1.00 3.63E-05 1.99
256 9 3.57E-02 1.00 4.07E-03 1.00 9.11E-06 1.99
512 9 1.78E-02 1.00 2.03E-03 1.00 2.28E-06 2.00

Table 9.2.

DNEs and CRs for Example 9.1 using NRM; nb = 4.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 4 1.15E+00 1.31E-01 8.16E-03
16 4 5.72E-01 1.01 6.52E-02 1.01 2.19E-03 1.90
32 4 2.86E-01 1.00 3.26E-02 1.00 5.67E-04 1.95
64 4 1.43E-01 1.00 1.63E-02 1.00 1.44E-04 1.98
128 4 7.14E-02 1.00 8.14E-03 1.00 3.63E-05 1.99
256 4 3.57E-02 1.00 4.07E-03 1.00 9.11E-06 1.99
512 4 1.78E-02 1.00 2.03E-03 1.00 2.28E-06 2.00

Table 9.3.

DNEs and CRs for Example 9.1 using FPI; nb = 8.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 10 2.53E+00 2.87E-01 3.72E-02
16 9 1.25E+00 1.02 1.43E-01 1.01 9.34E-03 1.99
32 9 6.20E-01 1.01 7.15E-02 1.00 2.39E-03 1.97
64 9 3.10E-01 1.00 3.57E-02 1.00 6.04E-04 1.98
128 9 1.55E-01 1.00 1.79E-02 1.00 1.52E-04 1.99
256 9 7.74E-02 1.00 8.93E-03 1.00 3.82E-05 1.99
512 9 3.87E-02 1.00 4.47E-03 1.00 9.56E-06 2.00

Table 9.4.

DNEs and CRs for Example 9.1 using NRM; nb = 8.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 5 2.52E+00 2.89E-01 3.80E-02
16 5 1.25E+00 1.01 1.43E-01 1.02 9.51E-03 2.00
32 4 6.20E-01 1.01 7.15E-02 1.00 2.41E-03 1.98
64 4 3.10E-01 1.00 3.57E-02 1.00 6.07E-04 1.99
128 4 1.55E-01 1.00 1.79E-02 1.00 1.52E-04 2.00
256 4 7.74E-02 1.00 8.93E-03 1.00 3.82E-05 1.99
512 4 3.87E-02 1.00 4.47E-03 1.00 9.56E-06 2.00

Numerical results on eight subdomains for Example 9.1 are presented in Table 9.5, Table 9.6. We observed the optimal order convergence for both pressure and velocity approximation while the order the order of convergence for interface pressure is of order O(h2).

Table 9.5.

DNEs and CRs for Example 9.1 using FPI; nb = 16.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 9 2.17E+00 2.56E-01 1.57E-02
16 9 1.08E+00 1.01 1.27E-01 1.01 4.20E-03 1.90
32 9 5.38E-01 1.01 6.36E-02 1.00 1.08E-03 1.96
64 9 2.69E-01 1.00 3.18E-02 1.00 2.75E-04 1.97
128 9 1.34E-01 1.01 1.59E-02 1.00 6.93E-05 1.99
256 9 6.72E-02 1.00 7.94E-03 1.00 1.74E-05 1.99
512 9 3.36E-02 1.00 3.97E-03 1.00 4.35E-06 2.00

Table 9.6.

DNEs and CRs for Example 9.1 using NRM; nb = 16.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 4 2.17E+00 2.56E-01 1.68E-02
16 4 1.08E+00 1.01 1.27E-01 1.01 4.33E-03 1.96
32 4 5.38E-01 1.01 6.36E-02 1.00 1.10E-03 1.98
64 4 2.69E-01 1.00 3.18E-02 1.00 2.77E-04 1.99
128 4 1.34E-01 1.01 1.59E-02 1.00 6.95E-05 1.99
256 4 6.72E-02 1.00 7.94E-03 1.00 1.74E-05 2.00
512 4 3.36E-02 1.00 3.97E-03 1.00 4.36E-06 2.00

The graphical comparison of the approximate solution ph, exact solution p, the computed vector field uh and exact vector field u for Example 9.1 is shown in Figure 4, Figure 5. Computed and exact pressure shown in Figs. 4A and 4B respectively. The velocity solutions are shown in Fig. 5A and 5B. We also depict the graphical results for interface pressure solutions and absolute error |λλh| in the Fig. 6.

Figure 4.

Figure 4

Exact and computed pressure for Example 9.1.

Figure 5.

Figure 5

Exact and computed vector field for Example 9.1.

Figure 6.

Figure 6

The exact solution λ, approximate solution λh and absolute error |λ − λh| on interface for Example 9.1.

Example 9.2

We consider the domain Ω a unit square (0,1)×(0,1) with coefficient A(p)=2+p2. The exact solution is taken to be

p(x,y)=xy(1x)(1y). (9.21)

The solution u and right hand side f can be calculated using (9.21).

The discrete L2error and order of convergence for Example (9.21) using FPI on four, eight and sixteen subdomain blocks are given in Table 9.7, Table 9.9, Table 9.11 respectively. The results for the NRM are given in Table 9.8, Table 9.10, Table 9.12.

Table 9.7.

DNEs and CRs for Example 9.2 using FPI; nb = 4.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 4 7.53E-02 8.94E-03 2.21E-03
16 4 3.74E-02 1.03 4.40E-03 1.06 5.65E-04 1.87
32 4 1.86E-02 1.01 2.19E-03 1.02 1.42E-04 1.97
64 4 9.32E-03 1.01 1.09E-03 1.01 3.54E-05 1.99
128 4 4.66E-03 1.00 5.47E-04 1.01 8.85E-06 2.00
256 4 2.33E-03 1.00 2.73E-04 0.99 2.21E-06 2.00
512 4 1.16E-03 1.00 1.37E-04 1.00 5.53E-07 2.00

Table 9.9.

DNEs and CRs for Example 9.2 using FPI; nb = 8.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 4 1.58E-01 2.03E-02 5.57E-03
16 4 7.85E-02 1.01 9.79E-03 1.05 1.48E-03 1.91
32 4 3.92E-02 1.00 4.85E-03 1.01 3.74E-04 1.98
64 4 1.96E-02 1.00 2.42E-03 1.00 9.37E-05 2.00
128 4 9.78E-03 1.00 1.21E-03 1.00 2.34E-05 2.00
256 4 4.89E-03 1.00 6.04E-04 1.00 5.85E-06 2.00
512 4 2.45E-03 1.00 3.02E-04 1.00 1.46E-06 2.00

Table 9.11.

DNEs and CRs for Example 9.2 using FPI; nb = 16.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 4 1.31E-01 1.74E-02 3.47E-03
16 4 6.51E-02 1.01 8.53E-03 1.03 8.53E-04 2.02
32 4 3.25E-02 1.00 4.24E-03 1.01 2.10E-04 2.02
64 4 1.62E-02 1.00 2.12E-03 1.00 5.18E-05 2.02
128 4 8.12E-03 1.00 1.06E-03 1.00 1.29E-05 2.01
256 4 4.06E-03 1.00 5.29E-04 1.00 3.21E-06 2.01
512 4 2.03E-03 1.00 2.65E-04 1.00 8.00E-07 2.00

Table 9.8.

DNEs and CRs for Example 9.2 using NRM; nb = 4.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 3 7.53E-02 8.94E-03 2.21E-03
16 3 3.74E-02 1.01 4.40E-03 1.02 5.65E-04 1.97
32 3 1.86E-02 1.01 2.19E-03 1.01 1.42E-04 1.99
64 3 9.32E-03 1.00 1.09E-03 1.01 3.54E-05 2.00
128 3 4.66E-03 1.00 5.47E-04 0.99 8.85E-06 2.00
256 3 2.33E-03 1.00 2.73E-04 1.00 2.21E-06 2.00
512 3 1.16E-03 1.01 1.37E-04 0.99 5.53E-07 2.00

Table 9.10.

DNEs and CRs for Example 9.2 using NRM ; nb = 8.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 3 1.58E-01 2.03E-02 5.58E-03
16 3 7.85E-02 1.01 9.79E-03 1.05 1.48E-03 1.91
32 3 3.92E-02 1.00 4.85E-03 1.01 3.74E-04 1.98
64 3 1.96E-02 1.00 2.42E-03 1.00 9.37E-05 2.00
128 3 9.78E-03 1.00 1.21E-03 1.00 2.34E-05 2.00
256 3 4.89E-03 1.00 6.04E-04 1.00 5.85E-06 2.00
512 3 2.45E-03 1.00 3.02E-04 1.00 1.46E-06 2.00

Table 9.12.

DNEs and CRs for Example 9.2 using NRM ; nb = 16.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 3 1.31E-01 1.74E-02 3.47E-03
16 3 6.51E-02 1.01 8.53E-03 1.03 8.53E-04 2.02
32 3 3.25E-02 1.00 4.24E-03 1.01 2.10E-04 2.02
64 3 1.62E-02 1.00 2.12E-03 1.00 5.18E-05 2.02
128 3 8.12E-03 1.00 1.06E-03 1.00 1.29E-05 2.01
256 3 4.06E-03 1.00 5.29E-04 1.00 3.21E-06 2.01
512 3 2.03E-03 1.00 2.65E-04 1.00 8.00E-07 2.00

The number of iteration to converge the FPI and NRM on each level of mesh refinement are also reported. The optimal order convergence rate O(h) is observed for both velocity and pressure approximation. The interface pressure approximation has convergence of order O(h2).

It is observed that the convergence rates for subdomain variables are of order O(h). The convergence rate for interface pressure is O(h2). The graphical comparison of the solutions on subdomains and interface are given in Figure 7, Figure 8. In Fig. 7A and 7B we depicted the exact and approximate pressure while Fig. 8A and 8B present the comparison of exact and computed velocity fields. The exact and approximate vector field for Example 9.1 are depicted in Fig. 5 The graphical results for Example 9.1 for interface pressure are shown in Fig. 9. We showed the exact solution λ, the approximate solution λh and the absolute error |λλh|. To illustrate the effectiveness and flexibility of the method, we present an example with discontinuous coefficients. In Example 9.3, we divide the computational domain into four regions and take a(p)=2+p in lower left and top right regions while a(p)=2+p2 in upper left and lower right regions.

Example 9.3

We consider the domain Ω a unit square (0,1)×(0,1) with discontinuous coefficient. The exact solution is taken to be

p(x,y)=cos(2πx)cos(2πy). (9.22)

The coefficient profile on different region are shown in Fig. 10. We depicted both the three dimensional (Fig. 10A) and two dimensional view (Fig. 10B). This example demonstrates the flexibility and feature of local grids. The result multiblock mixed approach are comparable to those classical mixed method and mixed methods on locally refined grids for matching grids, however, multiblock approach offers great flexibility which is necessary to handle complicated geometries. Moreover, multiblock approach provides parallel computation which improve the efficiency of the method. It is worth mentioning that the multiblock mixed method gives better accuracy when non-matching grids are used.

Figure 7.

Figure 7

Exact and computed pressure for Example 9.2.

Figure 8.

Figure 8

Exact and computed vector field for Example 9.2.

Figure 9.

Figure 9

The exact solution λ, approximate solution λh and absolute error |λ − λh| on interface for Example 9.2.

Figure 10.

Figure 10

Coefficient profile for Example 9.3.

We obtained the optimal order convergence for pressure, velocity and interface approximations. The graphical comparison of solutions for Example 9.3 is shown in Figure 11, Figure 12. Figs. 11A and 11B compare the exact and computed pressure. The xcomponents exact and computed velocity are displayed in Figs. 12A and 12A and ycomponents of exact and computed velocity are shown in Fig. 12C and 12D respectively. Finally, the exact interface pressure, computed interface pressure and absolute error are depicted in Fig. 13 (top to bottom). The numerical results for Example 9.3 using NRM are similar to that of FPI as shown in Table 9.13 (except the number of iterations) and are not displayed here. The interface exact and computed solutions along with absolute error are depicted in Fig. 12 Comparing the accuracy of numerical results on four, eight and sixteen subdomains. It is evident from Figure 1, Figure 2, Figure 3 that increasing the subdomain block in domain decomposition leads an increase in the interfaces between the blocks. This in turn have an impact on the precision of data transmission between the blocks across the interface. Consequently, an increase in subdomain effect the accuracy of numerical results on subdomain level as witnessed in the above tables. On the other hand, it is important to note that the size of local problem on fewer subdomain block is significantly larger as compare to those on many subdomains. Therefore, scarifying a slight accuracy we can efficiently solve the local problems. Moreover, the order of convergence remains same regardless number of subdomains.

Figure 11.

Figure 11

Exact and computed pressure for Example 9.3.

Figure 12.

Figure 12

Exact and computed flux for Example 9.3.

Figure 13.

Figure 13

The exact solution λ, approximate solution λh and absolute error |λ − λh| on interface for Example 9.3.

Table 9.13.

DNEs and CRs for Example 9.3 using FPI; nb = 4.

1/h Iter u − uh CR p − ph CR λ − λh CR
8 4.63E+00 2.69E-01 7.15E-02
16 2.26E+00 1.03 1.32E-01 1.03 1.98E-02 1.85
32 1.12E+00 1.01 6.56E-02 1.01 5.10E-03 1.96
64 5.60E-01 1.00 3.27E-02 1.00 1.29E-03 1.98
128 2.80E-01 1.00 1.64E-02 1.00 3.23E-04 2.00
256 1.40E-01 1.00 8.18E-03 1.00 8.09E-05 2.00
512 7.00E-02 1.00 4.09E-03 1.00 2.02E-05 2.00

Comparing the numerical results obtained by FPI and NRM, the Tables show that there is no difference in accuracy and order of convergence however; NRM converges faster than FPI. Also we obtained same order of convergence for both the iterative methods.

10. Conclusion

We consider the numerical approximation of second order nonlinear elliptic equations modeling Darcy flow in porous medium with pressure dependent permeability. This paper presents the generalization multiblock mortar mixed method for the nonlinear partial differential equations. The existence of the discrete system for our method is established by using the fixed point theorem. We also demonstrate the uniqueness of solution. Optimal error estimates are derived for velocity and pressure approximations and an error bound for the interface pressure is also presented. We briefly describe the implementation procedure for our formulation and present the algorithm to perform computational experiments. We have used both the fixed point iteration and Newton Raphson method for the linearization of nonlinear term. Numerical Examples are presented to verify the theoretical order of convergence.

CRediT authorship contribution statement

Muhammad Arshad: Writing – original draft, Methodology, Conceptualization. Adil Mehmood: Writing – original draft, Software, Investigation. Zabidin Salleh: Resources, Funding acquisition. Sumaira Saleem Akhtar: Visualization, Software, Investigation. Suliman Khan: Validation, Resources. Mustafa Inc: Writing – review & editing, Supervision.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Acknowledgement

This work was supported by the Universiti Malaysia Terengganu under the Interdisciplinary Impact Driven Research Grant (ID2RG) 2023, vote no. 55516.

Contributor Information

Muhammad Arshad, Email: arshad@aust.edu.pk, arshad.fem@gmail.com.

Adil Mehmood, Email: ch.adilmehmood002@gmail.com.

Zabidin Salleh, Email: zabidin@umt.edu.my.

Sumaira Saleem Akhtar, Email: sumairamaths@gmail.com.

Suliman Khan, Email: dr.suliman.khan21@gmail.com.

Mustafa Inc, Email: minc@firat.edu.tr.

References

  • 1.Achdou Y., Maday Y., Widlund O. Iterative substructuring preconditioners for mortar element methods in two dimensions. SIAM J. Numer. Anal. 1999;36(2):551–580. [Google Scholar]
  • 2.Adams R.A. 1975. Sobolev Spaces. [Google Scholar]
  • 3.Amoura K., Bernardi C., Saadi S. Mortar finite element discretization of the time dependent nonlinear Darcy's equations. Calcolo. 2016;53(4):597–619. [Google Scholar]
  • 4.Arbogast T., Estep D., Sheehan B., Tavener S. A posteriori error estimates for mixed finite element and finite volume methods for parabolic problems coupled through a boundary. SIAM/ASA J. Uncertain. 2015;3(1):169–198. [Google Scholar]
  • 5.Arbogast T., Cowsar L.C., Wheeler M.F., Yotov I. Mixed finite element methods on nonmatching multiblock grids. SIAM J. Numer. Anal. 2000;37(4):1295–1315. [Google Scholar]
  • 6.Arbogast T., Xiao H. Two-level mortar domain decomposition preconditioners for heterogeneous elliptic problems. Comput. Methods Appl. Mech. Eng. 2015;292:221–242. [Google Scholar]
  • 7.Arshad M. A priori error estimates of multiblock mortar expanded mixed method for elliptic problems. Appl. Numer. Math. 2020;157 [Google Scholar]
  • 8.Arshad M., Park E.-J., Shin D.W. Analysis of multiscale mortar mixed approximation of nonlinear elliptic equations. Comput. Math. Appl. 2018;75(2):401–418. [Google Scholar]
  • 9.Arshad M., Sana M., Mustahsan M. Multiblock mortar mixed approach for second order parabolic problems. Mathematics. 2019;7(4):325. [Google Scholar]
  • 10.Bear J. Courier Corporation; 2013. Dynamics of Fluids in Porous Media. [Google Scholar]
  • 11.Bernardi C., Maday Y., Patera A.T. A new nonconforming approach to domain decomposition: the mortar element method. Brezis H., Lions J.L., editors. Nonlinear Differ. Equ. Appl. 1994 Longman Scientific and Technical, UK. [Google Scholar]
  • 12.Brezzi F. On the existence, uniqueness and approximation of saddle-point problems arising from lagrangian multipliers. Publ. Math. Inf. Rennes. 1974;(S4):1–26. [Google Scholar]
  • 13.Brezzi F., Douglas J., Jr., Marini L.D. Two families of mixed finite elements for second order elliptic problems. Numer. Math. 1985;47(2):217–235. [Google Scholar]
  • 14.Brezzi F., Douglas J., Jr, Fortin M., Marini L.D. Efficient rectangular mixed finite elements in two and three space variables. RAIRO Modél. Math. Anal. Numér. 1987;21(4):581–604. [Google Scholar]
  • 15.Brezzi F., Fortin M. vol. 15. Springer-Verlag; New York: 1991. Mixed and Hybrid Finite Element Methods. (Springer Series in Computational Mathematics). [Google Scholar]
  • 16.Carstensen C., Kim D., Park E.-J. A priori and a posteriori pseudostress-velocity mixed finite element error analysis for the Stokes problem. SIAM J. Numer. Anal. 2011;49(6):2501–2523. [Google Scholar]
  • 17.Chen Y., Chen L., Zhang X. Two-grid method for nonlinear parabolic equations by expanded mixed finite element methods. Numer. Methods Partial Differ. Equ. 2013;29(4):1238–1256. [Google Scholar]
  • 18.Ciarlet P.G. vol. 4. North-Holland; Amsterdam: 1978. The Finite Element Method for Elliptic Problems. (Studies in Mathematics and Its Applications). [Google Scholar]
  • 19.Douglas J., Jr., Roberts J.E. Mixed finite element methods for second order elliptic problems. Mat. Apl. Comput. 1982;1(1):91–103. [Google Scholar]
  • 20.Douglas Jim, Jr., Roberts J.E. Global estimates for mixed methods for second order elliptic equations. Math. Comput. 1985;44(169):39–52. [Google Scholar]
  • 21.Dryja M., Smith B.F., Widlund O.B. Schwarz analysis of iterative substructuring algorithms for elliptic problems in three dimensions. SIAM J. Numer. Anal. 1994;31(6):1662–1694. [Google Scholar]
  • 22.Dryja M., Widlund O.B. Domain decomposition algorithms with small overlap. SIAM J. Sci. Comput. 1994;15(3):604–620. [Google Scholar]
  • 23.Durán R. Superconvergence for rectangular mixed finite elements. Numer. Math. 1990;58(1):287–298. [Google Scholar]
  • 24.Ewing R.E., Wang J. Analysis of mixed finite element methods on locally refined grids. Numer. Math. 1992;63:183–194. [Google Scholar]
  • 25.Ewing R.E., Lazarov R.D., Russell T.F., Vassilevski P.S. In: Doamin Decomposition Methods for PDEs. Chan T.F., Glowinski R., Periaux J., Widlund O.B., editors. SIAM; Philadelphia, PA, USA: 1990. Local refinement via domain decomposition techniques for mixed finite element methods with rectangular Raviart-Thomas elements; pp. 98–114. [Google Scholar]
  • 26.Ganis B., Vassilev D., Wang C., Yotov I. A multiscale flux basis for mortar mixed discretizations of Stokes–Darcy flows. Comput. Methods Appl. Mech. Eng. 2017;313:259–278. [Google Scholar]
  • 27.Gilbarg D., Trudinger N.S. Springer-Verlag; Berlin: 1983. Elliptic Partial Differential Equations of Second Order. [Google Scholar]
  • 28.Garcia S.M.F. Improved error estimates for mixed finite-element approximations for nonlinear parabolic equations: the continuous-time case. Numer. Methods Partial Differ. Equ. 1994;10(2):129–147. [Google Scholar]
  • 29.Glowinski R., Wheeler M.F. Domain decomposition and mixed finite element methods for elliptic problems. First International Symposium on Domain Decomposition Methods for Partial Differential Equations; Paris, 1987; Philadelphia, PA: SIAM; 1988. pp. 144–172. [Google Scholar]
  • 30.Grisvard P. Pitman; Boston: 1985. Elliptic Problems in Nonsmooth Domains. [Google Scholar]
  • 31.Gaiffe S., Glowinski R., Masson R. Domain decomposition and splitting methods for mortar mixed finite element approximations to parabolic equations. Numer. Math. 2002;93:53–75. [Google Scholar]
  • 32.Gatica G.N., Baier R.R., Tierra G. A mixed finite element method for Darcy's equations with pressure dependent porosity. Math. Comput. 2016;85(297):1–33. [Google Scholar]
  • 33.Hou T., Chen L., Yang Y., Yang Y. Two-grid Raviart-Thomas mixed finite element methods combined with Crank-Nicolson scheme for a class of nonlinear parabolic equations. Adv. Comput. Math. 2020;46(2):1–24. [Google Scholar]
  • 34.Kim D., Park E.-J. A posteriori error estimator for expanded mixed hybrid methods. Numer. Methods Partial Differ. Equ. 2007;23(2):330–349. [Google Scholar]
  • 35.Kim D., Park E.-J. A priori and a posteriori analysis of mixed finite element methods for nonlinear elliptic equations. SIAM J. Numer. Anal. 2010;48(3):1186–1207. [Google Scholar]
  • 36.Kim M.-Y., Park E.-J., Thomas S.G., Wheeler M.F. A multiscale mortar mixed finite element method for slightly compressible flows in porous media. J. Korean Math. Soc. 2007;44(5):1103–1119. [Google Scholar]
  • 37.Kieu T. A mixed finite element approximation for Darcy–Forchheimer flows of slightly compressible fluids. Appl. Numer. Math. 2017;120:141–164. [Google Scholar]
  • 38.Lions J.-L., Magenes E. Springer-Verlag; New York-Heidelberg: 1972. Non-Homogeneous Boundary Value Problems and Applications, vol. 1. [Google Scholar]
  • 39.Mathew T.P. Courant Institute of Mathematical Sciences; 1989. Domain decomposition and iterative refinement methods for mixed finite element discretisations of elliptic problems. PhD thesis. Tech. Rep. 463. [Google Scholar]
  • 40.Milner F.A. Mixed finite element methods for quasilinear second-order elliptic problems. Math. Comput. 1985;44(170):303–320. [Google Scholar]
  • 41.Milner F.A., Park E.-J. A mixed finite element method for a strongly nonlinear second-order elliptic problem. Math. Comput. 1995;64(211):973–988. [Google Scholar]
  • 42.Masud A., Hughes T.J.R. A stabilized mixed finite element method for Darcy flow. Comput. Methods Appl. Mech. Eng. 2002;191:4341–4370. [Google Scholar]
  • 43.Nédélec J.-C. Mixed finite elements in R3. Numer. Math. 1980;35(3):315–341. [Google Scholar]
  • 44.Park E.-J. Mixed finite element methods for nonlinear second-order elliptic problems. SIAM J. Numer. Anal. 1995;32(3):865–885. [Google Scholar]
  • 45.Park E.J. Mixed finite element methods for generalized Forchheimer flow in porous media. Numer. Methods Partial Differ. Equ. 2005;21(2):213–228. [Google Scholar]
  • 46.Pencheva G., Yotov I. Balancing domain decomposition for mortar mixed finite element methods. Numer. Linear Algebra Appl. 2003;10(1–2):159–180. [Google Scholar]
  • 47.Pencheva G., Vohralik M., Wheeler M.F., Wildey T. Robust a posteriori error control and adaptivity for multiscale, multinumerics, and mortar coupling. SIAM J. Numer. Anal. 2013;51(1):526–554. [Google Scholar]
  • 48.Peszyńska M., Wheeler M.F., Yotov I. Mortar upscaling for multiphase flow in porous media. Comput. Geosci. 2002;6:73–100. [Google Scholar]
  • 49.Raviart P.-A., Thomas J.M. Mathematical Aspects of Finite Element Methods. vol. 606. Springer-Verlag; New York: 1977. A mixed finite element method for 2nd order elliptic problems; pp. 292–315. (Lecture Notes in Math.). [Google Scholar]
  • 50.Roberts J.E., Thomas J.-M. Handbook of Numerical Analysis, Vol. II. vol. II. North-Holland; Amsterdam: 1991. Mixed and hybrid methods; pp. 523–639. (Handb. Numer. Anal.). [Google Scholar]
  • 51.Sun T., Mehmani Y., Bhagmane J., Balhoff M.T. Pore to continuum upscaling of permeability in heterogeneous porous media using mortars. Int. J. Oil Gas Coal Technol. 2012;5:249–266. [Google Scholar]
  • 52.Wheeler M.F., Yotov I.P. A posteriori error estimates for the mortar mixed finite element method. SIAM J. Numer. Anal. 2005;43(3):1021–1042. [Google Scholar]
  • 53.Wheeler M.F., Yotov I. Multigrid on the interface for mortar mixed finite element methods for elliptic problems. Comput. Methods Appl. Mech. Eng. 2000;184:287–302. [Google Scholar]
  • 54.Yotov I.P. 1996. Mixed finite element methods for flow in porous media. PhD thesis, Rice University, Houston, Texas, 1996, TR96-09, Dept. Comp. Appl. Math., Rice University and TICAM report 96-23, University of Texas at Austin. [Google Scholar]

Articles from Heliyon are provided here courtesy of Elsevier

RESOURCES