Partial Differential Equations - Modelling and ... - ResearchGate
Partial Differential Equations - Modelling and ... - ResearchGate Partial Differential Equations - Modelling and ... - ResearchGate
and (u n+1 ih A Lagrange Multiplier Based Domain Decomposition Method 139 − 2u n ih + u n−1 ih )(un+1 ih u n ihu n+1 ih − u n−1 ih )=(un+1 ih − u n ih) 2 − (u n ih − u n−1 ih )2 = 1 4 ((un+1 ih + u n ih) 2 − (u n+1 ih − u n ih) 2 ), after several technical transformations we obtain √ ε 1 µ −1 E n+1 −E n 1 + S Γext ((u n+1 1h 4∆t − un−1 1h )2 )= 1 2 S 1(f1 n (u n+1 1h − un−1 1h )) + 1 2 S 2(f2 n (u n+1 2h − un−1 2h )). Therefore, E n+1 ≤E n + 1 ( [ 2 ∆tS1/2 1 (f n 1 ) 2) S 1/2 1 +S 1/2 1 ( (u n+1 1h − un 1h ∆t ( (u n+1 1h − un 1h ∆t )2 )] + 1 ( [ 2 ∆tS1/2 2 (f n 2 ) 2) S 1/2 2 +S 1/2 2 ( (u n+1 2h )2 ) + ( (u n+1 2h − un 2h ∆t − un 2h ∆t )2 ) + )2 )] . (19) Now, we will show that under the condition (14) the quadratic form E n is positive definite; more precisely, that there exists a positive constant δ such that ( ( (u n+1 E n 1h ≥ δ S − )2 ) ( (u un n+1 1h 2h 1 + S − )2 )) un 2h 2 . (20) ∆t ∆t Obviously, it is sufficient to prove the inequality 4ε e µ e S e (vh) 2 ≥ ∆t 2 S e (|∇v h | 2 ) ∀e ∈T 1h ∪T 2h , ∀v h ∈ P 1 (e), (21) where ε e and µ e are defined by ε e = ε 1 or ε e = ε 2 (respectively, µ e = µ 1 or µ e = µ 2 ). It is known that for a regular triangulation S e (|∇v h | 2 ) ≤ 1/c 2 1h −2 e S e (vh) 2 (22) with a positive constant c 1 , universal for all triangles e,whereh e is the minimal length of the sides of e. Combining (21) and (22), we observe that the time step ∆t should satisfy the inequality ∆t ≤ c √ ε e µ e h e , (c = √ 2c 1 ), (23) for all e ∈T 1h ∪T 2h . Evidently, (14) ensures the validity of (23). Further, using the relation (20), E 1 = 0 and summing the inequalities (19), one obtains the stability inequality (17): n−1 ∑ E n ≤ M∆t (S 1 ((f1 k ) 2 )+S 2 ((f2 k ) 2 )), ∀n. k=1
140 S. Lapin et al. 5 Numerical Experiments In order to solve the system of linear equations (11)–(12) at each time step we use a Conjugate Gradient Algorithm in the form given by Glowinski and LeTallec [GL89]: Step 1. λ 0 given. Step 2. Au 0 = F − Bλ 0 . Step 3. g 0 = −B T u 0 . Step 4. If ‖g 0 ‖≤ε 0 take λ = λ 0 , else w 0 = g 0 . Step 5. For m ≥ 0, assuming that λ m , g m , w m are known, Aū m = Bw m . ḡ m = B T ū m . ρ m = |gm | 2 (ḡ m , ¯w m ) . λ m+1 = λ m − ρ m w m . u m+1 = u m + ρ m¯v m . g m+1 = g m − ρ m ḡ m . Step 6. If gm+1 · g m+1 g 0 · g 0 ≤ ε then take λ = λ m+1 , else γ m = gm+1 · g m+1 g m · g m . Step 7. w m+1 = g m+1 + γ m w m . Step 8. Do m = m +1andgotoStep5. We consider the problem (9)–(10) with a source term given by the harmonic planar wave u inc = −e ik(t−α·x) , (24) where {x j } 2 j=1 , {α j} 2 j=1 , k is the angular frequency and |α| =1. For our numerical simulation we consider two cases: the first with the frequency of the incident wave f =0.6 GHz and the second with f =1.2 GHz, which gives us wavelengths L =0.5 meters and L =0.25 meters, respectively. We performed a series of numerical experiments: scattering by a perfectly reflecting obstacle, wave propagation through a domain with an obstacle completely consisting of a coating material and scattering by an obstacle with coating. First, we consider the scattering by a perfectly reflecting obstacle. For the experiment we have chosen Ω 2 to be in a form of a perfectly reflecting airfoil, and Ω is a 2 meter × 2 meter rectangle. We used a finite element mesh with 8019 nodes and 15324 elements in the case of f =0.6 GHz (Fig. 4) and 19246 nodes and 37376 elements for f =1.2 GHz. Figure 5 shows the contour plot for the case when the incident wave is coming from the left and Figure 6 shows the case when the incident wave is coming from the lower left corner with an angle of 45 ◦ . For all the experiments
- 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 and 142: 136 S. Lapin et al. Ω R γ Fig. 3.
- Page 143: 138 S. Lapin et al. 4 Energy Inequa
- 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
- Page 193 and 194: 192 A. Bonito et al. 3 1 16 4 1 1 1
<strong>and</strong><br />
(u n+1<br />
ih<br />
A Lagrange Multiplier Based Domain Decomposition Method 139<br />
− 2u n ih + u n−1<br />
ih<br />
)(un+1 ih<br />
u n ihu n+1<br />
ih<br />
− u n−1<br />
ih<br />
)=(un+1 ih<br />
− u n ih) 2 − (u n ih − u n−1<br />
ih )2<br />
= 1 4 ((un+1 ih<br />
+ u n ih) 2 − (u n+1<br />
ih<br />
− u n ih) 2 ),<br />
after several technical transformations we obtain<br />
√<br />
ε 1 µ −1<br />
E n+1 −E n 1<br />
+ S Γext ((u n+1<br />
1h<br />
4∆t<br />
− un−1 1h )2 )=<br />
1<br />
2 S 1(f1 n (u n+1<br />
1h<br />
− un−1 1h )) + 1 2 S 2(f2 n (u n+1<br />
2h<br />
− un−1 2h )).<br />
Therefore,<br />
E n+1 ≤E n + 1 ( [<br />
2 ∆tS1/2 1 (f<br />
n<br />
1 ) 2) S 1/2<br />
1<br />
+S 1/2<br />
1<br />
( (u<br />
n+1<br />
1h<br />
− un 1h<br />
∆t<br />
( (u<br />
n+1<br />
1h<br />
− un 1h<br />
∆t<br />
)2 )] + 1 ( [<br />
2 ∆tS1/2 2 (f<br />
n<br />
2 ) 2) S 1/2<br />
2<br />
+S 1/2<br />
2<br />
( (u<br />
n+1<br />
2h<br />
)2 ) +<br />
( (u<br />
n+1<br />
2h<br />
− un 2h<br />
∆t<br />
− un 2h<br />
∆t<br />
)2 ) +<br />
)2 )] . (19)<br />
Now, we will show that under the condition (14) the quadratic form E n is<br />
positive definite; more precisely, that there exists a positive constant δ such<br />
that<br />
( ( (u<br />
n+1<br />
E n 1h<br />
≥ δ S − )2 ) ( (u un n+1<br />
1h<br />
2h<br />
1 + S − )2 ))<br />
un 2h<br />
2 . (20)<br />
∆t<br />
∆t<br />
Obviously, it is sufficient to prove the inequality<br />
4ε e µ e S e (vh) 2 ≥ ∆t 2 S e (|∇v h | 2 ) ∀e ∈T 1h ∪T 2h , ∀v h ∈ P 1 (e), (21)<br />
where ε e <strong>and</strong> µ e are defined by ε e = ε 1 or ε e = ε 2 (respectively, µ e = µ 1 or<br />
µ e = µ 2 ). It is known that for a regular triangulation<br />
S e (|∇v h | 2 ) ≤ 1/c 2 1h −2<br />
e S e (vh) 2 (22)<br />
with a positive constant c 1 , universal for all triangles e,whereh e is the minimal<br />
length of the sides of e. Combining (21) <strong>and</strong> (22), we observe that the time<br />
step ∆t should satisfy the inequality<br />
∆t ≤ c √ ε e µ e h e , (c = √ 2c 1 ), (23)<br />
for all e ∈T 1h ∪T 2h . Evidently, (14) ensures the validity of (23).<br />
Further, using the relation (20), E 1 = 0 <strong>and</strong> summing the inequalities (19),<br />
one obtains the stability inequality (17):<br />
n−1<br />
∑<br />
E n ≤ M∆t (S 1 ((f1 k ) 2 )+S 2 ((f2 k ) 2 )), ∀n.<br />
k=1