Partial Differential Equations - Modelling and ... - ResearchGate
Partial Differential Equations - Modelling and ... - ResearchGate Partial Differential Equations - Modelling and ... - ResearchGate
A Lagrange Multiplier Based Domain Decomposition Method 137 Denote by u 1 , u 2 and λ the vectors of the nodal values of the corresponding functions u 1h , u 2h and λ h . Then, in order to find u n+1 1 , u n+1 2 and λ n+1 for a fixed time t n+1 , we have to solve a system of linear equations such as Au + B T λ = F, (11) Bu =0, (12) where matrix A is diagonal, positive definite and defined by √ (Au, w) = ε 1 ∆t 2 S 1(u 1h w 1h )+ 1 ∆t 2 S 2(ε(x)u 2h w 2h )+ and where the rectangular matrix B is defined by ∫ (Bu, λ) = λ h (u 2h − u 1h )dΓ, γ ε 1 µ −1 1 S Γext (u 1h w 1h ), 2∆t and vector F depends on the nodal values of the known functions u n 1h , un 2h , u n−1 1h and u n−1 2h . Eliminating u from the equation (11), we obtain BA −1 B T λ = BA −1 F, (13) with a symmetric matrix C ≡ BA −1 B T . Let us prove that C is positive definite. Obviously, ker C =kerB T . Suppose, that B T λ = 0, then a function λ h ∈ Λ h corresponding to vector λ satisfies ∫ I ≡ λ h u h dγ =0 γ for all u h ∈ V 1h . Choose u h equal to λ h in the nodes of T 1h located on γ. Direct calculations give I = 1 ∑N λ [ hi + h i+1 λ 2 (λ i + λ i+1 ) 2 ] i + h i+1 , 2 2 2 i=1 where N λ is the number of edges of T 1h on γ, h i is the length of i-th edge and h Nλ +1 ≡ h 1 , λ Nλ +1 ≡ λ 1 . Thus, the equality I = 0 implies that λ = 0, i.e. ker B T = {0}. As a consequence we have Theorem 2. The problem (9), (10) has a unique solution (u h ,λ h ). Remark 3. A closely related domain decomposition method applied to the solution of linear parabolic equations is discussed in [Glo03].
138 S. Lapin et al. 4 Energy Inequality Theorem 3. Let h min denote the minimal diameter of the triangles from T 1h ∪ T 2h . There exists a positive number c such that the condition ∆t ≤ c min{ √ ε 1 µ 1 , √ ε 2 µ 2 } h min (14) ensures the positive definiteness of the quadratic form ( (u E n+1 = 1 n+1 2 ε 1h 1S 1 ∆t ( ∣ + 1 2 S 1 ( − ∆t2 8 S 1 µ −1 1 µ −1 1 ( u n+1 ∣ ∇ 1h 2 ( u n+1 ∣ ∇ 1h ∆t − un 1h + un 1h − un 1h )2 ) ( + 1 ( u n+1 2 S 2h 2 ε ∆t )∣ ∣∣∣ 2 ) ( + 1 ∣ ∣∣∣ 2 S 2 µ −1 ∇ )∣ ∣∣∣ 2 ) ( ∣ − ∆t2 ∣∣∣ 8 S 2 µ −1 ∇ which we call the discrete energy. The system (9), (10) satisfies the energy identity √ ε 1 µ −1 E n+1 −E n 1 + S Γext ((u n+1 1h 4∆t − un−1 1h )2 )= = 1 2 S 1(f n 1 (u n+1 1h − un 2h ( u n+1 2h ( u n+1 2h − un−1 1h )) + 1 2 S 2(f2 n (u n+1 2h )2 ) + + un 2h 2 − un 2h ∆t )∣ ∣∣∣ 2 ) − )∣ ∣∣∣ 2 ) , (15) − un−1 2h )) (16) and the numerical scheme is stable: There exists a positive number M = M(T ) such that n−1 ∑ E n ≤ M∆t (S 1 ((f1 k ) 2 )+S 2 ((f2 k ) 2 )), ∀n. (17) γ k=1 Proof. Let n ≥ 1. From the equation (10) written for t n+1 and t n−1 we obtain ∫ ζ h ((u n+1 2h − un−1 2h ) − (un+1 1h − un−1 1h ))dγ = 0 for all ζ h ∈ Λ h . (18) Choosing in (9) and w 1h = un+1 1h − un−1 1h , w 2h = un+1 2h 2 ζ h = − λn+1 h 2 in (18), we add these equalities. Using the identities − un−1 2h 2
- Page 91 and 92: Optimal Higher Order Time Discretiz
- Page 93 and 94: Optimal Higher Order Time Discretiz
- Page 95 and 96: Optimal Higher Order Time Discretiz
- Page 97 and 98: Optimal Higher Order Time Discretiz
- Page 99 and 100: Optimal Higher Order Time Discretiz
- Page 101 and 102: Optimal Higher Order Time Discretiz
- Page 103 and 104: 96 I. Sazonov et al. To provide a p
- Page 105 and 106: 98 I. Sazonov et al. In the first s
- Page 107 and 108: 100 I. Sazonov et al. Fig. 1. An ex
- Page 109 and 110: 102 I. Sazonov et al. H z 1 exact F
- Page 111 and 112: 104 I. Sazonov et al. (a) (b) Fig.
- Page 113 and 114: 106 I. Sazonov et al. Scattering Wi
- Page 115 and 116: 108 I. Sazonov et al. 6.4 Scatterin
- Page 117 and 118: 110 I. Sazonov et al. (a) (b) Fig.
- Page 119 and 120: 112 I. Sazonov et al. [MHP96] K. Mo
- Page 121 and 122: 114 R. Sanders and A.M. Tesdall I R
- Page 123 and 124: 116 R. Sanders and A.M. Tesdall imp
- Page 125 and 126: 118 R. Sanders and A.M. Tesdall alo
- Page 127 and 128: 120 R. Sanders and A.M. Tesdall (a)
- Page 129 and 130: 122 R. Sanders and A.M. Tesdall D C
- Page 131 and 132: 124 R. Sanders and A.M. Tesdall 8.6
- Page 133 and 134: 126 R. Sanders and A.M. Tesdall 0.3
- Page 135 and 136: 128 R. Sanders and A.M. Tesdall [TR
- Page 137 and 138: 132 S. Lapin et al. Ω R γ Ω 2 Γ
- Page 139 and 140: 134 S. Lapin et al. ∫ ∂ 2 ∫
- Page 141: 136 S. Lapin et al. Ω R γ Fig. 3.
- Page 145 and 146: 140 S. Lapin et al. 5 Numerical Exp
- Page 147 and 148: 142 S. Lapin et al. Fig. 6. Contour
- Page 149 and 150: 144 S. Lapin et al. Fig. 9. Obstacl
- Page 151 and 152: Domain Decomposition and Electronic
- Page 153 and 154: Domain Decomposition Approach for C
- Page 155 and 156: Domain Decomposition Approach for C
- Page 157 and 158: Domain Decomposition Approach for C
- Page 159 and 160: Domain Decomposition Approach for C
- Page 161 and 162: Domain Decomposition Approach for C
- Page 163 and 164: Domain Decomposition Approach for C
- Page 165 and 166: Domain Decomposition Approach for C
- Page 167 and 168: Domain Decomposition Approach for C
- Page 169 and 170: Numerical Analysis of a Finite Elem
- Page 171 and 172: Numerical Analysis of a Finite Elem
- Page 173 and 174: Numerical Analysis of a Finite Elem
- Page 175 and 176: Numerical Analysis of a Finite Elem
- Page 177 and 178: Numerical Analysis of a Finite Elem
- Page 179 and 180: Numerical Analysis of a Finite Elem
- Page 181 and 182: so that |u| 2 1,ω h ≤ 2 Numerica
- Page 183 and 184: Numerical Analysis of a Finite Elem
- Page 185 and 186: Numerical Analysis of a Finite Elem
- Page 187 and 188: Numerical Analysis of a Finite Elem
- Page 189 and 190: 188 A. Bonito et al. of the model a
- Page 191 and 192: 190 A. Bonito et al. Fig. 1. The sp
A Lagrange Multiplier Based Domain Decomposition Method 137<br />
Denote by u 1 , u 2 <strong>and</strong> λ the vectors of the nodal values of the corresponding<br />
functions u 1h , u 2h <strong>and</strong> λ h . Then, in order to find u n+1<br />
1 , u n+1<br />
2 <strong>and</strong> λ n+1 for a<br />
fixed time t n+1 , we have to solve a system of linear equations such as<br />
Au + B T λ = F, (11)<br />
Bu =0, (12)<br />
where matrix A is diagonal, positive definite <strong>and</strong> defined by<br />
√<br />
(Au, w) = ε 1<br />
∆t 2 S 1(u 1h w 1h )+ 1<br />
∆t 2 S 2(ε(x)u 2h w 2h )+<br />
<strong>and</strong> where the rectangular matrix B is defined by<br />
∫<br />
(Bu, λ) = λ h (u 2h − u 1h )dΓ,<br />
γ<br />
ε 1 µ −1<br />
1<br />
S Γext (u 1h w 1h ),<br />
2∆t<br />
<strong>and</strong> vector F depends on the nodal values of the known functions u n 1h , un 2h ,<br />
u n−1<br />
1h<br />
<strong>and</strong> u n−1<br />
2h .<br />
Eliminating u from the equation (11), we obtain<br />
BA −1 B T λ = BA −1 F, (13)<br />
with a symmetric matrix C ≡ BA −1 B T . Let us prove that C is positive<br />
definite. Obviously, ker C =kerB T . Suppose, that B T λ = 0, then a function<br />
λ h ∈ Λ h corresponding to vector λ satisfies<br />
∫<br />
I ≡ λ h u h dγ =0<br />
γ<br />
for all u h ∈ V 1h . Choose u h equal to λ h in the nodes of T 1h located on γ.<br />
Direct calculations give<br />
I = 1 ∑N λ<br />
[<br />
hi + h i+1<br />
λ 2 (λ i + λ i+1 ) 2 ]<br />
i + h i+1 ,<br />
2 2<br />
2<br />
i=1<br />
where N λ is the number of edges of T 1h on γ, h i is the length of i-th edge <strong>and</strong><br />
h Nλ +1 ≡ h 1 , λ Nλ +1 ≡ λ 1 . Thus, the equality I = 0 implies that λ = 0, i.e.<br />
ker B T = {0}.<br />
As a consequence we have<br />
Theorem 2. The problem (9), (10) has a unique solution (u h ,λ h ).<br />
Remark 3. A closely related domain decomposition method applied to the<br />
solution of linear parabolic equations is discussed in [Glo03].