Optimal reinforcing networks for elastic membranes
Giovanni Alberti, Giuseppe Buttazzo, Serena Guarino Lo Bianco, Edouard, Oudet

TL;DR
This paper investigates the optimal reinforcement of elastic membranes using networks, proving existence of solutions, including overlapping regions, and illustrating the complexity through numerical simulations.
Contribution
It establishes the existence of optimal reinforcement networks with possible overlaps and demonstrates their complexity via numerical examples.
Findings
Optimal networks may have overlapping regions.
Existence of solutions is mathematically proven.
Numerical simulations illustrate complex network structures.
Abstract
In this paper we study the optimal reinforcement of an elastic membrane, fixed at its boundary, by means of a network (connected onedimensional structure), that has to be found in a suitable admissible class. We show the existence of an optimal solution that may present multiplicities, that is regions where the optimal structure overlaps. Some numerical simulations are shown to confirm this issue and to illustrate the complexity of the optimal network when their total length becomes large.
| Length constraint | Theoretical guesses | Computed optimal networks |
|---|---|---|
| 1 | -0.179471 (radius) | -0.178873 |
| 2 | -0.165095 (diameter) | -0.161944 |
| 3 | -0.152676 (star) | -0.149601 |
| 4 | -0.141969 (cross) | -0.138076 |
| 5 | - | -0.127661 |
| 6 | - | -0.117140 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsContact Mechanics and Variational Inequalities · Advanced Mathematical Modeling in Engineering · Stability and Controllability of Differential Equations
[version: May 15, 2019] to appear on Netw. Heterog. Media
**Optimal reinforcing networks for elastic membranes
**
Giovanni Alberti, Giuseppe Buttazzo, Serena Guarino Lo Bianco,
and Édouard Oudet
Abstract. In this paper we study the optimal reinforcement of an elastic membrane, fixed at its boundary, by means of a network (connected one-dimensional structure), that has to be found in a suitable admissible class. We show the existence of an optimal network, and observe that such network carries a multiplicity that in principle can be strictly larger than one. Some numerical simulations are shown to confirm this issue and to illustrate the complexity of the optimal network when the total length becomes large.
Keywords: Optimal networks, elastic membranes, reinforcement, relaxed solution, Golab’s semicontinuity theorem.
MSC (2010): 49J45, 49Q10, 35R35, 35J25, 49M05.
1. Introduction
In the present paper we consider the vertical displacement of an elastic membrane under the action of an exterior load and fixed at its boundary; this amounts to solve the variational problem
[TABLE]
or equivalently the elliptic PDE
[TABLE]
Here is a bounded Lipschitz domain of , , and is the usual Sobolev space of functions with zero trace on the boundary .
Our goal is to rigidify the membrane by adding a one-dimensional reinforcement in the most efficient way; the reinforcement is described by a one-dimensional set which varies in a suitable class of admissible choices. The effect of on the membrane is described by the energy
[TABLE]
that has to be maximized in the class of admissible choices for .
Here is a fixed parameter that represents the stiffness coefficient of the one-dimensional reinforcement, denotes the 1-dimensional Hausdorff measure (that is, the length measure), while denotes the class of smooth functions with compact support in .
The optimization problem we deal with consists in finding the “best” reinforcement among all networks with total length bounded by a prescribed , that is, all in the class
[TABLE]
We then consider the maximization of the energy functional in (1.2) over this class, that is
[TABLE]
1.1. Gradient versus tangential gradient
From the modeling point of view, it is natural to ask whether the gradient that appears in the line integral
[TABLE]
in (1.2) should be replaced by the tangential gradient . It turns out that the question is irrelevant, at least if we strictly follow a variational approach, because the value of is not affected by this change (Theorem 2.5).
Indeed, if is a compact curve of class contained in , it is well-known (see for instance [5]) that the relaxation of the integral
[TABLE]
is given by
[TABLE]
This relaxation result holds also when is a compact connected set with finite length, provided that and are properly defined (this statement is implicitly contained in Proposition 2.11). However, we warn the reader that this relaxation result does not holds if is an arbitrary compact subset of a curve of class with positive length; in particular, if is totally disconnected then the relaxation of is equal to [math] for every .
1.2. Concentrated loads
Besides the case of distributed loads, which consists in assuming that belongs to some Lebesgue class , we may also consider the case of concentrated loads, in which may have a more singular behavior. More precisely, we may assume that is a signed measure on . (In this case the linear term in (1.2) should be written as .)
We recall that a measure does not necessarily belong to the dual of the Sobolev space , and therefore for some choices of . Clearly, if is finite for at least one problem (1.3) still makes sense, and we may discard all such that . However, it may happen that for every in and in that case problem (1.3) does not makes sense (see Example 2.8).
1.3. An optimization problem in a model for traffic congestion
Another optimization problem requiring a similar analytical approach arises in a model for the reduction of traffic congestion in a given geographic area. Here the minimum problem is
[TABLE]
where and in the region the function represents the density of residents while is the density of working places. The vector is the traffic flux and the function describes the transportation cost; the case gives the classical Monge’s problem, while we talk of congested transport if the function is super-linear at infinity, that is,
[TABLE]
We refer to [4, 6, 7, 19] and to the references therein for a detailed description of this model. In the case , the minimization problem (1.4) reduces, via a duality argument, to a problem of the form (1.1).
The optimization problem arises when a new road, or network of roads, has to be built to reduce the congestion; the total length is prescribed and on the new road the congestion function is strictly lower than , for example with . The problem then consists in finding the optimal one-dimensional set , and we end up, via a duality argument, with a problem similar to (1.3), with .
1.4. Relaxed formulation of the optimization problem
The optimization problem (1.3) is solved, in a suitable relaxed form, in Section 2, to which we refer for precise statements and definitions.
We explain first the need for a relaxed formulation. Consider a maximizing sequence for problem (1.3): since these sets are closed, connected, and satisfy , they converge, up to subsequence and in Hausdorff distance, to some connected compact set with contained in the closure . The problem is that the functional is not upper semicontinuous in with respect to Hausdorff convergence, and therefore may be not a solution of problem (1.3).
However it turns out that is upper semicontinuous if we identify the sets with the measures \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S, namely the restrictions of the Hausdorff measure to , and consider the weak* convergence of measures instead of the Hausdorff convergence of sets. More precisely, we extend the energy functional (1.2) to general positive measures on by setting
[TABLE]
(here we assume that the load is a signed measure). Notice that this new functional extends the previous one in the sense that when \mu=\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S, and it is upper semicontinuous with respect to the weak* convergence of (Proposition 3.1).
The problem now is that weak* limits of measures of the form \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S are not necessarily measures of the same form, and in particular the limit of the measures \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S_{n} is a measure supported on the set , but may be not the measure \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S_{\infty}; if it is, then is a solution of the optimization problem (1.3), but otherwise it is not.
These considerations lead to the following relaxed version of problem (1.3):
[TABLE]
where is the class of all weak* limits of measures of the form \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S with admissible network, that is, .
The class is completely described in Proposition 2.1, and the existence of a solution of the relaxed optimization problem (1.5) is proved in Theorem 2.2. In Theorem 2.6 we show that there is always a solution of the form \mu=\theta\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S where is a compact, connected set with finite length contained in , and is a real-valued multiplicity function which satisfies for -a.e. .
If for -a.e. then is a solution of the original optimization problem (1.3). If not, then problem (1.3) may have no solution.
In Section 5 we present some numerical simulations which show unexpected behaviors of the optimal measures ; in particular we have evidence that in some situations (and perhaps most situations) the multiplicity may be strictly larger than in a subset of positive length of .
1.5. Final remarks
(i) We do not know if problem (1.5) is “the” relaxation of problem (1.3), and in particular we cannot exclude that some kind of Lavrentiev phenomenon occurs (for more details see Problem 6.2 and Remark 6.3).
(ii) The connectedness assumption on is crucial: indeed, removing this constraint allows a sequence of maximizing sets to spread all over and leads to a relaxed problem of the form
[TABLE]
where is the class of all positive measures on . This optimization problem has been studied in [12] and in [8], where it is shown that the optimal measure actually belongs to and the exponent depends on the summability of the right-hand side . Similar problems, in the extreme case when in the reinforcing region a Dirichlet condition is imposed, have been considered in [10, 11].
(iii) In the definitions of and we required that belongs to to ensure that all integrals makes sense. Clearly it would be equivalent to consider continuous functions in that are of class in a neighborhood of or of the support of . One can go further, and take in a suitably defined Sobolev space, so that the infimum in the definition of is a minimum (Proposition 2.11).
(iv) In our model the stiffener is a one-dimensional set and its contribution to the total energy is described by the line integral
[TABLE]
This choice is consistent with the fact that the integral above is the variational limit as of the integrals
[TABLE]
where is the thin strip S_{\varepsilon}:=\big{\{}x\in\mathbb{R}^{2}\colon\operatorname{dist}(x,S)<\varepsilon/2\big{\}}. In other words, the one-dimensional stiffener can be seen as the limit structure of two-dimensional thin strips of thickness and elastic constants (see for instance [18] and [3]).
Structure of the paper
In Section 2 we give a precise formulation of the relaxed optimization problem, and state the main existence results (Theorems 2.2 and 2.6). In Section 3 we prove the results stated in Section 2. In Section 4 we give some additional properties that solution of the relaxed optimization problem must satisfy. Section 5 is devoted to the numerical approximation of the relaxed problem. Section 6 contains additional remarks and open problems.
Acknowledgements
This work is part of the PRIN projects 2017TEXA3H and 2017BTM7SN, funded by the Italian Ministry of Education and Research (MIUR). The first three authors are members of the research group GNAMPA of INdAM. Édouard Oudet gratefully acknowledges the support of the ANR through projects COMEDIC and OPTIFORM, and the support of the Labex Persyval Lab through project GeoSpec.
2. Existence of solutions of the relaxed problem
Let us fix/recall the basic notation. Unless we specify otherwise, for the rest of this paper is a bounded Lipschitz domain in , the load is a signed measure on , the class of admissible reinforcements consists of all closed connected subsets of with .
For every the functional is defined by formula (1.2), with the linear term written as because is now a measure. The optimization problem (1.3) consists in finding the maximum of among all , and it makes sense provided that is not identically (see Subsection 1.2).
In the following we assume that is finite for some set .
As explained in Subsection 1.4, we denote by the class of all positive finite measures on , and extend the to all in by
[TABLE]
where
[TABLE]
Then we denote by the weak* closure in of the class of all measures of the form \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S with , in short
[TABLE]
and the relaxed optimization problem (1.5) consists in finding the maximum of among all .
Proposition 2.1**.**
The class consist of all such that
- (a)
;
- (b)
the support of is a connected, compact set in with ;
- (c)
\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S\leq\mu.
We can now state our first existence result:
Theorem 2.2**.**
The optimization problem (1.5) admits a solution .
Let be a measure in with support . We want to show that the value of is not affected if we replace the full gradient in the integral in (2.2) with the tangential gradient , and if we remove from the measure the part which is singular with respect to \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S.
To this purpose we need to recall some well-known properties of connected sets with finite length (for more details we refer to standard references, such as [14]).
2.3. Connected sets with finite length
Let be a compact connected set in with finite length. Then is rectifiable, which means that it can be covered (up to an -negligible subset) by countably many embedded curves of class , and indeed it can be parametrized (although not bijectively) by a single Lipschitz path.
Moreover admits a tangent line at -a.e. . Thus, for every such and every of class we can define the tangential gradient .
2.4. The functionals
and
Let be a measure in of the form
[TABLE]
where is a compact connected set in with finite length. We set
[TABLE]
where
[TABLE]
Theorem 2.5**.**
Let be a measure in with support , and let be the absolutely continuous part of with respect to \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S. Then
[TABLE]
This statement shows that the maximum problem (1.5) can be reformulated as the maximum of , or equivalently of , on the class
[TABLE]
In view of Proposition 2.1, agrees with the class of all measures of the form \mu=\theta\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S where
- (a)
is a compact connected set in with ,
- (b)
is a real-valued multiplicity function with for -a.e. ,
- (c)
.
The following improvement of Theorem 2.2 holds:
Theorem 2.6**.**
Problem (1.5) admits a solution in the class with , which is therefore a solution of
[TABLE]
If in addition belongs to for some and the support of is , then every solution of problem (1.5) belongs to and satisfies .
Remark 2.7**.**
(i) The first part of Theorem 2.6 is little more than a corollary of Theorem 2.5. The second part, however, requires a more delicate argument.
(ii) The assumption that the support of is in the second part of Theorem 2.6 can probably be weakened, but not entirely removed. Indeed if then for every , and in particular every is a solution of problem (1.5).
(iii) As already pointed out in Subsection 1.4, if the solution \mu=\theta\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S given by Theorem 2.6 verifies a.e., that is, \mu=\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S, then is a solution of the original optimization problem (1.3). However, the following example suggests that this is not always the case.
Example 2.8**.**
Let be two points in such that the closed segment is contained in , and let . Regarding the maximization problem (1.5) three possibilities may occur, depending on the choice of :
- •
If then we have for every in the class . Indeed, since a connected set of length cannot contain both and , and since the capacity of a point in the plane is zero, we may construct a sequence of function which vanish on , tend to [math] in , and satisfy .
- •
If then the unique set for which the energy is not is the segment , which is then the unique solution of the maximization problem (1.3), while \mu:=\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S is the unique solution of problem (1.5).
- •
If and \mu=\theta\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S is a solution of problem (1.5) as in Theorem 2.6, then the numerical simulations in Section 5 give a strong indication that on a subset of with positive length.
We conclude this section by defining the Sobolev space , and showing that the infimum in formula (2.3) is actually a minimum. This fact will be used in the proof of the second part of Theorem 2.6.
2.9. The Sobolev space
Let be a compact connected set in with finite length . Using [2, Theorem 4.4] we obtain a closed Lipschitz path which parametrizes , and more precisely
- •
has multiplicity at -a.e. , that is, ;
- •
for a.e. .
We then define the Sobolev space as the space of all continuous functions such that the composition belongs to , where .111 It can be proved that given a function in and a Lipschitz function such that for some given positive and for a.e. , then belongs to . In particular the definition of does not depend on the choice of the parametrization .
Note that for a.e. the vector spans , that is, the tangent line to at . Therefore a function is differentiable along for -a.e. and the tangential derivative satisfies
[TABLE]
Thus the area formula for Lipschitz maps yields
[TABLE]
and
[TABLE]
We endow with the Hilbert norm
[TABLE]
2.10. The Sobolev space
Let be a connected compact set in with finite length . Since is rectifiable, we can find a strictly positive (Borel) density function such that the trace operator
[TABLE]
is well defined and bounded.222 Take for instance countably many compact curves of class in that cover -almost all of , let be the norm of the trace operators , and set
Then we define as the space of all such that agrees a.e. with a function in . In the following we tacitly assume that agrees on with the representative of the trace in , and in particular is continuous on . We endow with the Hilbert norm
[TABLE]
(Completeness can be proved using the continuity of the trace operator .) Using the fact that functions of class on intervals do not admit discontinuities of jump type, one can prove that for every in , there holds
[TABLE]
Proposition 2.11**.**
Let be a measure of the form \mu=\theta\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S where is a compact connected set with finite length in and the multiplicity is larger than some positive constant. If belongs to for some then is finite and
[TABLE]
3. Proofs of the results in Section 2
Through this section, given a matrix we denote by the operator norm.
Proposition 3.1**.**
The functional defined in (2.1) is weakly upper semicontinuous on .*
Proof.
Just notice that is defined as the infimum of over all in and is clearly weakly* continuous in for every such , cf. (2.2). ∎
Proof of Theorem 2.2.
This statement follows from Proposition 3.1 and the weak* compactness of the class (an immediate consequence of its definition). ∎
To prove Proposition 2.1 we need the following results, which we state in even if we need only the case .
Proposition 3.2**.**
Let be a sequence of compact connected sets in which converge to a set in the Hausdorff distance, let be a sequence of positive finite measures on which converge to a measure in the weak sense, and assume that*
- •
* is supported on and \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S_{n}\leq\mu_{n};*
- •
* for some finite constant .*
Then
- •
* is supported on and \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S\leq\mu;*
- •
.
Proof.
The fact that is supported on follows easily from the weak* convergence of to and the convergence of to in the Hausdorff distance.
The inequality is Gołąb’s semicontinuity theorem (see [15, Section 3], or [2, Theorem 2.9]).
The inequality \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S\leq\mu can be viewed as a localized version of Gołąb’s theorem, and the proof is slightly more complicated. Using [2, Theorem 4.4], we obtain that each can be parametrized by a closed path such that
- •
has multiplicity at -a.e. , that is, ;
- •
has degree [math] at -a.e. (for a precise definition see [2, §4.1]);
- •
each has Lipschitz constant .
Passing to a subsequence we can assume that the paths converge uniformly to some with , and one easily checks that parametrizes . Moreover [2, Proposition 4.3] shows that has degree [math] and in particular has multiplicity at least 2 at -a.e. .
Therefore, for every positive test function there holds
[TABLE]
The first inequality follows from the assumption \mu_{n}\geq\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S_{n} and the fact that is positive, the second equality and the third inequality follow from the area formula for Lipschitz maps, and finally the second inequality follows by a standard semicontinuity argument.
We have thus proved that
[TABLE]
for every test function , which yields the desired inequality \mu\geq\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S. ∎
Lemma 3.3**.**
Let be a connected compact set with finite length in , and let be a positive finite measure supported on such that \mu\geq\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S. Then there exists a sequence of connected compacts sets in such that
- •
* for every ,*
- •
the sets converge to in the Hausdorff distance;
- •
the measures \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S_{n} converge weakly to .*
Proof.
Choose a unit vector which is not in the approximate tangent line to at for -a.e. . Consider then the measure \lambda:=\mu-\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S. Since is positive and supported on , it can be approximated by a sequence of positive discrete measures
[TABLE]
where
- •
the points belong to ,
- •
the coefficients converge uniformly to [math] as ,
- •
for every , that is, .
Thanks to the choice of we can further require that
- •
is not parallel to for every and every .
Finally we set
[TABLE]
where is the closed segment with endpoints and . By the choice of the points we have that the segments are pairwise disjoint (for fixed ) and have negligible intersection with . Now it is easy to check that the sets have the required properties. ∎
Proof of Proposition 2.1.
We first prove that every measure satisfies properties (a)–(c) in Proposition 2.1. Take indeed a sequence of sets such that \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S_{n} weakly* converge to . Possibly passing to a subsequence we can assume that the sets converge in Hausdorff distance to some compact connected set contained in . Then Proposition 3.2 implies that is the support of and belongs to .
The converse implication, namely that every positive measure that satisfies properties (a)-(c) belongs to , follows from Lemma 3.3. ∎
The proof of Theorem 2.5 is split in two parts (Propositions 3.9 and 3.12), the proofs of which require several lemmas. Some of these lemmas are stated in general dimension even if we only need the case .
Lemma 3.4**.**
Let be a compact set with . For every there exists a function of class such that
- •
* for all ;*
- •
* in a neighborhood of ;*
- •
* for all ;*
- •
the open set satisfies .
Proof.
For every let
- •
be the open -neighborhood of ;
- •
be a smooth regularizing kernel with support contained in ,
- •
and be a primitive of such that .
One easily checks that and are smooth functions and satisfy the following properties:
- •
for every , which implies ;
- •
if then , hence , and ;
- •
if then , hence and ;
- •
for every , .
Notice now that since is compact then converges to as , and therefore we can find such that . We conclude the proof by setting . ∎
Lemma 3.5**.**
Let be a compact set in , , with For every there exist a map of class and an open set such that
- (i)
* for all ;*
- (ii)
* in a neighborhood of ;*
- (iii)
* for all .*
Moreover, having fixed , we can further require that , where is the -identity matrix, out of an open set with .
Proof.
Fix for the time being , to be properly chosen later. For let be the projection of on the -th coordinate axis, and let be the function obtained by applying Lemma 3.4 with and in place of and , and let be the set where . Let
[TABLE]
It is easy to check that has properties (i)-(iii) for small enough. Moreover is contained in the set of all such that for some , and therefore , which is less that for small enough. ∎
Lemma 3.6**.**
Let be measures in and assume that where is a positive measure supported on a Borel set with . Then for every and every there exist such that and
[TABLE]
Proof.
We fix for the time being , to be chosen properly through the proof. Then we choose a compact set such that , we let be the map constructed in Lemma 3.5 for the set , and we set
[TABLE]
The function is clearly smooth and compactly supported on , and the support is contained in for sufficiently small.
The rest of the proof is divided in three steps. In the following we use the letter to denote any constant that may depend on and but not on ; the value of may change at every occurrence.
Step 1. Estimate of . Using property (i) in Lemma 3.5 we obtain
[TABLE]
which implies if we choose small enough.
Step 2. Estimates of . Using property (iii) in Lemma 3.5 we obtain
[TABLE]
Step 3. Proof of estimate (3.1). Property (ii) in Lemma 3.5 implies that on . Using this fact and the estimate in Step 2, and recalling the choice of , we obtain
[TABLE]
which implies the desired estimate if we choose small enough. ∎
Lemma 3.7**.**
Let be as in Lemma 3.6. Then for every and every there exist such that and
[TABLE]
Proof.
Consider the measures and , where is the Lebesgue measure on , and fix , to be chosen later.
Let now be the function obtained by applying Lemma 3.6 with , , in place of , , . Then and
[TABLE]
where is the total mass of the signed measure . Thus estimate (3.2) follows by choosing sufficiently small. ∎
Lemma 3.8**.**
Given such that , then .
Proof.
This statement follows by the fact that for every in , cf. (2.1) and (2.2). ∎
Proposition 3.9**.**
Let be measures in and assume that where is a positive measure supported on a Borel set with . Then
[TABLE]
Proof.
The inequality is contained in Lemma 3.8, the opposite inequality follows from Lemma 3.7. ∎
Lemma 3.10**.**
Let be a finite positive measure on of the form \mu=\theta\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}\Sigma where is a rectifiable set, and let be an open set that contains . For a.e. let be the tangent line to at and let be the matrix associated to the orthogonal projection of onto . Then for every there exist a smooth map and a compact set such that
- (i)
* for all , and for ;*
- (ii)
* for all , and for ;*
- (iii)
* for all and .*
Proof.
The proof is divided in several steps. We fix for the time being , to be chosen at the end of the proof.
Step 1. Construction of . Using the fact that is rectifiable and is supported on we can find compact sets and curves of class , with , such that:
- •
the sets are disjoint and contained in ;
- •
where ;
- •
up to a rotation , agrees with the graph of a map (we identify with ) and everywhere.
Then we find such that
- •
the open -neighborhoods are disjoint and contained in .
Next we find smooth curves and smooth functions such that
- •
on a neighborhood of and out of ;
- •
everywhere;
- •
agrees, up to the rotation , with the graph of a map such that and everywhere.
For every we let be the projection of onto defined by
[TABLE]
(modulo the rotation ). Finally we set , so that the functions form a partition of unity, and define
[TABLE]
In the rest of this proof we assume for simplicity that the rotations are the identity, and we denote by any constant that does not depend on and ; the value of may vary at every occurrence.
Step 2. for every . Write with . Since is the graph of and , the fact that implies . Then the assumption yields , which is the desired estimate.
Step 3. Proof of statement (i). Given , for every such that there holds , and then by Step 2. Hence (3.3) gives
[TABLE]
On the other hand, if does not belong to then it does not belong to any , which means , and therefore (3.3) yields .
Step 4. Proof of statement (ii). Formula (3.3) gives
[TABLE]
If does not belong to then does not belong to the support of for every , and formula (3.4) reduces to .
Consider now arbitrary. From formula (3.4) we obtain
[TABLE]
For the second inequality we used that and for all except at most one, and the following estimates: (use the definition of and the bound ), (by the choice of ), and (Step 2).
Step 5. for . Let be the matrix associated to the projection of onto the line , that is, the matrix with all entries equal to [math] except . The definition of and the assumption imply , while the assumption implies .
Step 6. Proof of statement (iii). We already know that . Moreover, if belongs to then it belongs to for some and since in a neighborhood of , formula (3.4) reduce to . We conclude the proof using the estimate in Step 5 and choosing small enough. ∎
Lemma 3.11**.**
Let be a measure in of the form \mu=\theta\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}\Sigma where is a rectifiable set. Then for every and every there exist such that and
[TABLE]
Proof.
We fix , to be chosen later. We take an open set such that , and we then let and be the map and the compact set given by Lemma 3.10. We now set
[TABLE]
The function is smooth and its support is contained in for sufficiently small, and the desired properties of follow by the properties of stated in Lemma 3.10. As usual, the letter denotes any constant which does not depend on .
Using property (i) in Lemma 3.10, for every we obtain
[TABLE]
which implies for small enough, and
[TABLE]
Using property (ii) in Lemma 3.10 we obtain
[TABLE]
while properties (i) and (ii) imply that for every . Therefore
[TABLE]
For every we write as follows, where is the matrix associated to the projection on the approximate tangent line to at :
[TABLE]
Then, recalling that and using properties (i)-(iii), we obtain:
[TABLE]
Using this estimate and (3.7), and the fact that , we obtain
[TABLE]
Finally (3.5) follows from (3.6), (3.8) and (3.9) by choosing small enough. ∎
Proposition 3.12**.**
Let be a measure in of the form \mu=\theta\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}\Sigma where is a rectifiable set. Then
[TABLE]
Proof.
The trivial inequality implies ; the opposite inequality follows from Lemma 3.11. ∎
Proof of Theorem 2.5.
Combine Propositions 3.9 and 3.12. ∎
Proof of Proposition 2.11.
If belongs to for some then it belongs also to the dual of , and therefore the functional is coercive, which implies that the infimum is not . Clearly the same holds for .
Next we notice that the minimum of over all is attained because this functional is coercive and weakly lower-semicontinuous.
The first equality in (2.5) is proved in Theorem 2.5.
To prove the second equality in (2.5) it is enough to show that is dense in norm in . The proof of this density result is a bit delicate, but ultimately standard, and we simply list the key steps:
- •
is dense in ;
- •
is dense in ;
- •
is dense in the subspace of all which are constant on some open set (depending on ) such that can be covered by finitely many disjoint compact curves of class ;
- •
is dense in .
In all these statement “dense” refers to the norm of ; the last statement is the most delicate, and can be proved arguing as in the proof of Lemma 3.6. ∎
Lemma 3.13**.**
Assume that for some and that the support of is , and let be a measure in such that . Then there exists in such that and .
In particular every solution of problem (1.5) satisfies .
Proof.
Let be the support of . By Proposition 2.11, where is a minimizer of . Then solves the equation in , which implies that is of class on and the set of all such that has empty interior.
In particular we can find a point such that and where . We then choose a segment which connects to , has length , and is not orthogonal to .
We set \mu^{\prime}:=\mu+\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S. Clearly and the support of is , and one easily checks that belongs to . Since then (cf. Lemma 3.8), and we claim that this inequality is strict.
Assume by contradiction that , and let be a minimizer of . Then is also a minimizer of , and since this functional is strictly convex we have that and agree as elements of the space . This means that
[TABLE]
On the other hand is of class on , and in particular is continuous, and therefore agrees with on , which implies that a.e. on , and by the choice of we have that is not identically null on . This yields the contradiction . ∎
Proof of Theorem 2.6.
Let us prove the first part of the statement. Let be an arbitrary solution of problem (1.5) (which exists by Theorem 2.2), let be the support of and let \bar{\mu}^{a}=\bar{\theta}\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S be the absolutely continuous part of with respect to \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S. Then is also a solution of problem (1.5) by Theorem 2.5.
If we set \mu:=\bar{\mu}^{a}=\bar{\theta}\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S.
If we set \mu:=\theta\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S where is a any function such that and .
Let us now prove the second part of the statement. Since is a solution of problem (1.5), Lemma 3.13 implies that . On the other hand because of the definition of , and therefore we must have and , which concludes the proof. ∎
4. Some necessary conditions of optimality
In this section we assume that the load belongs to , and we consider a measure \mu=\theta\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S in (see (2.4)) and the function that solves problem (2.5), that is, the unique minimizer of .
In Proposition 4.1 we derive some necessary conditions that and must satisfy if solves the maximum problem (1.5).
In Proposition 4.2 we derive the Euler-Lagrange equations for in strong form (assuming some regularity on and ).
Proposition 4.1**.**
Assume that solves of the optimization problem (1.5) and that the set has positive length. Then there exists a constant such that
- (i)
* a.e. on ;*
- (ii)
* a.e. on .*
Proof.
The proof is divided in several steps; the key inequality is (4.4), which is obtained from (4.2).
We consider variations of of the form \mu_{\varepsilon}:=(\theta+\varepsilon\eta)\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S, with and (in particular we keep the set fixed). In order that be admissible, that is, for , we assume that
[TABLE]
Step 1. Let be the minimizer of : then for every that satisfies (4.1) there holds
[TABLE]
By the choice of and we have that and . Therefore, the optimality of yields
[TABLE]
and the comparison of the first and last terms of (4.3) gives (4.2).
In the next four steps we prove that the functions converge strongly to , which will imply that (4.2) holds with in place of .
Step 2. The functions are uniformly bounded in . Note indeed that for small enough there holds and therefore
[TABLE]
and the functional in the first line is clearly coercive on .
Step 3. converge to as . From (4.3) we obtain
[TABLE]
and the last term tends to [math] as by Step 2.
Step 4. The functions converge to weakly in as . By Step 3 and the weak lower-semicontinuity of , every weak* limit of the sequence is a minimizer of and therefore it must be because this functional is strictly convex.
Step 5. The functions converge to strongly in as , and for every that satisfies (4.1) there holds
[TABLE]
Since the linear term in is weakly continuous, the convergence of the energies in Step 3 implies the convergence of the energies without linear term, that is . Notice now that
[TABLE]
is an equivalent Hilbert norm on , and recall that in Hilbert spaces weak convergence plus convergence of the norms implies strong convergence.
Inequality (4.4) follows from (4.2) and the fact that the functions converge to in .
Step 6. Conclusion of the proof. Set . Note that inequality (4.4) holds for all which vanish on , satisfy on , and have integral [math] on . Since this class of functions is closed by change of sign, the inequality is actually an equality, which can be written as
[TABLE]
and implies that is equal to some constant a.e. on . Since this holds for every , we have proved statement (i).
Using statement (i) and recalling that for every admissible there holds
[TABLE]
we rewrite (4.4) as
[TABLE]
and since the restriction of to can be an arbitrary positive bounded function with integral less than , this inequality implies that a.e. on , which is statement (ii). ∎
For the next result we need some assumptions on , and .
We assume that is a continuous function and that is a network of class , that is, it can be written as a finite union of simple curves of class contained in that intersect each other and only at the endpoints. We denote by the set of all endpoints of the curves , and we say that is
- •
a boundary point if ;
- •
a terminal point if and belongs to only one curve ;
- •
a branching point if and belongs to more than one curve .
We choose an orientation of ,333 This means that agrees on each curve (except the endpoints) with is a continuous unit tangent field to ; we do not require that is continuous at branching points.
we denote by the associated normal, that is, the rotation of by counterclockwise, and write for the tangential derivative, for the normal derivatives on the two sides of .
Finally we assume that is of class on , and that the normal derivatives esist at every point of and belong to . We write
[TABLE]
(Note that this quantity does not depend on the choice of the normal .)
Proposition 4.2**.**
Under the assuptions on , and stated above, we have that
- •
* solves on with boundary condition on ;*
- •
* solves -m\,\partial_{\tau}\big{(}\theta\,\partial_{\tau}u\big{)}=\big{[}\partial_{\nu}u\big{]} on each curve minus the endpoints;*
- •
* is of class on each curve , including the endpoints.*
In particular the values of at the endpoints of , denoted by are well-defined, and for every we set
[TABLE]
where the sum is taken over all such that is an endpoint of . Then
- •
if is a boundary point, the Dirichlet condition holds;
- •
if is a terminal point, the Neumann condition holds;
- •
if is a branching point, the Kirchhoff condition \big{[}\partial_{\tau}u\big{(}x)]=0 holds.
Proof.
The full Euler-Lagrange equation for in the weak form is
[TABLE]
Thus satisfies the equation on in the weak sense, and hence it belongs to .
Integrating by parts the first integral in (4.5) we obtain
[TABLE]
and therefore (4.5) becomes
[TABLE]
Thus solves the equation -m\,\partial_{\tau}(\theta\,\partial_{\tau}u)=\big{[}\partial_{\nu}u\big{]} in the weak sense on each curve , which implies that belongs , and then also to , which in turn implies that belongs to .
Finally we integrate by parts the first integral in (4.6) and obtain
[TABLE]
This implies that \big{[}\partial_{\tau}u(x)\big{]}=0 for every which is not a boundary point; if is a terminal point this means . ∎
5. Numerical approximation of optimal reinforcing networks
In this section we introduce a numerical strategy to approximate the solutions of the relaxed reinforcement problem (1.5). Through this section we assume that is a bounded convex domain, and that the load belongs to .
Thanks to Theorem 2.6 we can rewrite this optimization problem as
[TABLE]
where the minimum is taken over all function and the maximum is taken over all and such that is a compact, connected set with finite length contained in , is a function on with a.e. and .
Since we expect problem (5.1) to have many local maxima, we focus on stochastic optimization algorithms which only require cost function evaluations to proceed.
5.1. Spanning tree parametrization and discrete functional
To discretize problem (5.1), we consider a mesh associated to the domain made of points and triangles. We denote by and respectively the stiffness and mass matrices of dimensions associated to the finite elements on . Moreover, we define and to be the differentiation matrices of functions. More precisely, and are matrices of dimensions which evaluate the operators and on piecewise linear continuous functions on the mesh . Observe that due to the linearity of elements, and are constant on every triangle of the mesh.
Denoting by the column vector of size containing the area measures of every triangle, we recall the simple identity
[TABLE]
We denote by the letter a real vector of node values representing an element of .
Problem (5.1) involves both a connected set and an associated weight function. In order to parametrize connected one dimensional structures, we follow the strategy developed in [9]. Take and consider a set of points . We associate to such a set its canonical spanning tree , which is the polygonal set of minimal length connecting these points without introducing new branching points. Let us point out that, generically, is the union of arcs.
It is straightforward to establish that the family of all such spanning trees (with varying among all integers) is dense with respect to Hausdorff distance among compact connected subsets of . To describe an element of , we simply consider a vector of values greater than which represents a piecewise constant function on every arc of the tree.
Let be the vector of size which contains the weighted lengths of intersected with every triangle of the mesh . With previous notations, we can now introduce a discrete approximation of problem (5.1):
[TABLE]
where is the linear interpolation of the function at the vertices of the mesh , the minimum is taken over all , the maximum is taken over all pairs , that satisfy the constraints that every value of is greater than and the following measure equality holds:
[TABLE]
where the are the edges of .
Since the minimization problem is a strictly convex quadratic problem, it reduces to solve the linear system
[TABLE]
5.2. Parametrization of the constraints
As explained in the previous sections, we need the couple to have weights greater than one and satisfies equality constraint (5.3). To parametrize such admissible couples we introduce a last scale parameter denoted by . We introduce in Algorithm 1 a three steps procedure to produce an admissible pair \smash{\big{(}SP(\overline{P_{1}},\dots,\overline{P_{n_{d}}}\big{)},\overline{\theta_{\mathrm{weights}}})} for a given triplet of parameters \smash{\big{(}SP(P_{1},\dots,P_{n_{d}}),\theta_{\mathrm{weights}},h_{s}\big{)}}.
5.3. Technical details and complexity
We summarize in Algorithm 2 the different steps required to compute the cost associated to a given set of parameters, that we choose as \big{(}SP(P_{1},\dots,P_{n_{d}}),\theta_{\mathrm{weights}},h_{s}\big{)}.
We give below some technical details and underline the computational complexity of every step.
In the first phase of projection, only the final step of the procedure is not computationally trivial. Whereas the projection of a point onto an hyperplane can be analytically described, the projection on an hyperplane intersected with a box requires a specific attention. In all our experiments, we used Dai and Fletcher algorithm [13] to obtain a fast and precise approximation of this projection.
Observe that the spanning tree is precisely by construction of length which implies that constraints (5.2) and are compatible. In our situation, an order of only iterations was required to reach a relative error of on first order optimality conditions with respect to the infinity norm which reduces to a complexity of order .
The second and third steps have been carried out using an hash structure representation of the mesh combined with a Quad-tree associated to its vertices. Using those precomputed information, these operations required in practice an order of operations.
Finally, assembling and solving the linear system has been performed by a standard Cholesky decomposition which concentrated the main part of the computational effort in our experiments where the number of parameters was negligible with respect to which was of order .
5.4. Numerical experiments
Based on previous discretization, we approximate optimal triplet solutions of problem (5.1) using a stochastic algorithm. We focus our study on the homogeneous load case corresponding to constantly equal to and on the sum of two Dirac masses .
In all our experiments, we used the NLopt library (see [16]) and its implementation of ISRES algorithm with its default parameters which combine local and global stochastic optimization.
We carried out optimization runs limited to five hours of computation leading to an order of cost function evaluations based on algorithm 2 on a standard computer for a mesh made of triangles.
In Figures 1 and 3 we describe the optimal configurations we obtained for to with . Observe that the resulting number of parameters in the triplet is exactly . Moreover, in order to obtain a fine and stable description of optimal structures, we performed a local optimization step of the obtained structure increasing the number of points to . We used the NLopt implementation of the BOBYQA algorithm for this final step which does not require gradient base information.
Finally, we give in Table 1 several numerical estimates obtained on a fine mesh with elements of our computed sets and also of natural networks which could be guess to be optimal. As illustrated by these numerical values, neither the radius (for ), a diameter (for ), a triple junction (for ) or a cross for () seem to be optimal.
We recover the fact, described in Proposition 4.1, that, for optimal structures, the tangential gradient of is almost constant where whereas we can observe drastic changes of magnitude where (see Figures 1, 3 and 2).
6. Remarks and open questions
There are several remarks and open problems related to the optimization problem (1.3) and the relaxed optimization problem (1.5); we list below those we deem more interesting.
Remark 6.1**.**
In general the functional is not weakly* continuous on . We prove this claim by an explicitly example. We let be a closed segment with length , which we identify with the interval , and let be a signed measure of the form f:=\rho\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S where is a function on with integral [math].
We then consider the measures \mu_{n}:=\theta_{n}\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S where and is the -periodic function on defined by on and on . Thus converge to \mu:=\frac{3}{2}\,\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S. However, the functionals
[TABLE]
Gamma-converge (on endowed with the weak topology) to
[TABLE]
and for every non constant (because is strictly less than , which is the density of divided by ). In particular if is not a.e. equal to [math] then
[TABLE]
(all minima are taken over ). Using the strict inequality we can prove that if the constant that appears in (2.2) is sufficiently large, then
[TABLE]
Problem 6.2**.**
We do not know if problem (1.5) is the relaxation of problem (1.3). In other words, we do not know if the following approximation property holds: for every there exists a sequence of sets such that
[TABLE]
Indeed, by the definition of every in this class is the limit of \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S_{n} for some sequence of sets , but since is not continuous (Remark 6.1), the second limit in (6.1) does not necessarily hold.
Remark 6.3**.**
If the approximation in energy (6.1) does not hold, then some kind of Lavrentiev phenomenon may occur. This means that
- •
the value of the maximum/supremum in the original optimization problem (1.3) could be strictly smaller than the value of the maximum in the relaxed optimization problem (1.5);
- •
given a maximizing sequence for problem (1.3), the associated measures \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S_{n} may not converge to a solution of the relaxed problem (1.5).
Remark 6.4**.**
Assume that belongs to for some and that is a measure in with support , and let be the absolutely continuous part of with respect to \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S. Using Lemma 3.7, Lemma 3.11 and Proposition 2.11 we easily obtain the following: the relaxation of with is the functional with .
Notice that for we can rewrite as
[TABLE]
where , is the Lebesgue measure on , and is the number that appears in (2.2). Functionals of this type has been studied in detail in [5], where it is proved that the relaxation of with is
[TABLE]
where the space and the operator are defined in a suitable abstract sense.
Thus the relaxation result stated above can be rephrased as follows: the space agrees with and the operator agrees with the full gradient for Lebesgue-a.e. , with the tangential gradient for -a.e. , and with the null-operator for -a.e. , where is the singular part of w.r.t. \mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S.
Problem 6.5**.**
We denote by \mu=\theta\mathscr{H}^{1}\operatorname{\mbox{\Large!\llcorner}}S a solution of problem (1.5) given in Theorem 2.6, and by the unique minimizer of . Here are some open questions concerning and .
(a) Intuition tells that it is never convenient to use part of to reinforce the boundary the membrane, because it is already reinforced by the Dirichlet boundary condition inscribed in the problem. On the other hand, the requirement that be connected might force part of it to lie on the boundary of , even if this part does not contribute to reinforcing the membrane. Here are two plausible statements that would be interesting to investigate:
- •
for some non-convex domain the set may have positive length, but cannot be entirely contained in ;
- •
if is strictly convex then the set has zero-length, and perhaps it is even finite.
Note that using the second part of Theorem 2.6 (and in particular assuming that the support of is ) we can prove the following: if is strictly convex then does not contain any arc.
(b) In principle the density belongs to . It would be interesting to investigate if is bounded and, possibly refining the assumptions on the data, prove further regularity properties.
(c) According to the numerical simulations we made, the set never contains closed curves; it would be interesting to show this fact under general assumptions.
(d) Numerical simulations also show that may present branching points at least for values of large enough. However, the regularity of the set seems a difficult issue: is it true that, under suitable assumptions on the data, the set is smooth except a finite number of branching points? And if a branching occurs, what are the necessary condition of optimality for the related angles?
(e) When the support of is and the total length tends to , then the optimal set tends to fill the entire . Can we say more on the asymptotic behavior of in this regime? This question is reminiscent of a -convergence result for the irrigation problem proved in [17].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] G. Alberti, M. Ottolini: On the structure of continua with finite length and Gołąb’s semicontinuity theorem. Nonlinear Anal. , 153 (2017), 35–55.
- 3[3] E. Acerbi, G. Buttazzo, D. Percivale: Thin inclusions in linear elasticity: a variational approach. J. Reine Angew. Math. , 386 (1988), 99–115.
- 4[4] M. Beckmann: A continuous model of transportation. Econometrica , 20 (1952), 643–660.
- 5[5] G. Bouchitté, G. Buttazzo, P. Seppecher: Energies with respect to a measure and applications to low dimensional structures. Calc. Var. Partial Differential Equations , 5 (1996), no. 1, 37–54.
- 6[6] L. Brasco, G. Carlier, F. Santambrogio: Congested traffic dynamics, weak flows and very degenerate elliptic equations. J. Math. Pures Appl. , 93 (2010), no. 6, 652–671.
- 7[7] G. Buttazzo, G. Carlier, S. Guarino Lo Bianco: Optimal regions for congested transport. ESAIM Math. Model. Numer. Anal. , 49 (2015), no. 6, 1607–1619.
- 8[8] G. Buttazzo, É. Oudet, B. Velichkov: A free boundary problem arising in PDE optimization. Calc. Var. Partial Differential Equations , 54 (2015), no. 4, 3829–3856.
