Convex relaxation and variational approximation of functionals defined on 1-d connected sets
- M. Bonafini1
- G. Orlandi1
- E. Oudet3
1(Verona), 3(Grenoble)
BIRS Banff, May 2, 2017
- M. Bonafini, G. Orlandi, E. Oudet
Euclidean Steiner tree problem 2/91/17
Convex relaxation and variational approximation of functionals - - PowerPoint PPT Presentation
Convex relaxation and variational approximation of functionals defined on 1-d connected sets M. Bonafini 1 G. Orlandi 1 E. Oudet 3 1 (Verona), 3 (Grenoble) BIRS Banff, May 2, 2017 M. Bonafini, G. Orlandi , E. Oudet Euclidean Steiner tree problem
1(Verona), 3(Grenoble)
Euclidean Steiner tree problem 2/91/17
Euclidean Steiner tree problem 2/91/17
Euclidean Steiner tree problem 2/91/17
Euclidean Steiner tree problem 2/91/17
N−1
Euclidean Steiner tree problem 2/91/17
(picture from [Oudet-Santambrogio])
Euclidean Steiner tree problem 2/91/17
N
Euclidean Steiner tree problem 2/91/17
Euclidean Steiner tree problem 2/91/17
Euclidean Steiner tree problem 2/91/17
Euclidean Steiner tree problem 2/91/17
N
N
N
i∈Λ gi|| = 1 ensures both connectedness and ||T|| = |Li|.
Euclidean Steiner tree problem 2/91/17
i=1 ei
Euclidean Steiner tree problem 2/91/17
|E+ (resp. ℓq |E+)
Euclidean Steiner tree problem 2/91/17
c)∗ of polyhedral G-chains.
j gj(x)ej with gj(x) ∈ Z and accordingly T = j T jej,
Euclidean Steiner tree problem 2/91/17
j ωj(x)ej ∈ E∗ ⊗ Λ∗(Rk).
j dωj(x)ej
j ∂T jej.
i gi ⊗ τi)|µT|,
iθ(x), gi(x) · φ(x), τi(x)d|µT|
c)∗ closure and compactness theorem for N-bdd normal and
Euclidean Steiner tree problem 2/91/17
i=1 gi ⊗ δPi, (MG) is equivalent to (Mα) in view of
j Uj + ℓ Cℓ, with ||T|| = j ||Uj|| + ℓ ||Cℓ||
Euclidean Steiner tree problem 2/91/17
Euclidean Steiner tree problem 2/91/17
Euclidean Steiner tree problem 2/91/17
i=1 giδPi,
1 k−1 ⋆ d(u∗(ρk−1volSk−2)) = 1 k−1 ⋆ d(k−1 j=1 (−1)j+1uj
Euclidean Steiner tree problem 2/91/17
2∇ × (u1 i ∇u2 i − u2 i ∇u1 i )
Euclidean Steiner tree problem 2/91/17
j=1 gjej) ⊗ τH1
j=1 µjej,
j=1 Jujej. Denote U = (u1, ..., uN−1), we have, for k ≥ 3,
1≤j≤N−1
1≤j≤N−1
1≤j≤N−1
Euclidean Steiner tree problem 2/91/17
j=1 Rjej,
j ωjej, Ψ = j ψjej, recall d∗ = − ∗ d∗ on 2-forms. We
1≤j≤N−1
1≤j≤N−1
1≤i<j≤k θijdxi ∧ dxj in Rk we have
k
1≤j<i
Euclidean Steiner tree problem 2/91/17
1≤j≤N−1
1≤j≤N−1
Euclidean Steiner tree problem 2/91/17
j ξjej the matrix-valued measure form representing T0, and
j φjej be a test form. Then
1≤j≤N−1
j=1 φj(x)|.
Euclidean Steiner tree problem 2/91/17
j=1 ej ⊗ (δPj − δPN), let T = j µjej a normal E-current
j
j
Euclidean Steiner tree problem 2/91/17
(uh
i )1i<N2L, ( h P )P ⇥{1,...,N⇤1}2(R2T )2N⇤1
t2T
P{1,...,N⇥1}
P )t|
i )t =
P{1,...,N⇥1}, i2P
P )t
Euclidean Steiner tree problem 2/91/17
\i
h(uh i ) =
\i
i |2 + 1
i )
h (uh i ) =
\i
i=1
h(uh i )1/⇥
Euclidean Steiner tree problem 2/91/17
ǫ2 (|u|2 − 1)2, with
0(Ω))∗,
ǫ2 sin2(πu), with
Euclidean Steiner tree problem 2/91/17
ǫ (u) =
ǫ (u)dx =
ǫ2 sin2(πu), with
ǫ there exists u ∈ BV(R2; Z) s.t.
ǫ (uǫ) → c0|µ + ∇⊤u|(R2)
Euclidean Steiner tree problem 2/91/17
j=1 ej ⊗ (δPj − δPN), T0 = N−1 j=1 µjej s.t.
1≤j≤N−1
µj ǫ (uj) dx.
Euclidean Steiner tree problem 2/91/17
ǫ (u) =
ǫ (u)dx =
ǫ .
0(Ω))∗,
Euclidean Steiner tree problem 2/91/17
j=1 ej ⊗ (δPj − δPN), T0 = N−1 j=1 µjej s.t.
1≤j≤N−1
µj ǫ (uj) dx.
0(R3))∗, 1 |log ε|Fǫ(Uǫ) → F(U) and
Euclidean Steiner tree problem 2/91/17
ǫ (u) =
ǫ (u)dx =
ǫ .
0(Ω))∗,
Euclidean Steiner tree problem 2/91/17
Euclidean Steiner tree problem 2/91/17
\i
h(uh i ) =
\i
i |2 + 1
i )
Euclidean Steiner tree problem 2/91/17
V
1≤i≤N−1
Euclidean Steiner tree problem 2/91/17
Euclidean Steiner tree problem 2/91/17