Partial Differential Equations - Modelling and ... - ResearchGate
Partial Differential Equations - Modelling and ... - ResearchGate Partial Differential Equations - Modelling and ... - ResearchGate
168 B. Maury 1 ε Ψ(x) −→ I K(x) as ε goes to 0, ∀x ∈ X. If J ε admits a minimum u ε , for any ε, one can expect u ε to approach a (or the) minimum of J over K, if it exists. In actual Finite Element computations, some u ε h is computed as the solution to a finite dimensional problem, where h is a space-discretization parameter. The present work is motivated by the fact that, even if the penalty method for the continuous problem is convergent and the discretization procedure is sound, the rate of convergence of u ε h toward the exact solution is not straightforward to obtain. To our knowledge, the first paper dedicated to the analysis of the penalty method in the Finite Element context dates back to 1973 (see [Bab73]), where this method was used to incorporate Dirichlet boundary conditions in some variants of the Finite Element Method. Since then, this strategy has been followed to integrate obstacles in fluid flow simulations [ABF99], to model the rigidity constraint [JLM05]. The present work is motivated by the handling of rigid particles in a fluid flow. Various approaches have been proposed to incorporate rigid bodies in a Stokes or Navier–Stokes fluid: arbitrary Lagrangian Eulerian approach [JT96, Mau99], fictitious domain approach [PG02]. More recently, a strategy based on augmented Lagrangian principles was proposed to handle a large class of multimaterial flows [VCLR04, RPVC05]. In [JLM05], we tested the raw penalty method to handle the rigidity constraint in a viscous fluid. This approach is not sophisticated: it simply consists in adding to the variational formulation the term ∫ 1 ( ∇u + ∇ T u ) : ( ∇v + ∇ T v ) . ε Ω It presents some drawbacks: as it is based on pure penalty and not augmented Lagrangian, the penalty parameter has to be taken very small for the constraint to be fulfilled properly, which may harm the conditioning of the system to solve. Yet, it shows itself to be robust in practice, it allows the use of non-boundary-fitted (e.g., Cartesian) meshes. Besides, it is straightforward to implement, so that a full Navier–Stokes solver (in 2D) with circular rigid particles can be written in about 50 lines, by using, for example, FreeFem++ (created by O. Pironneau, see [FFp]). Note that new tools for 3D problems are already available (see, e.g., [ff3, DPP03] or [lif]), which enable to perform computations of three dimensional fluid-particle flows. We shall actually focus here on a simpler problem (see the problem (8)), which is a scalar version of the rigidity constraint. The fluid velocity is indeed replaced by a temperature field, and the rigid particle is replaced by a zone with infinite conductivity. The Lagrange multiplier can be interpreted in this context as a heat source term (see Remark 6). We begin by presenting some standard properties of the penalty method for quadratic optimization (Section 2.1), and some convergence results. Then
Numerical Analysis of a Finite Element/Volume Penalty Method 169 we present the model problem, describe how we penalize and discretize it, and we show how the abstract framework applies to this situation. We finish by presenting an error estimate for the primal and dual components of the solutions, in terms of the quantities ε (the penalty parameter) and h (the mesh step size), whose proof is postponed to another paper. 2 Preliminaries, Abstract Framework 2.1 Continuous Problem We recall here some standard properties concerning the penalty method applied to infinite dimensional problems. Most of those properties are established in [BF91], with a slightly different formalism. We shall consider the following set of assumptions: ⎫ V is a Hilbert space, ϕ ∈ V ′ , a(·, ·) bilinear, symmetric, continuous, elliptic (a(v, v) ≥ α |v| 2 ), b(·, ·) bilinear, symmetric, continuous, non-negative, ⎪⎬ K = {u ∈ V | b(u, u) =0} =kerb, (1) J(v) = 1 a(v, v) −〈ϕ, v〉, 2 u =argmin K J, J ε (v) = 1 2 a(v, v)+ 1 b(v, v) −〈ϕ, v〉, 2ε uε =argmin V J ε. ⎪⎭ Proposition 1. Under the assumptions (1), the solution u ε to the penalized problem converges to u. Proof. We write the variational formulation for the penalized problem: Taking v = u ε , we get a(u ε ,v)+ 1 ε b(uε ,v)=〈ϕ, v〉 ∀v ∈ V. (2) α |u ε | 2 ≤ a(u ε ,u ε ) ≤‖ϕ‖|u ε | so that |u| ε is bounded. We extract a subsequence, still denoted by (u ε ), which converges weakly to some z ∈ V .AsJ ε ≥ J and b(u, u) =0,wehave J(u ε ) ≤ J ε (u ε ) ≤ J ε (u) =J(u) ∀ε >0, (3) so that (J is convex and continuous) J(z) ≤ lim inf J(u ε ) ≤ J(u). As J(u ε )+ 1 2ε b(uε ,u ε ) ≤ J(u),
- 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 and 144: 138 S. Lapin et al. 4 Energy Inequa
- 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: 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
- Page 195 and 196: 194 A. Bonito et al. ∫ v n+1 h
- Page 197 and 198: 196 A. Bonito et al. −pn +2µD(v)
- Page 199 and 200: 198 A. Bonito et al. each of its pa
- Page 201 and 202: 200 A. Bonito et al. The normal vec
- Page 203 and 204: 202 A. Bonito et al. with initial c
- Page 205 and 206: 204 A. Bonito et al. Fig. 8. Jet bu
- Page 207 and 208: 206 A. Bonito et al. References [AM
- Page 209 and 210: 208 A. Bonito et al. [Set96] J. A.
- Page 211 and 212: 210 J. Hao et al. due to shear flow
- Page 213 and 214: 212 J. Hao et al. The backward reac
- Page 215 and 216: 214 J. Hao et al. where u and p den
- Page 217 and 218: 216 J. Hao et al. * * * * * * * * *
- Page 219 and 220: 218 J. Hao et al. and solve for V n
168 B. Maury<br />
1<br />
ε Ψ(x) −→ I K(x) as ε goes to 0, ∀x ∈ X.<br />
If J ε admits a minimum u ε , for any ε, one can expect u ε to approach a (or<br />
the) minimum of J over K, if it exists.<br />
In actual Finite Element computations, some u ε h<br />
is computed as the solution<br />
to a finite dimensional problem, where h is a space-discretization parameter.<br />
The present work is motivated by the fact that, even if the penalty<br />
method for the continuous problem is convergent <strong>and</strong> the discretization procedure<br />
is sound, the rate of convergence of u ε h<br />
toward the exact solution is not<br />
straightforward to obtain.<br />
To our knowledge, the first paper dedicated to the analysis of the penalty<br />
method in the Finite Element context dates back to 1973 (see [Bab73]), where<br />
this method was used to incorporate Dirichlet boundary conditions in some<br />
variants of the Finite Element Method. Since then, this strategy has been<br />
followed to integrate obstacles in fluid flow simulations [ABF99], to model the<br />
rigidity constraint [JLM05].<br />
The present work is motivated by the h<strong>and</strong>ling of rigid particles in a<br />
fluid flow. Various approaches have been proposed to incorporate rigid bodies<br />
in a Stokes or Navier–Stokes fluid: arbitrary Lagrangian Eulerian approach<br />
[JT96, Mau99], fictitious domain approach [PG02]. More recently, a strategy<br />
based on augmented Lagrangian principles was proposed to h<strong>and</strong>le a large<br />
class of multimaterial flows [VCLR04, RPVC05]. In [JLM05], we tested the<br />
raw penalty method to h<strong>and</strong>le the rigidity constraint in a viscous fluid. This<br />
approach is not sophisticated: it simply consists in adding to the variational<br />
formulation the term<br />
∫<br />
1 (<br />
∇u + ∇ T u ) : ( ∇v + ∇ T v ) .<br />
ε Ω<br />
It presents some drawbacks: as it is based on pure penalty <strong>and</strong> not augmented<br />
Lagrangian, the penalty parameter has to be taken very small for the<br />
constraint to be fulfilled properly, which may harm the conditioning of the<br />
system to solve. Yet, it shows itself to be robust in practice, it allows the use<br />
of non-boundary-fitted (e.g., Cartesian) meshes. Besides, it is straightforward<br />
to implement, so that a full Navier–Stokes solver (in 2D) with circular rigid<br />
particles can be written in about 50 lines, by using, for example, FreeFem++<br />
(created by O. Pironneau, see [FFp]). Note that new tools for 3D problems<br />
are already available (see, e.g., [ff3, DPP03] or [lif]), which enable to perform<br />
computations of three dimensional fluid-particle flows.<br />
We shall actually focus here on a simpler problem (see the problem (8)),<br />
which is a scalar version of the rigidity constraint. The fluid velocity is indeed<br />
replaced by a temperature field, <strong>and</strong> the rigid particle is replaced by a zone<br />
with infinite conductivity. The Lagrange multiplier can be interpreted in this<br />
context as a heat source term (see Remark 6).<br />
We begin by presenting some st<strong>and</strong>ard properties of the penalty method<br />
for quadratic optimization (Section 2.1), <strong>and</strong> some convergence results. Then