• Aucun résultat trouvé

Solving the initial value problem for Euler and Burgers equations by convex optimization

N/A
N/A
Protected

Academic year: 2022

Partager "Solving the initial value problem for Euler and Burgers equations by convex optimization"

Copied!
48
0
0

Texte intégral

(1)

Solving the initial value problem for Euler and Burgers equations by convex optimization

Yann Brenier

CNRS, DMA, Ecole Normale Supérieure, 45 rue d’Ulm, FR-75005 Paris in association with CNRS-INRIA "MOKAPLAN" team

COLOCVIUL FRANCO-ROMAN DE MATEMATICI APLICATE Bordeaux, IMB, 27-31/08/2018

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 1 / 20

(2)

OUR GOAL

We want to solve the initial value problem for a large class of equations including the Euler equations of fluid mechanics through a concave maximization problem, similar to the ones considered in Control Theory (or, for instance, Mean Field Games).

Reference: Y.B. ArXiv Oct. 2017, to appear in CMP

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 2 / 20

(3)

OUR GOAL

We want to solve the initial value problem for a large class of equations including the Euler equations of fluid mechanics through a concave maximization problem, similar to the ones considered in Control Theory (or, for instance, Mean Field Games).

Reference: Y.B. ArXiv Oct. 2017, to appear in CMP

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 2 / 20

(4)

Euler 1755/57: The first PDEs ever written (at least in modern style)!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 3 / 20

(5)

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 4 / 20

(6)

The class of "entropic conservation laws"

tU +∇ ·(F(U)) = 0, U = U(t,x) ∈ Rm, x ∈ Rd enjoying an additional conservation law

t(E(U)) +∇ ·(Q(U)) =0,

for all smooth solutions U, where E is strictly convex.

A typical example: the equations of an isothermal gas (Euler, 1755)

tρ+∇ ·q=0, ∂tq+∇ ·(qq

ρ ) +∇ρ=0, E= |q|2

+ρlogρ, ρ >0, qRd. Typically, such systems are locally well-posed, with generic formation of shock waves.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 5 / 20

(7)

The class of "entropic conservation laws"

tU +∇ ·(F(U)) = 0, U = U(t,x) ∈ Rm, x ∈ Rd enjoying an additional conservation law

t(E(U)) +∇ ·(Q(U)) =0,

for all smooth solutions U, where E is strictly convex.

A typical example: the equations of an isothermal gas (Euler, 1755)

tρ+∇ ·q=0, ∂tq+∇ ·(qq

ρ ) +∇ρ=0, E= |q|2

+ρlogρ, ρ >0, qRd. Typically, such systems are locally well-posed, with generic formation of shock waves.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 5 / 20

(8)

The class of "entropic conservation laws"

tU +∇ ·(F(U)) = 0, U = U(t,x) ∈ Rm, x ∈ Rd enjoying an additional conservation law

t(E(U)) +∇ ·(Q(U)) =0,

for all smooth solutions U, where E is strictly convex.

A typical example: the equations of an isothermal gas (Euler, 1755)

tρ+∇ ·q=0, ∂tq+∇ ·(qq

ρ ) +∇ρ=0, E= |q|2

+ρlogρ, ρ >0, qRd.

Typically, such systems are locally well-posed, with generic formation of shock waves.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 5 / 20

(9)

The class of "entropic conservation laws"

tU +∇ ·(F(U)) = 0, U = U(t,x) ∈ Rm, x ∈ Rd enjoying an additional conservation law

t(E(U)) +∇ ·(Q(U)) =0,

for all smooth solutions U, where E is strictly convex.

A typical example: the equations of an isothermal gas (Euler, 1755)

tρ+∇ ·q=0, ∂tq+∇ ·(qq

ρ ) +∇ρ=0, E= |q|2

+ρlogρ, ρ >0, qRd. Typically, such systems are locally well-posed, with generic formation of shock waves.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 5 / 20

(10)

0 0.05 0.1 0.15 0.2 0.25

0 0.2 0.4 0.6 0.8 1

’fort.10’

Inviscid Burgers equation :tu+x(u2/2) =0,u=u(t,x),x R/Z,t 0.

Formation of two shock waves. (Vertical axis:t [0,1/4], horizontal axis:x T.)

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 6 / 20

(11)

The least square approach?

GivenU0 on Td = Rd/Zd and T > 0, if F(U) is linear inU, the least square method obviously leads to a (degenerate) convex problem

U(t=0,·)=Uinf 0 Z

[0,TTd

|∂tU +∇ ·(F(U))|2

but this is no longer true for nonlinear systems.

We need a different idea!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 7 / 20

(12)

The least square approach?

GivenU0 on Td = Rd/Zd and T > 0, if F(U) is linear inU, the least square method obviously leads to a (degenerate) convex problem

U(t=0,·)=Uinf 0 Z

[0,TTd

|∂tU +∇ ·(F(U))|2 but this is no longer true for nonlinear systems.

We need a different idea!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 7 / 20

(13)

The least square approach?

GivenU0 on Td = Rd/Zd and T > 0, if F(U) is linear inU, the least square method obviously leads to a (degenerate) convex problem

U(t=0,·)=Uinf 0 Z

[0,TTd

|∂tU +∇ ·(F(U))|2 but this is no longer true for nonlinear systems.

We need a different idea!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 7 / 20

(14)

An entropy minimization approach

We want to minimize the entropy among all weak solutions U of the initial value problem:

infU

Z

[0,TTd

E(U), U = U(t,x) ∈ Rm subject to

Z

[0,TTd

tA ·U +∇A ·F(U) + Z

Td

A(0,·)·U0 = 0

for all smoothA=A(t,x)Rm withA(T,·) =0. A priori, by "convex integration" à la De Lellis-Székelyhidi, there are many non entropy-preserving weak solutions attached toU0.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 8 / 20

(15)

An entropy minimization approach

We want to minimize the entropy among all weak solutions U of the initial value problem:

infU

Z

[0,TTd

E(U), U = U(t,x) ∈ Rm subject to

Z

[0,TTd

tA ·U +∇A ·F(U) + Z

Td

A(0,·)·U0 = 0

for all smoothA=A(t,x)Rm withA(T,·) =0. A priori, by "convex integration" à la De Lellis-Székelyhidi, there are many non entropy-preserving weak solutions attached toU0.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 8 / 20

(16)

An entropy minimization approach

We want to minimize the entropy among all weak solutions U of the initial value problem:

infU

Z

[0,TTd

E(U), U = U(t,x) ∈ Rm subject to

Z

[0,TTd

tA ·U +∇A ·F(U) + Z

Td

A(0,·)·U0 = 0

for all smoothA=A(t,x)Rm withA(T,·) =0. A priori, by "convex integration" à la De Lellis-Székelyhidi, there are many non entropy-preserving weak solutions attached toU0.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 8 / 20

(17)

An entropy minimization approach

We want to minimize the entropy among all weak solutions U of the initial value problem:

infU

Z

[0,TTd

E(U), U = U(t,x) ∈ Rm subject to

Z

[0,TTd

tA ·U +∇A·F(U) + Z

Td

A(0,·)·U0 = 0

for all smoothA=A(t,x)RmwithA(T,·) =0.

A priori, by "convex integration" à la De Lellis-Székelyhidi, there are many non entropy-preserving weak solutions attached toU0.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 8 / 20

(18)

An entropy minimization approach

We want to minimize the entropy among all weak solutions U of the initial value problem:

infU

Z

[0,TTd

E(U), U = U(t,x) ∈ Rm subject to

Z

[0,TTd

tA ·U +∇A·F(U) + Z

Td

A(0,·)·U0 = 0

for all smoothA=A(t,x)RmwithA(T,·) =0. A priori, by "convex integration" à la De Lellis-Székelyhidi, there are many non entropy-preserving weak solutions attached toU0.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 8 / 20

(19)

The resulting saddle-point problem

infU sup

A

Z

[0,TTd

E(U)−∂tA·U − ∇A·F(U)

− Z

Td

A(0,·)·U0

whereA = A(t,x) ∈ Rm is smooth with A(T,·) =0. HereU0 is the initial condition and T the final time.

N.B. The supremum inA exactly encodes thatU is a weak solution with initial condition U0, all test functions A acting like Lagrange multipliers.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 9 / 20

(20)

The resulting saddle-point problem infU sup

A

Z

[0,TTd

E(U)−∂tA·U − ∇A ·F(U)

− Z

Td

A(0,·)·U0

whereA = A(t,x) ∈ Rm is smooth with A(T,·) =0.

HereU0 is the initial condition and T the final time.

N.B. The supremum inA exactly encodes thatU is a weak solution with initial condition U0, all test functions A acting like Lagrange multipliers.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 9 / 20

(21)

The resulting saddle-point problem infU sup

A

Z

[0,TTd

E(U)−∂tA·U − ∇A ·F(U)

− Z

Td

A(0,·)·U0

whereA = A(t,x) ∈ Rm is smooth with A(T,·) =0.

HereU0 is the initial condition and T the final time.

N.B. The supremum inA exactly encodes thatU is a weak solution with initial condition U0, all test functions A acting like Lagrange multipliers.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 9 / 20

(22)

Reversing infimum and supremum...

leads to a concave maximization problem inA, namely sup

A

infU

Z

[0,TTd

E(U)−∂tA·U− ∇A·F(U)− Z

Td

A(0,·)·U0

= sup

A

Z

[0,TTd

K(∂tA,∇A)− Z

Td

A(0,·)·U0.

K(E,B) = inf

U∈Rm

E(U)−E ·U−B ·F(U).

Notice that K is automatically concave. However they might be a duality gap with possibly inf sup > sup inf.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 10 / 20

(23)

Reversing infimum and supremum...

leads to a concave maximization problem inA, namely sup

A

infU

Z

[0,TTd

E(U)−∂tA·U− ∇A·F(U)− Z

Td

A(0,·)·U0

= sup

A

Z

[0,TTd

K(∂tA,∇A)− Z

Td

A(0,·)·U0.

K(E,B) = inf

U∈Rm

E(U)−E ·U−B ·F(U).

Notice that K is automatically concave. However they might be a duality gap with possibly inf sup > sup inf.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 10 / 20

(24)

Reversing infimum and supremum...

leads to a concave maximization problem inA, namely sup

A

infU

Z

[0,TTd

E(U)−∂tA·U− ∇A·F(U)− Z

Td

A(0,·)·U0

= sup

A

Z

[0,TTd

K(∂tA,∇A)− Z

Td

A(0,·)·U0.

K(E,B) = inf

U∈Rm

E(U)−E ·U −B ·F(U).

Notice that K is automatically concave. However they might be a duality gap with possibly inf sup > sup inf.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 10 / 20

(25)

Reversing infimum and supremum...

leads to a concave maximization problem inA, namely sup

A

infU

Z

[0,TTd

E(U)−∂tA·U− ∇A·F(U)− Z

Td

A(0,·)·U0

= sup

A

Z

[0,TTd

K(∂tA,∇A)− Z

Td

A(0,·)·U0.

K(E,B) = inf

U∈Rm

E(U)−E ·U −B ·F(U).

Notice that K is automatically concave.

However they might be a duality gap with possibly inf sup > sup inf.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 10 / 20

(26)

Reversing infimum and supremum...

leads to a concave maximization problem inA, namely sup

A

infU

Z

[0,TTd

E(U)−∂tA·U− ∇A·F(U)− Z

Td

A(0,·)·U0

= sup

A

Z

[0,TTd

K(∂tA,∇A)− Z

Td

A(0,·)·U0.

K(E,B) = inf

U∈Rm

E(U)−E ·U −B ·F(U).

Notice that K is automatically concave. However they might be a duality gap with possibly inf sup > sup inf.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 10 / 20

(27)

The elementary example of the Burgers equation

Then, the maximization problem in A simply reads sup

A

Z

[0,TT

− (∂tA)2 2(1−∂xA) −

Z

T

A(0,·)u0.

with A = A(t,x) ∈ R subject toA(T,·) = 0, ∂xA ≤ 1. Introducing ρ = 1−∂xA ≥ 0,q = ∂tA ∈ R, we get sup{

Z

[0,TT

−q2

2ρ + qu0, s.t. ∂tρ+∂xq = 0, ρ(T,·) = 1} looking very similar to an optimal transport problem!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 11 / 20

(28)

The elementary example of the Burgers equation

Then, the maximization problem in A simply reads sup

A

Z

[0,TT

− (∂tA)2 2(1−∂xA) −

Z

T

A(0,·)u0.

with A = A(t,x) ∈ R subject toA(T,·) = 0, ∂xA ≤ 1.

Introducing ρ = 1−∂xA ≥ 0,q = ∂tA ∈ R, we get sup{

Z

[0,TT

−q2

2ρ + qu0, s.t. ∂tρ+∂xq = 0, ρ(T,·) = 1} looking very similar to an optimal transport problem!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 11 / 20

(29)

The elementary example of the Burgers equation

Then, the maximization problem in A simply reads sup

A

Z

[0,TT

− (∂tA)2 2(1−∂xA) −

Z

T

A(0,·)u0.

with A = A(t,x) ∈ R subject toA(T,·) = 0, ∂xA ≤ 1.

Introducing ρ = 1−∂xA ≥0, q = ∂tA ∈ R, we get sup{

Z

[0,TT

−q2

2ρ + qu0, s.t. ∂tρ+∂xq = 0, ρ(T,·) = 1}

looking very similar to an optimal transport problem!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 11 / 20

(30)

The elementary example of the Burgers equation

Then, the maximization problem in A simply reads sup

A

Z

[0,TT

− (∂tA)2 2(1−∂xA) −

Z

T

A(0,·)u0.

with A = A(t,x) ∈ R subject toA(T,·) = 0, ∂xA ≤ 1.

Introducing ρ = 1−∂xA ≥0, q = ∂tA ∈ R, we get sup{

Z

[0,TT

−q2

2ρ + qu0, s.t. ∂tρ+∂xq = 0, ρ(T,·) = 1}

looking very similar to an optimal transport problem!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 11 / 20

(31)

Example 2: the isothermal Euler equations

tρ+ ∇ ·q = 0, ∂tq +∇ ·(q⊗q

ρ ) +∇ρ = 0. We maximize in u = u(t,x) ∈ R, Q = Q(t,x) ∈ Rd, M = M(t,x) =Mt(t,x) ∈ Rd×d, M ≥ 0,

Z

[0,T]×D

−exp(u)exp(1

2Q·M−1 ·Q)− Z

D

σ0ρ0 −w0 ·q0,

u = ∂tσ +∂iwi, Qi = ∂twi +∂iσ, Mij = δij −∂iwj −∂jwi, whereσ and w must vanish at t = T.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 12 / 20

(32)

Example 2: the isothermal Euler equations

tρ+ ∇ ·q = 0, ∂tq +∇ ·(q⊗q

ρ ) +∇ρ = 0.

We maximize in u = u(t,x) ∈ R, Q = Q(t,x) ∈ Rd, M = M(t,x) =Mt(t,x) ∈ Rd×d, M ≥ 0,

Z

[0,T]×D

−exp(u)exp(1

2Q·M−1 ·Q)− Z

D

σ0ρ0 −w0 ·q0,

u = ∂tσ +∂iwi, Qi = ∂twi +∂iσ, Mij = δij −∂iwj −∂jwi, whereσ and w must vanish at t = T.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 12 / 20

(33)

Example 2: the isothermal Euler equations

tρ+ ∇ ·q = 0, ∂tq +∇ ·(q⊗q

ρ ) +∇ρ = 0.

We maximize in u = u(t,x) ∈ R, Q = Q(t,x) ∈ Rd, M = M(t,x) =Mt(t,x) ∈ Rd×d, M ≥ 0,

Z

[0,T]×D

−exp(u)exp(1

2Q·M−1 ·Q)− Z

D

σ0ρ0 −w0 ·q0,

u = ∂tσ +∂iwi, Qi = ∂twi +∂iσ, Mij = δij −∂iwj −∂jwi, whereσ and w must vanish at t = T.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 12 / 20

(34)

Example 2: the isothermal Euler equations

tρ+ ∇ ·q = 0, ∂tq +∇ ·(q⊗q

ρ ) +∇ρ = 0.

We maximize in u = u(t,x) ∈ R, Q = Q(t,x) ∈ Rd, M = M(t,x) =Mt(t,x) ∈ Rd×d, M ≥ 0,

Z

[0,T]×D

−exp(u)exp(1

2Q·M−1 ·Q)− Z

D

σ0ρ0 −w0 ·q0,

u = ∂tσ +∂iwi, Qi = ∂twi +∂iσ, Mij = δij −∂iwj −∂jwi, whereσ and w must vanish att = T.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 12 / 20

(35)

Example 3:

the Euler equations of incompressible fluids

In this limit case, the resulting problem reads sup

(M,Q)

− Z

[0,T]×D

q0 ·Q + 1

2 Q ·M−1 ·Q,

where, again, Q is a vector field and M = Mt ≥ 0 is a field of semi-definite symmetric matrices, subject to Mij(T,·) =δij, ∂tMij = ∂jQi +∂iQj +2∂ij(−4)−1kQk.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 13 / 20

(36)

Example 3:

the Euler equations of incompressible fluids

In this limit case, the resulting problem reads sup

(M,Q)

− Z

[0,T]×D

q0 ·Q + 1

2 Q ·M−1 ·Q,

where, again, Q is a vector field and M = Mt ≥ 0 is a field of semi-definite symmetric matrices, subject to Mij(T,·) =δij, ∂tMij = ∂jQi +∂iQj +2∂ij(−4)−1kQk.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 13 / 20

(37)

Main results (ArXiv Oct. 2017, to appear in CMP)

Theorem 1: If U is a smooth solution to the Cauchy problem and T is not too large(*), then U can be recovered from the concave maximization problem which admits A(t,x) = (t −T)E0(U(t,x)) as solution. Theorem 2: For the Burgers equation, all entropy solutions can be recovered, for arbitrarily large T. (*) more precisely if

E”(V)−(T −t)F”(V)· ∇(E0(U(t,x)))> 0, ∀t,x,V.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 14 / 20

(38)

Main results (ArXiv Oct. 2017, to appear in CMP) Theorem 1: If U is a smooth solution to the Cauchy problem and T is not too large

(*), then U can be recovered from the concave maximization problem which admits A(t,x) = (t −T)E0(U(t,x)) as solution. Theorem 2: For the Burgers equation, all entropy solutions can be recovered, for arbitrarily large T. (*) more precisely if

E”(V)−(T −t)F”(V)· ∇(E0(U(t,x)))> 0, ∀t,x,V.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 14 / 20

(39)

Main results (ArXiv Oct. 2017, to appear in CMP) Theorem 1: If U is a smooth solution to the Cauchy problem and T is not too large(*), then U can be recovered from the concave maximization problem which admits A(t,x) = (t −T)E0(U(t,x)) as solution.

Theorem 2: For the Burgers equation, all entropy solutions can be recovered, for arbitrarily large T. (*) more precisely if

E”(V)−(T −t)F”(V)· ∇(E0(U(t,x)))> 0, ∀t,x,V.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 14 / 20

(40)

Main results (ArXiv Oct. 2017, to appear in CMP) Theorem 1: If U is a smooth solution to the Cauchy problem and T is not too large(*), then U can be recovered from the concave maximization problem which admits A(t,x) = (t −T)E0(U(t,x)) as solution.

Theorem 2: For the Burgers equation, all entropy solutions can be recovered, for arbitrarily large T.

(*) more precisely if

E”(V)−(T −t)F”(V)· ∇(E0(U(t,x)))> 0, ∀t,x,V.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 14 / 20

(41)

Main results (ArXiv Oct. 2017, to appear in CMP) Theorem 1: If U is a smooth solution to the Cauchy problem and T is not too large(*), then U can be recovered from the concave maximization problem which admits A(t,x) = (t −T)E0(U(t,x)) as solution.

Theorem 2: For the Burgers equation, all entropy solutions can be recovered, for arbitrarily large T. (*) more precisely if

E”(V)−(T −t)F”(V)· ∇(E0(U(t,x)))> 0, ∀t,x,V.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 14 / 20

(42)

0 0.05 0.1 0.15 0.2 0.25

0 0.2 0.4 0.6 0.8 1

’fort.10’

Inviscid Burgers equation :tu+x(u2/2) =0,u=u(t,x),x R/Z,t 0.

Formation of two shock waves. (Vertical axis:t [0,1/4], horizontal axis:x T.)

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 15 / 20

(43)

0 0.05 0.1 0.15 0.2 0.25

0 0.2 0.4 0.6 0.8 1

’fort.19’

Inviscid Burgers equation :tu+x(u2/2) =0,u=u(t,x),x R/Z,t 0.

Recovery of the solution at time T=0.1 by convex optimization.

Observe the formation of a first vacuum zone as the first shock has formed.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 16 / 20

(44)

0 0.05 0.1 0.15 0.2 0.25

0 0.2 0.4 0.6 0.8 1

’fort.24’

Inviscid Burgers equation :tu+x(u2/2) =0,u=u(t,x),x R/Z,t 0.

Recovery of the solution at time T=0.16 by convex optimization.

Observe the formation of a second vacuum zone as the second shock has formed.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 17 / 20

(45)

0 0.05 0.1 0.15 0.2 0.25

0 0.2 0.4 0.6 0.8 1

’fort.29’

Inviscid Burgers equation :tu+x(u2/2) =0,u=u(t,x),x R/Z,t 0.

Recovery of the solution at time T=0.225 by convex optimization.

Observe the extension of the two vacuum zones.

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 18 / 20

(46)

-0.4 -0.2 0 0.2 0.4 0.6 0.8 1 1.2

0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

’burgers-2c’

Numerics: we recover the entropy solutions (only) at the final time.

Notice that the code differ by only two lines (of fortran code) from a standard (Benamou-B.) optimal transport solver!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 19 / 20

(47)

Analogy with mountain climbing: going from Everest to Lhotse without following the crest! (Partial credit to Thomas Gallouët for this analogy.)

MULTUMESC PENTRU ATENTIE!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 20 / 20

(48)

Analogy with mountain climbing: going from Everest to Lhotse without following the crest! (Partial credit to Thomas Gallouët for this analogy.)

MULTUMESC PENTRU ATENTIE!

Yann Brenier (CNRS, DMA-ENS) IVP for Euler by convex optimization Bordeaux, 29/08/2018 20 / 20

Références

Documents relatifs

Our method uses the geometrical properties of the vector field given by the ODE and a state space discretization to compute an enclosure of the trajectories set that verifies the

De plus, dans son mémoire d’orthophonie, A.Guillon (2009) détaille des moyens de prise en charge pour aborder un travail du rythme et du traitement prosodique

Our method uses the geometrical properties of the vector field given by the ODE and a state space discretization to compute an enclosure of the trajectories set that verifies the

BEIRÃO DA VEIGA, Perturbation Theorems for Linear Hyperbolic Mixed Prob- lems and Applications to the Compressible Euler Equations, Comm. BEIRÃO DA VEIGA,

We also briefly discuss the use of a Lax pair, or the related global relation, in deriving an explicit correspondance between Dirichlet and Neumann data in the simple case of

We finally obtain a class of schemes which offer many interesting properties: both the density and internal energy positivity are preserved, unconditionnally for the pressure

On the maximization problem for solutions of reaction- diffusion equations with respect to their initial data.. Mathematical Modelling of Natural Phenomena, EDP Sciences,

Finally, in Section 4, we show that once a solution to the reduced system has been obtained, our framework allows for the recovery of the Einstein vacuum equations, both for