Weighted Sobolev spaces for the advection operator: A variational - - PowerPoint PPT Presentation

weighted sobolev spaces for the advection operator
SMART_READER_LITE
LIVE PREVIEW

Weighted Sobolev spaces for the advection operator: A variational - - PowerPoint PPT Presentation

Weighted Sobolev spaces for the advection operator: A variational method for computing shape derivatives of geometric constraints along rays. Florian Feppon Gr egoire Allaire, Charles Dapogny Julien Cortial, Felipe Bordeu S eminaire des


slide-1
SLIDE 1

Weighted Sobolev spaces for the advection

  • perator:

A variational method for computing shape derivatives of geometric constraints along rays.

Florian Feppon Gr´ egoire Allaire, Charles Dapogny Julien Cortial, Felipe Bordeu S´ eminaire des doctorants – October 17th, 2018

slide-2
SLIDE 2

Outline

  • 1. Brief presentation of thickness constraints in Hadamard’s method of

shape differentiation

  • 2. A variational method for avoiding integration along rays
  • 3. A few insights regarding the mathematical framework: weighted

graph spaces of the advection operator β · ∇.

slide-3
SLIDE 3

Outline

  • 1. Brief presentation of thickness constraints in Hadamard’s method of

shape differentiation

  • 2. A variational method for avoiding integration along rays
  • 3. A few insights regarding the mathematical framework: weighted

graph spaces of the advection operator β · ∇.

slide-4
SLIDE 4

Outline

  • 1. Brief presentation of thickness constraints in Hadamard’s method of

shape differentiation

  • 2. A variational method for avoiding integration along rays
  • 3. A few insights regarding the mathematical framework: weighted

graph spaces of the advection operator β · ∇.

slide-5
SLIDE 5

Outline

  • 1. Brief presentation of thickness constraints in Hadamard’s method of

shape differentiation

  • 2. A variational method for avoiding integration along rays
  • 3. A few insights regarding the mathematical framework: weighted

graph spaces of the advection operator β · ∇.

slide-6
SLIDE 6
  • 1. Hadamard’s method of boundary variations

We rely on the method of Hadamard (figure from[1]): min

Ω J(Ω)

Ωθ = (I + θ)Ωθ with θ ∈ W 1,∞(Ω, Rd), ||θ||W 1,∞(Rd,Rd)< 1. ♥

[1]

Charles Dapogny et al. “Geometrical shape optimization in fluid mechanics using FreeFem++”. In: Structural and Multidisciplinary Optimization (2017).

slide-7
SLIDE 7
  • 1. Hadamard’s method of boundary variations

We rely on the method of Hadamard (figure from[1]): min

Ω J(Ω)

Ωθ = (I + θ)Ωθ with θ ∈ W 1,∞(Ω, Rd), ||θ||W 1,∞(Rd,Rd)< 1. J(Ωθ) = J(Ω) + dJ dθ (Ω)(θ) + o(θ), where |o(θ)| ||θ||W 1,∞(Ω,Rd)

θ→0

− − − → 0, ♥

[1]

Charles Dapogny et al. “Geometrical shape optimization in fluid mechanics using FreeFem++”. In: Structural and Multidisciplinary Optimization (2017).

slide-8
SLIDE 8
  • 1. Hadamard’s method of boundary variations

We rely on the method of Hadamard (figure from[1]): min

Ω J(Ω)

Ωθ = (I + θ)Ωθ with θ ∈ W 1,∞(Ω, Rd), ||θ||W 1,∞(Rd,Rd)< 1. J(Ωθ) = J(Ω) + dJ dθ (Ω)(θ) + o(θ), where |o(θ)| ||θ||W 1,∞(Ω,Rd)

θ→0

− − − → 0, In practice dJ

dθ(Ω)(θ) =

  • ∂Ω u θ · ♥dy for u ∈ L1(∂Ω).

[1]

Charles Dapogny et al. “Geometrical shape optimization in fluid mechanics using FreeFem++”. In: Structural and Multidisciplinary Optimization (2017).

slide-9
SLIDE 9
  • 1. The signed distance function

The signed distance function dΩ to the domain Ω ⊂ D is defined by: ∀x ∈ D, dΩ(x) =      − min

y∈∂Ω ||y − x||

if x ∈ Ω, min

y∈∂Ω ||y − x||

if x ∈ D\Ω.

slide-10
SLIDE 10
  • 1. The signed distance function

◮ The signed distance function dΩ(x) is differentiable at every x ∈ D such that Π∂Ω(x) = {y ∈ ∂Ω | ||x − y|| = d(x, ∂Ω)} is a singleton.

slide-11
SLIDE 11
  • 1. The signed distance function

◮ The signed distance function dΩ(x) is differentiable at every x ∈ D such that Π∂Ω(x) = {y ∈ ∂Ω | ||x − y|| = d(x, ∂Ω)} is a singleton. ◮ The set Σ on which dΩ is not differentiable is called the skeleton.

slide-12
SLIDE 12
  • 1. The signed distance function

∇dΩ is a unit extension of the normal constant along rays: ♥ ♥ ♥ ♥

slide-13
SLIDE 13
  • 1. The signed distance function

∇dΩ is a unit extension of the normal constant along rays: ◮ ∀y ∈ ∂Ω, ∇dΩ(y) = ♥(y) is the unit outward normal to ∂Ω. ♥ ♥ ♥

slide-14
SLIDE 14
  • 1. The signed distance function

∇dΩ is a unit extension of the normal constant along rays: ◮ ∀y ∈ ∂Ω, ∇dΩ(y) = ♥(y) is the unit outward normal to ∂Ω. ◮ ∀s ∈ (ζ−(y), ζ+(y)), dΩ(y + s♥(y)) = s. ♥ ♥

slide-15
SLIDE 15
  • 1. The signed distance function

∇dΩ is a unit extension of the normal constant along rays: ◮ ∀y ∈ ∂Ω, ∇dΩ(y) = ♥(y) is the unit outward normal to ∂Ω. ◮ ∀s ∈ (ζ−(y), ζ+(y)), dΩ(y + s♥(y)) = s. The set ray(y) = {y + s♥(y) | s ∈ (ζ−(y), ζ+(y))} is called the ray emerging from y. ♥

slide-16
SLIDE 16
  • 1. The signed distance function

∇dΩ is a unit extension of the normal constant along rays: ◮ ∀y ∈ ∂Ω, ∇dΩ(y) = ♥(y) is the unit outward normal to ∂Ω. ◮ ∀s ∈ (ζ−(y), ζ+(y)), dΩ(y + s♥(y)) = s. The set ray(y) = {y + s♥(y) | s ∈ (ζ−(y), ζ+(y))} is called the ray emerging from y. ◮ For any x ∈ D\Σ, ||∇dΩ(x)|| = 1 and ∀z ∈ ray(y), ∇dΩ(z) = ♥(y).

slide-17
SLIDE 17
  • 1. The signed distance function

An example: a meshed subdomain Ω ⊂ D

slide-18
SLIDE 18
  • 1. The signed distance function

An example: the signed distance function dΩ:

slide-19
SLIDE 19
  • 1. The signed distance function

An example: the gradient of the signed distance function ∇dΩ:

slide-20
SLIDE 20
  • 1. The signed distance function

The signed distance function allows to formulate geometric constraints. ◮ Maximum thickness constraint : ∀x ∈ Ω, |dΩ(x)| ≤ dmax/2 ◮ Minimum thickness constraint: ∀y ∈ ∂Ω, |ζ−(y)| ≥ dmin/2.

slide-21
SLIDE 21

Shape derivatives of geometric constraints

In practice, one formulates geometric constraints using penalty functionals P(Ω) as follows: min

Ω J(Ω), s.t. P(Ω) ≤ 0, where P(Ω) :=

  • D\Σ

j(dΩ(x))dx. ♥ ♥

slide-22
SLIDE 22

Shape derivatives of geometric constraints

In practice, one formulates geometric constraints using penalty functionals P(Ω) as follows: min

Ω J(Ω), s.t. P(Ω) ≤ 0, where P(Ω) :=

  • D\Σ

j(dΩ(x))dx. The shape derivative of P(Ω) reads P′(Ω)(θ) =

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx

with d′

Ω(θ)(y + s∇(y)) = −θ(y) · ♥(y).

|θ · ♥| θ Ω

slide-23
SLIDE 23
  • 1. Shape derivatives of geometric constraint

Change of variable x = y + s♥(y) with y ∈ ∂Ω, s ∈ (ζ−(y), ζ+(y)):

P′(Ω)(θ) =

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx = −

  • ∂Ω

ζ+(y)

ζ−(y)

j′(s)|Dη|(y, s)ds θ(y) · ♥(y)dy

♥ ♥

slide-24
SLIDE 24
  • 1. Shape derivatives of geometric constraint

Change of variable x = y + s♥(y) with y ∈ ∂Ω, s ∈ (ζ−(y), ζ+(y)):

P′(Ω)(θ) =

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx = −

  • ∂Ω

ζ+(y)

ζ−(y)

j′(s)|Dη|(y, s)ds θ(y) · ♥(y)dy

|Dη|(y, s) =

  • 1≤i≤n−1

(1 + κi(y)s) is the Jacobian of η : (y, s) → y + s♥(y) The κi(y) are the eigenvalues of the tangential gradient ∇♥(y).

slide-25
SLIDE 25
  • 1. Shape derivatives of geometric constraint

Change of variable x = y + s♥(y) with y ∈ ∂Ω, s ∈ (ζ−(y), ζ+(y)):

P′(Ω)(θ) =

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx = −

  • ∂Ω

ζ+(y)

ζ−(y)

j′(s)|Dη|(y, s)ds θ(y) · ♥(y)dy

|Dη|(y, s) =

  • 1≤i≤n−1

(1 + κi(y)s) is the Jacobian of η : (y, s) → y + s♥(y) The κi(y) are the eigenvalues of the tangential gradient ∇♥(y). The function ∀y ∈ ∂Ω, u(y) = − ζ+(y)

ζ−(y)

j′(s)

  • 1≤i≤n−1

(1 + κi(y)s)ds is “explicit” and does not involve θ.

slide-26
SLIDE 26
  • 1. Shape derivatives of geometric constraints

∀y ∈ ∂Ω, u(y) = − ζ+(y)

ζ−(y)

j′(s)

  • 1≤i≤n−1

(1 + κi(y)s)ds. Computing u requires:

slide-27
SLIDE 27
  • 1. Shape derivatives of geometric constraints

∀y ∈ ∂Ω, u(y) = − ζ+(y)

ζ−(y)

j′(s)

  • 1≤i≤n−1

(1 + κi(y)s)ds. Computing u requires:

  • 1. Integrating along rays on the discretization mesh:
slide-28
SLIDE 28
  • 1. Shape derivatives of geometric constraints

∀y ∈ ∂Ω, u(y) = − ζ+(y)

ζ−(y)

j′(s)

  • 1≤i≤n−1

(1 + κi(y)s)ds. Computing u requires:

  • 1. Integrating along rays on the discretization mesh:
  • 2. Estimating the principal curvatures κi(y).
slide-29
SLIDE 29

Outline

  • 1. Brief presentation of thickness constraints in Hadamard’s method of

shape differentiation

  • 2. A variational method for avoiding integration along rays
  • 3. A few insights regarding the mathematical framework: weighted

graph spaces of the advection operator β · ∇.

slide-30
SLIDE 30
  • 2. A variational method for avoiding integration along rays

More precisely, the shape derivative of P(Ω) reads P′(Ω)(θ) =

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx =

  • ∂Ω

u θ · ♥dy with d′

Ω(θ) satisfying

  • ∇d′

Ω(θ) · ∇dΩ= 0 in D\Σ

d′

Ω(θ)= −θ · ♥ on ∂Ω.

|θ · ♥| θ Ω

slide-31
SLIDE 31
  • 2. A variational method for avoiding integration along rays

More precisely, the shape derivative of P(Ω) reads P′(Ω)(θ) =

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx =

  • ∂Ω

u θ · ♥dy with d′

Ω(θ) satisfying

  • ∇d′

Ω(θ) · ∇dΩ= 0 in D\Σ

d′

Ω(θ)= −θ · ♥ on ∂Ω.

Our method: u solves the following variational problem (with ω > 0 rather arbitrary): Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds +

  • D\Σ

ω(∇dΩ · ∇u)(∇dΩ · ∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx, ♥

slide-32
SLIDE 32
  • 2. A variational method for avoiding integration along rays

More precisely, the shape derivative of P(Ω) reads P′(Ω)(θ) =

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx =

  • ∂Ω

u θ · ♥dy with d′

Ω(θ) satisfying

  • ∇d′

Ω(θ) · ∇dΩ= 0 in D\Σ

d′

Ω(θ)= −θ · ♥ on ∂Ω.

Our method: Take v = d′

Ω(θ):

Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds +

  • D\Σ

ω(∇dΩ · ∇u)(∇dΩ · ∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx, ♥

slide-33
SLIDE 33
  • 2. A variational method for avoiding integration along rays

More precisely, the shape derivative of P(Ω) reads P′(Ω)(θ) =

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx =

  • ∂Ω

u θ · ♥dy with d′

Ω(θ) satisfying

  • ∇d′

Ω(θ) · ∇dΩ= 0 in D\Σ

d′

Ω(θ)= −θ · ♥ on ∂Ω.

Our method: Take v = d′

Ω(θ):

Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds +

  • D\Σ

ω(∇dΩ · ∇u)(∇dΩ · ∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx,

  • ∂Ω

ud′

Ω(θ)ds+

  • D\Σ

ω(∇dΩ·∇u)(∇dΩ · ∇d′

Ω(θ))dx = −

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx,

slide-34
SLIDE 34
  • 2. A variational method for avoiding integration along rays

More precisely, the shape derivative of P(Ω) reads P′(Ω)(θ) =

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx =

  • ∂Ω

u θ · ♥dy with d′

Ω(θ) satisfying

  • ∇d′

Ω(θ) · ∇dΩ= 0 in D\Σ

d′

Ω(θ)= −θ · ♥ on ∂Ω.

Our method: Take v = d′

Ω(θ):

Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds +

  • D\Σ

ω(∇dΩ · ∇u)(∇dΩ · ∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx,

  • ∂Ω

ud′

Ω(θ)ds+

  • D\Σ

ω(∇dΩ·∇u)(∇dΩ · ∇d′

Ω(θ))dx = −

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx,

slide-35
SLIDE 35
  • 2. A variational method for avoiding integration along rays

More precisely, the shape derivative of P(Ω) reads P′(Ω)(θ) =

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx =

  • ∂Ω

u θ · ♥dy with d′

Ω(θ) satisfying

  • ∇d′

Ω(θ) · ∇dΩ= 0 in D\Σ

d′

Ω(θ)= −θ · ♥ on ∂Ω.

Our method: Take v = d′

Ω(θ):

Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds +

  • D\Σ

ω(∇dΩ · ∇u)(∇dΩ · ∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx,

  • ∂Ω

ud′

Ω(θ)ds+

  • D\Σ

ω(∇dΩ·∇u)(∇dΩ · ∇d′

Ω(θ))dx = −

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx,

  • ∂Ω

u (−θ · ♥)ds + 0 = −

  • D\Σ

j′(dΩ(x))d′

Ω(θ)(x)dx.

slide-36
SLIDE 36
  • 2. A variational method for avoiding integration along rays

Our method: solve the variational problem

Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds +

  • D\Σ

ω(∇dΩ · ∇u)(∇dΩ · ∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx (1)

slide-37
SLIDE 37
  • 2. A variational method for avoiding integration along rays

Our method: solve the variational problem

Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds +

  • D\Σ

ω(∇dΩ · ∇u)(∇dΩ · ∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx (1)

Under rather unrestrictive assumptions, the trace of the solution u is independent on the weight ω and is given by

∀y ∈ ∂Ω, u(y) = − ζ+(y)

ζ−(y)

j′(s)

  • 1≤i≤n−1

(1 + κi(y)s)ds. (2)

slide-38
SLIDE 38
  • 2. A variational method for avoiding integration along rays

Our method: solve the variational problem

Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds +

  • D\Σ

ω(∇dΩ · ∇u)(∇dΩ · ∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx (1)

Under rather unrestrictive assumptions, the trace of the solution u is independent on the weight ω and is given by

∀y ∈ ∂Ω, u(y) = − ζ+(y)

ζ−(y)

j′(s)

  • 1≤i≤n−1

(1 + κi(y)s)ds. (2)

(1) can be solved with FEM while (2) requires computing rays and curvatures!

slide-39
SLIDE 39
  • 2. Numerical comparisons

Does it really work? Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds+

  • D\Σ

ω(∇dΩ·∇u)(∇dΩ·∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx

slide-40
SLIDE 40
  • 2. Numerical comparisons

Does it really work? Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds+

  • D\Σ

ω(∇dΩ·∇u)(∇dΩ·∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx The main issue: functions of Vω are discontinuous accross the skeleton:

slide-41
SLIDE 41
  • 2. Numerical comparisons

Does it really work? Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds+

  • D\Σ

ω(∇dΩ·∇u)(∇dΩ·∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx The main issue: functions of Vω are discontinuous accross the skeleton:

slide-42
SLIDE 42
  • 2. Numerical comparisons

Does it really work? Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds+

  • D\Σ

ω(∇dΩ·∇u)(∇dΩ·∇v)dx = −

  • D\Σ

j′(dΩ(x))v(x)dx The main issue: functions of Vω are discontinuous accross the skeleton: We select a weight ω vanishing near the skeleton.

slide-43
SLIDE 43
  • 2. Numerical comparisons

An analytic example...

Figure: A prescribed −j′(dΩ(x))

slide-44
SLIDE 44
  • 2. Numerical comparisons

It works with weights vanishing near the skeleton.

(a) Mesh T ′ (skeleton manually truncated), ω = 1 (b) Mesh T , ω = 1. (c) Mesh T , ω = 2/(1 + |∆dΩ|3.5) Figure: P1 elements with ω = 1 do not allow discontinuities of test functions near the skeleton...

slide-45
SLIDE 45
  • 2. Numerical comparisons

2 4 6 8 0.4 0.6 0.8 1.0 1.2 uAnalytic uRays uVariational

(a) Mesh T ′, ω = 1

2 4 6 8 0.4 0.6 0.8 1.0 1.2 uAnalytic uRays uVariational

(b) Mesh T , ω = 1

2 4 6 8 0.4 0.6 0.8 1.0 1.2 uAnalytic uRays uVariational

(c) Mesh T , ω = 2/(1 + |∆dΩ|3.5)

2 4 6 8 0.4 0.6 0.8 1.0 1.2 uAnalytic uRays uVariational

(d) Finer mesh T , ω = 2/(1 + |∆dΩ|3.5)

slide-46
SLIDE 46
  • 2. Applications to shape and topology optimization

We were able to implement conveniently geometric constraints in level set based shape optimization.

slide-47
SLIDE 47
  • 2. Applications to shape and topology optimization

We were able to implement conveniently geometric constraints in level set based shape optimization.

(a) No maximum thickness constraint (b) dmax = 0.07. Figure: Maximum thickness constraint for 2D arch.

slide-48
SLIDE 48
  • 2. Applications to shape and topology optimization

We were able to implement conveniently geometric constraints in level set based shape optimization.

(a) No minimum thickness constraint. (b) dmin = 0.1. (c) dmin = 0.2

.

Figure: Minimum thickness constraint for 2D cantilever.

slide-49
SLIDE 49

Outline

  • 1. Brief presentation of thickness constraints in Hadamard’s method of

shape differentiation

  • 2. A variational method for avoiding integration along rays
  • 3. A few insights regarding the mathematical framework: weighted

graph spaces of the advection operator β · ∇.

slide-50
SLIDE 50
  • 3. Mathematical analysis of the variational formulation

Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds +

  • D\Σ

ω(∇dΩ · ∇u)(∇dΩ · ∇v)dx =

  • D\Σ

f (x)v(x)dx ∀y ∈ ∂Ω, u(y) = ζ+(y)

ζ−(y)

f (y + s♥(y))

  • 1≤i≤n−1

(1 + κi(y)s)ds ♥

slide-51
SLIDE 51
  • 3. Mathematical analysis of the variational formulation

Find u ∈ Vω such that ∀v ∈ Vω,

  • ∂Ω

uvds +

  • D\Σ

ω(∇dΩ · ∇u)(∇dΩ · ∇v)dx =

  • D\Σ

f (x)v(x)dx ∀y ∈ ∂Ω, u(y) = ζ+(y)

ζ−(y)

f (y + s♥(y))

  • 1≤i≤n−1

(1 + κi(y)s)ds We shall treat a more general setting: U = D\Σ, Γ = ∂Ω, β = ∇dΩ, η(y, s) = y + s♥(y). |Dη|(y, s) =

  • 1≤i≤n−1

(1 + κi(y)s).

slide-52
SLIDE 52
  • 3. Mathematical analysis of the variational formulation

Find u ∈ Vω such that ∀v ∈ Vω,

  • Γ

uvds +

  • U

ω(β · ∇u)(β · ∇v)dx =

  • U

fvdx, ∀y ∈ Γ, u(y) = ζ+(y)

ζ−(y)

(f ◦ η |Dη|)(y, s)ds. We shall treat a more general setting: U = D\Σ, Γ = ∂Ω, β = ∇dΩ, η(y, s) = y + s♥(y). |Dη|(y, s) =

  • 1≤i≤n−1

(1 + κi(y)s).

slide-53
SLIDE 53
  • 3. Mathematical analysis of the variational formulation

Examples of such more general settings:

slide-54
SLIDE 54
  • 3. Mathematical analysis of the variational formulation

Find u ∈ Vω such that ∀v ∈ Vω,

  • Γ

uvds +

  • U

ω(β · ∇u)(β · ∇v)dx =

  • U

fvdx, (3) ◮ The space Vω considered is the so-called graph space Vω =

  • v measurable |
  • U

ωv 2dx < +∞ and

  • U

ω|β · ∇v|2dx < +∞

slide-55
SLIDE 55
  • 3. Mathematical analysis of the variational formulation

Find u ∈ Vω such that ∀v ∈ Vω,

  • Γ

uvds +

  • U

ω(β · ∇u)(β · ∇v)dx =

  • U

fvdx, (3) ◮ The space Vω considered is the so-called graph space Vω =

  • v measurable |
  • U

ωv 2dx < +∞ and

  • U

ω|β · ∇v|2dx < +∞

  • ◮ The well-posedeness of (3) is obtained by Lax-Milgram theorem if

(u, v) →

  • Γ

uvds +

  • U

ω(β · ∇u)(β · ∇v)dx is a coercive bilinear form on Vω.

slide-56
SLIDE 56
  • 3. Mathematical analysis of the variational formulation

Find u ∈ Vω such that ∀v ∈ Vω,

  • Γ

uvds +

  • U

ω(β · ∇u)(β · ∇v)dx =

  • U

fvdx, (3) ◮ The space Vω considered is the so-called graph space Vω =

  • v measurable |
  • U

ωv 2dx < +∞ and

  • U

ω|β · ∇v|2dx < +∞

  • ◮ The well-posedeness of (3) is obtained by Lax-Milgram theorem if

(u, v) →

  • Γ

uvds +

  • U

ω(β · ∇u)(β · ∇v)dx is a coercive bilinear form on Vω. ◮ Ingredients required:

slide-57
SLIDE 57
  • 3. Mathematical analysis of the variational formulation

Find u ∈ Vω such that ∀v ∈ Vω,

  • Γ

uvds +

  • U

ω(β · ∇u)(β · ∇v)dx =

  • U

fvdx, (3) ◮ The space Vω considered is the so-called graph space Vω =

  • v measurable |
  • U

ωv 2dx < +∞ and

  • U

ω|β · ∇v|2dx < +∞

  • ◮ The well-posedeness of (3) is obtained by Lax-Milgram theorem if

(u, v) →

  • Γ

uvds +

  • U

ω(β · ∇u)(β · ∇v)dx is a coercive bilinear form on Vω. ◮ Ingredients required:

◮ Existence of traces on Γ for functions v ∈ Vω

slide-58
SLIDE 58
  • 3. Mathematical analysis of the variational formulation

Find u ∈ Vω such that ∀v ∈ Vω,

  • Γ

uvds +

  • U

ω(β · ∇u)(β · ∇v)dx =

  • U

fvdx, (3) ◮ The space Vω considered is the so-called graph space Vω =

  • v measurable |
  • U

ωv 2dx < +∞ and

  • U

ω|β · ∇v|2dx < +∞

  • ◮ The well-posedeness of (3) is obtained by Lax-Milgram theorem if

(u, v) →

  • Γ

uvds +

  • U

ω(β · ∇u)(β · ∇v)dx is a coercive bilinear form on Vω. ◮ Ingredients required:

◮ Existence of traces on Γ for functions v ∈ Vω ◮ Poincar´ e inequality ∀v ∈ Vω,

  • U

ωv 2dx ≤ C

  • Γ

v 2dy +

  • U

ω|β · ∇v|2dx

slide-59
SLIDE 59
  • 3. Mathematical analysis of the variational formulation

Vω =

  • v measurable |
  • U

ωv 2dx < +∞ and

  • U

ω|β · ∇v|2dx < +∞

  • Ingredients required:

◮ Existence of traces on Γ for functions v ∈ Vω ◮ Poincar´ e inequality ∀v ∈ Vω,

  • U

ωv 2dx ≤ C

  • Γ

v 2dy +

  • U

ω|β · ∇v|2dx

slide-60
SLIDE 60
  • 3. Mathematical analysis of the variational formulation

Vω =

  • v measurable |
  • U

ωv 2dx < +∞ and

  • U

ω|β · ∇v|2dx < +∞

  • Ingredients required:

◮ Existence of traces on Γ for functions v ∈ Vω ◮ Poincar´ e inequality ∀v ∈ Vω,

  • U

ωv 2dx ≤ C

  • Γ

v 2dy +

  • U

ω|β · ∇v|2dx

  • In the literature, ω = 1 (often) and div(β) ∈ L∞(U).
slide-61
SLIDE 61
  • 3. Mathematical analysis of the variational formulation

Vω =

  • v measurable |
  • U

ωv 2dx < +∞ and

  • U

ω|β · ∇v|2dx < +∞

  • Ingredients required:

◮ Existence of traces on Γ for functions v ∈ Vω ◮ Poincar´ e inequality ∀v ∈ Vω,

  • U

ωv 2dx ≤ C

  • Γ

v 2dy +

  • U

ω|β · ∇v|2dx

  • In the literature, ω = 1 (often) and div(β) ∈ L∞(U).

Here β = ∇dΩ and div(∇dΩ) / ∈ L∞(U). We need a different analysis.

slide-62
SLIDE 62
  • 3. Mathematical analysis of the variational formulation

The key idea: use the flow η(y, s) of β ∈ C1(U) to do a change of variables x = η(y, s).    d ds η(y(s), s) = β(η(y(s), s)), η(0, y) = y, ∀y ∈ Γ

slide-63
SLIDE 63
  • 3. Mathematical analysis of the variational formulation

Examples of such more general settings:

slide-64
SLIDE 64
  • 3. Mathematical analysis of the variational formulation

The key idea: use the flow η(y, s) of β ∈ C1(U) to do a change of variables x = η(y, s).    d ds η(y(s), s) = β(η(y(s), s)), η(0, y) = y, ∀y ∈ Γ

slide-65
SLIDE 65
  • 3. Mathematical analysis of the variational formulation

The key idea: use the flow η(y, s) of β ∈ C1(U) to do a change of variables x = η(y, s).    d ds η(y(s), s) = β(η(y(s), s)), η(0, y) = y, ∀y ∈ Γ Replace the space

Vω =

  • v |
  • U

ωv 2dx < +∞ and

  • U

ω|β · ∇v|2dx < +∞

slide-66
SLIDE 66
  • 3. Mathematical analysis of the variational formulation

The key idea: use the flow η(y, s) of β ∈ C1(U) to do a change of variables x = η(y, s).    d ds η(y(s), s) = β(η(y(s), s)), η(0, y) = y, ∀y ∈ Γ Replace the space

Vω =

  • v |
  • U

ωv 2dx < +∞ and

  • U

ω|β · ∇v|2dx < +∞

  • by
  • Vα =
  • ˜

v |

  • Γ

ζ+(y)

ζ−(y)

α˜ v 2dsdy < +∞ and

  • Γ

ζ+(y)

ζ−(y)

α|∂s ˜ v|2dsdy < +∞

  • .

with α = ω ◦ η|Dη|.

slide-67
SLIDE 67
  • 3. Mathematical analysis of the variational formulation
  • Vα =
  • ˜

v |

  • Γ

ζ+(y)

ζ−(y)

α˜ v 2dsdy < +∞ and

  • Γ

ζ+(y)

ζ−(y)

α|∂s ˜ v|2dsdy < +∞

  • .
slide-68
SLIDE 68
  • 3. Mathematical analysis of the variational formulation
  • Vα =
  • ˜

v |

  • Γ

ζ+(y)

ζ−(y)

α˜ v 2dsdy < +∞ and

  • Γ

ζ+(y)

ζ−(y)

α|∂s ˜ v|2dsdy < +∞

  • .

Existence of traces and Poincar´ e inequality in Vα are obtained for quite general weights α satisfying the following assumptions:

slide-69
SLIDE 69
  • 3. Mathematical analysis of the variational formulation
  • Vα =
  • ˜

v |

  • Γ

ζ+(y)

ζ−(y)

α˜ v 2dsdy < +∞ and

  • Γ

ζ+(y)

ζ−(y)

α|∂s ˜ v|2dsdy < +∞

  • .

Existence of traces and Poincar´ e inequality in Vα are obtained for quite general weights α satisfying the following assumptions:

  • 1. α(y, s) > 0 is positive and continuous.
slide-70
SLIDE 70
  • 3. Mathematical analysis of the variational formulation
  • Vα =
  • ˜

v |

  • Γ

ζ+(y)

ζ−(y)

α˜ v 2dsdy < +∞ and

  • Γ

ζ+(y)

ζ−(y)

α|∂s ˜ v|2dsdy < +∞

  • .

Existence of traces and Poincar´ e inequality in Vα are obtained for quite general weights α satisfying the following assumptions:

  • 1. α(y, s) > 0 is positive and continuous.
  • 2. The function

gα : y − → ζ+(y)

ζ−(y)

α(y, s)ds is uniformly bounded, i.e. gα ∈ L∞(Γ).

slide-71
SLIDE 71
  • 3. Mathematical analysis of the variational formulation
  • Vα =
  • ˜

v |

  • Γ

ζ+(y)

ζ−(y)

α˜ v 2dsdy < +∞ and

  • Γ

ζ+(y)

ζ−(y)

α|∂s ˜ v|2dsdy < +∞

  • .

Existence of traces and Poincar´ e inequality in Vα are obtained for quite general weights α satisfying the following assumptions:

  • 1. α(y, s) > 0 is positive and continuous.
  • 2. The function

gα : y − → ζ+(y)

ζ−(y)

α(y, s)ds is uniformly bounded, i.e. gα ∈ L∞(Γ).

  • 3. The function

hα : y − → ζ+(y)

ζ−(y)

  • α(y, s)

s α−1(y, t)dt

  • ds

is uniformly bounded: hα ∈ L∞(Γ).

slide-72
SLIDE 72
  • 3. Mathematical analysis of the variational formulation

An example: the circle Ω = {x ∈ R2 | ||x||2 < 1}. ◮ U = Ω\{0} ❡

slide-73
SLIDE 73
  • 3. Mathematical analysis of the variational formulation

An example: the circle Ω = {x ∈ R2 | ||x||2 < 1}. ◮ U = Ω\{0} ◮ dΩ(x) = r − 1, ∇dΩ = ❡r, div(∇dΩ) = 1

r , α = r.

slide-74
SLIDE 74
  • 3. Mathematical analysis of the variational formulation

An example: the circle Ω = {x ∈ R2 | ||x||2 < 1}. ◮ U = Ω\{0} ◮ dΩ(x) = r − 1, ∇dΩ = ❡r, div(∇dΩ) = 1

r , α = r.

◮ The third assumption is satisfied because 1 r s

1

1 t dtdr = 1 s log(s)ds < +∞

slide-75
SLIDE 75
  • 3. Mathematical analysis of the variational formulation

An example: the circle Ω = {x ∈ R2 | ||x||2 < 1}, U = Ω \ {0}. Poincar´ e inequality to prove (weight ω = 1) is

  • U

f 2dx ≤

  • U

|❡r · ∇f |2dx +

  • ∂Ω

f 2dy With polar coordinates for a radial function f : 1 f (r)2rdr ≤ C

  • f (1)2 +

1 f ′(r)2rdr

slide-76
SLIDE 76
  • 3. Mathematical analysis of the variational formulation

To prove for f ∈ C1([0, 1]): 1 f (r)2rdr ≤ C

  • f (1)2 +

1 f ′(r)2rdr

slide-77
SLIDE 77
  • 3. Mathematical analysis of the variational formulation

To prove for f ∈ C1([0, 1]): 1 f (r)2rdr ≤ C

  • f (1)2 +

1 f ′(r)2rdr

  • ◮ Write f (r) = f (1) +

r

1 f ′(t)dt (*)

slide-78
SLIDE 78
  • 3. Mathematical analysis of the variational formulation

To prove for f ∈ C1([0, 1]): 1 f (r)2rdr ≤ C

  • f (1)2 +

1 f ′(r)2rdr

  • ◮ Write f (r) = f (1) +

r

1 f ′(t)dt (*)

◮ Use Cauchy-Schwartz inequality:

  • r

1

f ′(t)dt

r

1

|f ′(t)|t1/2t−1/2dt ≤ 1 f ′(r)2rdr 1/2 r

1

1 t dt 1/2

slide-79
SLIDE 79
  • 3. Mathematical analysis of the variational formulation

To prove for f ∈ C1([0, 1]): 1 f (r)2rdr ≤ C

  • f (1)2 +

1 f ′(r)2rdr

  • ◮ Write f (r) = f (1) +

r

1 f ′(t)dt (*)

◮ Use Cauchy-Schwartz inequality:

  • r

1

f ′(t)dt

r

1

|f ′(t)|t1/2t−1/2dt ≤ 1 f ′(r)2rdr 1/2 r

1

1 t dt 1/2 ◮ Use Young’s inequality (a + b)2 ≤ 2a2 + 2b2, multiply (*) by r and integrate: 1 f (r)2rdr ≤ 2f (1)2 1 rdr + 2 1 f ′(r)2rdr 1 r r

1

1 t dtdr

  • Whence the result.
slide-80
SLIDE 80

Preprint

Thank you for your attention.

Much more details in the preprint. Feppon, F., Allaire, and Dapogny, C. A variational formulation for computing shape derivatives of geometric constraints along rays. HAL preprint hal-01879571. (2018)