A bi-projection method for Bingham type flows Laurent Chupin, - - PowerPoint PPT Presentation

a bi projection method for bingham type flows
SMART_READER_LITE
LIVE PREVIEW

A bi-projection method for Bingham type flows Laurent Chupin, - - PowerPoint PPT Presentation

A bi-projection method for Bingham type flows Laurent Chupin, Thierry Dubois Laboratoire de Mathmatiques Universit Blaise Pascal, Clermont-Ferrand Ecoulements Gravitaires et RIsques Naturels Juin 2015 Laurent Chupin (Clermont-Ferrand)


slide-1
SLIDE 1

A bi-projection method for Bingham type flows

Laurent Chupin, Thierry Dubois

Laboratoire de Mathématiques Université Blaise Pascal, Clermont-Ferrand

Ecoulements Gravitaires et RIsques Naturels Juin 2015

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 1 / 20

slide-2
SLIDE 2

Summary

1

Motivations

2

One difficulty: the presence of a threshold

3

Numerical simulations

slide-3
SLIDE 3

Complex fluids

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 2 / 20

slide-4
SLIDE 4

Rheology

Rheology is the study of the flow of matter, primarily in a liquid state, but also as solids under conditions in which they respond with plastic flow rather than deforming elastically in response to an applied force.

Force Cisaillement Pente = viscosite Huile Eau Peinture Maizena Boue

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 3 / 20

slide-5
SLIDE 5

Summary

1

Motivations

2

One difficulty: the presence of a threshold

3

Numerical simulations

slide-6
SLIDE 6

Bingham model

Conservation equations (incompressible and isothermal case):

  • ρ0
  • ∂tu + u · ∇u
  • + ∇p = div τ,

div u = 0. The stress is given by: τ = 2µ0 Du + σ0 Du |Du| The deformation tensor and its Froebenius norm are defined by: Du = 1 2

  • ∇u + T(∇u)
  • and

|Du|2 =

  • 1≤i,j≤d

|(Du)ij|2.

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 4 / 20

slide-7
SLIDE 7

Bingham model

Conservation equations (incompressible and isothermal case):

  • ρ0
  • ∂tu + u · ∇u
  • + ∇p = div τ,

div u = 0. The stress is given by:

✘✘✘✘✘✘✘✘✘✘ ✘

τ = 2µ0 Du + σ0 Du |Du| τ = 2µ0 Du + σ0 σ, where the extra-stress satisfies: σ = Du |Du| if |Du| = 0, |σ| ≤ 1 if |Du| = 0.

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 4 / 20

slide-8
SLIDE 8

Classical approaches

1 Variational inequalities

ρ0

  • ∂tu+u·∇u
  • ·(v−u)+2µ0

Du : (Dv−Du)+σ0

|Dv|−|Du| ≥ 0 Well suited for finite volume methods

2 Regularization

τ = 2µ0 Du + σ0 Du |Du|

  • τ ε = 2µ0 Duε + σ0

Duε |Duε| + ε Use results of the quasi-Newtonian models No stop in finite time!

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 5 / 20

slide-9
SLIDE 9

Bingham model

Conservation equations (incompressible and isothermal case):

  • ρ0
  • ∂tu + u · ∇u
  • + ∇p = div τ,

div u = 0. The stress is given by:

✘✘✘✘✘✘✘✘✘✘ ✘

τ = 2µ0 Du + σ0 Du |Du| τ = 2µ0 Du + σ0 σ, where the extra-stress satisfies: σ = Du |Du| if |Du| = 0, |σ| ≤ 1 if |Du| = 0.

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 6 / 20

slide-10
SLIDE 10

Bingham model

Conservation equations (incompressible and isothermal case):

  • ρ0
  • ∂tu + u · ∇u
  • + ∇p = div τ,

div u = 0. The stress is given by:

✘✘✘✘✘✘✘✘✘✘ ✘

τ = 2µ0 Du + σ0 Du |Du| τ = 2µ0 Du + σ0 σ, where the extra-stress satisfies:

✘✘✘✘✘✘✘✘✘✘✘✘ ✘

σ = Du |Du| si |Du| = 0, |σ| ≤ 1 if |Du| = 0. σ = P(σ + r Du), where P is the projector on the following convex closed set: Λ :=

  • σ ∈ L2(Ω)d×d

; |σ(x)| ≤ 1, p.p.

  • .

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 6 / 20

slide-11
SLIDE 11

Bingham model

1 We introduce two non-dimensional numbers:

Re = ρ0VL µ0 and Bi = σ0L µ0V .

2 The model becomes

∂tu + u · ∇u + ∇p − 1 Re ∆u = Bi Re div σ, under the two constraints (r being any positif real) div u = 0 and σ = P(σ + r Du).

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 7 / 20

slide-12
SLIDE 12

Algorithm: time discretization

un and pn being given we obtain un+1 solving           

  • un+1 − un

δt + ∇pn − 1 Re ∆ un+1 = 0

  • un+1
  • ∂Ω = 0.

(1) We obtain (un+1, pn+1) using the free divergence constraint:            un+1 − un+1 δt + ∇(pn+1 − pn) = 0 div un+1 = 0 un+1 · n

  • ∂Ω = 0.

(2)

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 8 / 20

slide-13
SLIDE 13

Algorithm: time discretization

un, σn and pn being given we obtain un+1 , σn+1 solving           

  • un+1 − un

δt + ∇pn − 1 Re ∆ un+1 = Bi Re div σn+1 σn+1 = P(σn+1 + r D un+1 + θ(σn − σn+1))

  • un+1
  • ∂Ω = 0.

(1) We obtain (un+1, pn+1) using the free divergence constraint:            un+1 − un+1 δt + ∇(pn+1 − pn) = 0 div un+1 = 0 un+1 · n

  • ∂Ω = 0.

(2)

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 8 / 20

slide-14
SLIDE 14

Algorithm: time discretization

Fixed point to solve (1) :           

  • un+1 − un

δt + ∇pn − 1 Re ∆ un+1 = Bi Re div σn+1 σn+1 = P(σn+1 + r D un+1 + θ(σn − σn+1))

  • un+1
  • ∂Ω = 0.

(1) σn,k being given, we obtain un,k then σn,k+1:           

  • un,k − un

δt + ∇pn − 1 Re ∆ un,k = Bi Re div σn,k, σn,k+1 = P(σn,k + r D un,k + θ(σn − σn,k)),

  • un,k
  • ∂Ω = 0.

(3)

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 9 / 20

slide-15
SLIDE 15

Numerical study

Theorem 1

Assume that 2θ + r Bi ≤ 2. For each integer n ∈ N, the sequence ( un,k, σn,k)k solution of system (3) converges to ( un+1, σn+1), solution of system (1). Moreover the convergence is geometric with common ratio 1 − θ.

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 10 / 20

slide-16
SLIDE 16

Numerical study - Proof of theorem 1

1 Equation on differences uk =

un,k − un+1 and σk = σn,k − σn+1                1 δt uk − 1 Re ∆uk = Bi Re div σk, uk

  • ∂Ω = 0,

σk+1 = P(σn,k + r D un,k + θ(σn − σn,k)) − P(σn+1 + r D un+1 + θ(σn − σn+1)).

2 Energy estimate:

1 δt uk2

L2(Ω) + 1

Re ∇uk2

L2(Ω) = − Bi

Re σk, Duk.

3 The projection P is a contraction:

σk+12

L2(Ω) ≤ (1−θ)2σk2 L2(Ω)+r2∇uk2 L2(Ω)+2r(1−θ)σk, Duk.

4 Simple combination gives the result. Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 11 / 20

slide-17
SLIDE 17

Numerical study: stability result

Theorem 2 (Stability)

We assume that r Bi ≤ 1 et θ ≤ 1/2 The sequence (un, un, pn, σn)n solution of system (1)–(2) is bounded.                         

  • un+1 − un

δt + ∇pn − 1 Re ∆ un+1 = 0 Bi Re div σn+1 σn+1 = P(σn+1 + r D un+1 + θ(σn − σn+1)) un+1 − un+1 δt + ∇(pn+1 − pn) = 0 div un+1 = 0 un+1 · n

  • ∂Ω = 0

and

  • un+1
  • ∂Ω = 0.

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 12 / 20

slide-18
SLIDE 18

Numerical study - Proof of theorem 2

1 Energy estimate:

  • un+12

L2(Ω) − un2 L2(Ω) +

un+1 − un2

L2(Ω) + 2δt

Re ∇ un+12

L2(Ω)

= −2δt∇pn, un+1 − 2δt Bi Re σn+1, D un+1.

2 Control of ∇pn,

un+1 taking δ(un+1 + un+1) + δt2∇(pn+1 + pn) as test function: un+12

L2(Ω) + δt2∇pn+12 L2(Ω)

= 2δt∇pn, un+1 + un+12

L2(Ω) + δt2∇pn2 L2(Ω).

3 Control of σn+1, D

un+1: θσn+12

L2(Ω) + (1 − 2θ) θσn+1 − σn2 L2(Ω)

≤ 2 r2∇ un+12

L2(Ω) + 2rσn+1, D

un+1 + θσn2

L2(Ω).

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 13 / 20

slide-19
SLIDE 19

Numerical study: convergence result

Theorem 3 (Convergence)

We assume that r Bi ≤ 1/3 et θ ≤ 1/3 If there exists a regular solution (u, p, σ) of continuous system then the sequence (un)n≥0 issued from the previous algorithm converges to u as n tends to +∞. More precisely, there exists a constant C such that forall 0 ≤ n ≤ N, we have u(tn) − un2

L2 + δt n

  • k=0

∇u(tk) − ∇uk2

L2 ≤ C (θ δt + δt2).

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 14 / 20

slide-20
SLIDE 20

Summary

1

Motivations

2

One difficulty: the presence of a threshold

3

Numerical simulations

slide-21
SLIDE 21

Numerical scheme and implementation

Time discretization: second-order projection method based on the combination of the BDF2 (Backward Differentiation Formulae) and the AB2 (Adams-Bashforth) schemes. Spatial discretization: Ω = (0, Lx) × (0, Ly) is discretized by using a Cartesian uniform mesh.

r

pij σij

✲ ✲

ui+1,j ui,j

vi,j+1

vij (xi+1, yj+1) (xi+1, yj) (xi, yj+1) (xi, yj) Implemented in a F90/MPI code. The PETSc library to solve the linear systems and to manage data on structured grids.

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 15 / 20

slide-22
SLIDE 22

Stationary flows in the lid-driven cavity at Re = 1000

Bi = 0 Bi = 10

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 16 / 20

slide-23
SLIDE 23

Stationary flows in the lid-driven cavity at Re = 1000

Bi = 0 Bi = 10

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 16 / 20

slide-24
SLIDE 24

Stationary flows in the lid-driven cavity at Re = 1000

Bi = 0 Bi = 10

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 16 / 20

slide-25
SLIDE 25

Numerical estimates of the convergence rate

Data: Re = 1000 Bi = 10 r = 0.01 θ = δt Nx = Ny = 1024 Error graph: u − uref2 = F(δt)

1e-04 1e-03 1e-02 1e-01 1e-05 1e-04 1e-03 1e-02 1e-01

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 18 / 20

slide-26
SLIDE 26

Finite stopping times

Physical data: Re = 1 Bi = 1 Stopped training velocity at time t = 0.05 Numerical data: r = 0.1 θ = 0.00125 δt = 0.00125 Nx = Ny = 128 Graph of the L2 norm: u2 = G(t)

0,025 0,05 0,075 0,1

  • 0,05

0,05 0,1 0,15 0,2 0,05 0,1

  • 0,05

0,05 0,1 0,15 0,2

Laurent Chupin (Clermont-Ferrand) Bingham type flows GdR EGRIN - Juin 2015 19 / 20

slide-27
SLIDE 27

T H E E N D