Partial Differential Equations - Modelling and ... - ResearchGate

Partial Differential Equations - Modelling and ... - ResearchGate Partial Differential Equations - Modelling and ... - ResearchGate

24.02.2014 Views

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),

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

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!