• Tidak ada hasil yang ditemukan

Decoupling and linearization by two-level and multi-level algorithms

Dalam dokumen 12.2% 171000 190M TOP 1% 154 6300 (Halaman 42-46)

TOP 1%

2. Decoupled algorithms for the coupled models of fluid flow interacting with porous flow

2.3 Decoupling and linearization by two-level and multi-level algorithms

For the mixed Stokes/Darcy model, Mu and Xu in [11] propose a two-grid method in which the coarse grid solution is used to supplement the boundary conditions at the

interface for both of the two subproblems. TheTwo-grid Algorithmproposed in [11]

is composed by the following two steps.

1.Solve the linear part of problem 2:7ð ÞHon a coarse grid: find uH ¼ðuH,ϕHÞ∈XHXh,pHQHQh such that

a uð H,vHÞ þb v H,pH

¼ðf,vHÞ, ∀vH¼ðvH,ψHÞ∈XH, b u H,qH

¼0, ∀qHQH; (

(25)

2.Solve a modified fine grid problem: finduH ¼uh,ϕh

Xh,phQh such that a u H,vh

þb v h,ph

¼ðf,vhÞ aΓðuH,vhÞ, ∀vhXh, b u H,qh

¼0, ∀qhQh: (

(26) The main theoretical results for the two grid algorithm are as follows.

Theorem 1.Let u h,ph

be the solution of coupled Stokes/Darcy model, and u H,ph be defined by and (27) on the fine grid. The following error estimates hold:

ϕh ϕh

HpH2, (27) uh uh

HfH3=2, (28) ph ph

QH3=2: (29)

Based on this algorithm, some other improvements have been made. For example, in [18–20], by sequentially solving the Stokes submodel and the Darcy submodel, the authors can makeϕh ϕh

Hp,uh uh

Hf, andph ph

Q

are all of orderH2. Furthermore, Hou constructed a new auxiliary problem [16]

for the Darcy submodel, and proved that Mu and Xu’s two-grid algorithm can retainuh uh

Hf andph ph

Q order ofH2. It is remarkable that Mu and Xu’s two-grid algorithm is naturally parallel and of optimal order, ifhis of orderH2.

The extension to a multilevel decoupled algorithm can be found in [26]. The Multilevel Algorithmis as follows:

h DOF N Ið Þ N Pð Þ N Pð T1Þ

2 2 268 186 41 20

2 3 948 432 45 22

2 4 3556 ∗ ∗ 48 22

2 5 13,764 ∗ ∗ 46 22

2 6 54,148 ∗ ∗ 46 22

Table 1.

Number of iterations for the GMRES method without and with the two preconditioners P and PT1.

1.Solve the linear part of problem 2:7ð ÞHon a coarse grid: finduH ¼ uH,ϕH

ð Þ∈XHXh,pHQHQh such that a uð H,vHÞ þb v H,pH

¼f vð ÞH ,∀vH¼ðvH,ψHÞ∈XH, b u H,qH

¼0,∀qHQH; (

(30)

2.Seth0 ¼H, for j = 1 toL, finduhj ¼uhj,ϕhj

Xhj,phjQhj such that a u hj,vhj

þb v hj,phj

¼f v hj

aΓuhj 1,vhj

, ∀vhjXhj, b u hj,qhj

¼0, ∀qhjQhj: 8

><

>:

(31)

end.

In our multilevel algorithm, we refine the grid step by step, the coupled problem is only solved on the coarsest mesh, and linear decoupled subproblems are solved in parallel on successively refined meshes. We see that the algorithm is very effective and efficient. Moreover, the theory of the two grid algorithm guarantees that the approximation properties are good. As an illustration of the effectiveness of the multilevel algorithm [41], we present numerical results inTable 2.

In the following, we use steady state NS/Darcy model to illustrate how to apply two-level and multilevel methods to decouple the coupled nonlinear PDE models. The algorithm combines the two-level algorithms and the Newton-type linearization [4, 36, 42]. OurNewton Type Linearization Based Two-level Algorithmconsists of the following three steps [17, 43].

1.Solve the coupled problem (19) on a coarse grid triangulation with the meshsize H: FinduH ¼ðuH,ϕHÞ∈XHandpHQHsuch that

a uð H,vHÞ þcðuH,uH,vHÞ þbvH,pH

¼f vð ÞH , ∀vH ¼ðvH,ψHÞ∈XH, buH,qH

¼0, ∀qHQH: (

(32)

2.On a fine grid triangulation with the meshsizehH, sequentially solve two decoupled and linearized local subproblems:

h ϕh ϕ

1 uh u

1 vh v

1 ph p

0

2 1 4:59210 2 1:55010 1 1:06610 1 8:41010 2

2 2 1:15210 2 3:95810 2 2:66410 2 1:75210 2

2 4 7:28010 4 2:46610 3 1:65210 3 1:04010 3

2 8 5:29610 6 9:98110 6 7:92210 6 1:69410 5

Table 2.

Errors between the solutions of multilevel algorithm and the exact solutions (second order discretization).

Step a. Solve a discrete Darcy problem inΩp: FindϕhXp,h such that apϕh,ψh

¼ρg f p,ψh

ΩpþρguHnf,ψh

ΓψhXp,h: (33) Step b. Solve a modified Navier–Stokes model using the Newton type linearization:

FinduhXf,h andphQh such that afuh,vh

þcuH,uh,vh

þcuh,uH,vh

þbvh,ph

¼ff,vh

Ωf

ρgϕh,vhnf

ΓþcðuH,uH,vhÞ ∀vhXf,h, buh,qh

¼0 ∀qhQh: 8

>>

><

>>

>:

(34)

3. On the same fine grid triangulation, solve two subproblems by using the newly obtained solution.

Step a. Solve a discrete Darcy problem inΩp: FindϕhXp,h such that apϕh,ψh

¼ρg f p,ψh

Ωp þρguh nf,ψh

ΓψhXp,h: (35) Step b. Correct the solution of the fluid flow model: FinduhXf,handphQh such that

afuh,vh

þcuH,uh,vh

þcuh,uH,vh

þbvh,ph

¼ff,vh

Ωf

ρgϕh,vh nf

ΓþcuH,uh,vh

þcuh,uH uh,vh

vhXf,h, buh,qh

¼0 ∀qhQh: 8

>>

><

>>

>:

(36)

We remark here that the problem (36) and the problem (34) differ only in the right hand side. Similarly, the problem (35) and the problem (33) have the same stiffness matrix. In sum, the advantages of our work exist in that the scaling between the two meshsizes is better, the algorithm is decoupled and linear on the fine grid level and the two submodels in the last two steps share the same stiffness matrices.

For the coupled problem (19), by using the properties (16)–(18), the error esti- mates in the energy norm can be derived by using a fixed-point framework [4, 31].

Moreover, the Aubin-Nitsche duality argument can result in theL2error analysis of the problem (19). In summary, we have.

Lemma 1.Letðu,ϕ,pÞ∈Hkþ1Ωf

Hkþ1Ωp

HkΩf

be the solution of the Navier–Stokes/Darcy model (13) anduh,ϕh,ph

be the FE solution of (19). We assume thatνis sufficiently large and h is sufficiently small. There holds the following energy norm estimate for the problem (19).

u uh

j j1,Ωf þjϕ ϕhj1,Ωp þ∥p ph0,Ωfhk: (37) Moreover, we have the followingL2error estimate:

u uh0,Ωf þ∥ϕ ϕh0,Ωphkþ1: (38)

The energy norm estimate (37) is the Lemma 2 in [4]. TheL2 error estimate (38) corresponds to the Lemma 3 in [4]. Detailed proofs of these results can be found in [4].

The following lemma concludes the error estimate ofϕh,uh,ph

in the energy norm.

Lemma 2.(Error analysis of the intermediate step two-level solution) Let ϕ,u,p

ð Þandϕh,uh,ph

be defined by the problems (13) and (33)–(34), respectively.

Under the assumptions of Lemma 1, there holds ϕ ϕh

1,ΩpHkþ1þhk, (39) u uh

1,Ωf þ∥p ph0,ΩfHkþ1þhk: (40)

u uh0,ΩfH2kþ1þHkþ1hþhkþ1: (41) From Lemma 1, we note that the optimal finite element solution error in the energy norm is of orderO h k

. Combining the conclusions of this Lemma, we see that the intermediate step two-level solution error is still optimal in the energy norm if the scaling between the two meshsizes is taken to beh¼Hkþ1k . TheL2error analysis is extended from [4, 20, 31, 37]. Letuandϕbe the nonsingular solution of (13). From Lemma 1, the optimalL2error for the finite element solution is of orderO h kþ1

. To make sure∥u uh0,Ωf is also of orderO h kþ1

, the scaling between the two grids has to be taken ash¼ maxnHkþ1k ,H2kþ1kþ1o

. For instance, ifk¼1, we have to seth¼H32 to make sure theL2error ofuh is optimal. We now show that the final step two-level solution is indeed a good approximation to the solution of problem (13) .

Theorem 2.(Error analysis of the final step two-level solution) Letðϕ,u,pÞand ϕh,uh,ph

be the solutions of (13) and (35)–(36) respectively. Under the assumptions of Lemma 1, the following error estimates hold:

ϕ ϕh

1,Ωp þu uh

1,Ωf þ∥p ph0,ΩfH2kþ1þHkþ1hþhk, (42) Proposition 1.Letðϕ,u,pÞandϕh,uh,ph

be the solutions of (13) and (35)–(36) respectively. If we take h¼H2kþ1k for k ¼1, 2and h¼Hkþ1k 1 for k≥3, then there holds the following error estimate.

ϕ ϕh

1,Ωp þu uh

1,Ωf þ∥p ph0,Ωfhk: (43) Finally, we would like to make some comments on the mixed Stokes/Darcy model.

We note that by dropping those trilinear terms (32), (34) and (36), our two-level algorithm can be naturally applied to the coupled Stokes/Darcy model. We note that the above algorithms can be naturally extended to multi-level algorithms by recursively calling the above two-level algorithms [17, 43]. The extension and the corresponding analysis can be found in [26, 43].

Dalam dokumen 12.2% 171000 190M TOP 1% 154 6300 (Halaman 42-46)