Quantitative analysis of a singularly perturbed shape optimization problem in a polygon
Dario Mazzoleni, Benedetta Pellacci, Gianmaria Verzini

TL;DR
This paper investigates the relationship between two spectral shape optimization problems, focusing on a polygonal domain, and provides quantitative estimates for their solutions and eigenvalues as the outside environment becomes more hostile.
Contribution
It refines previous analysis by offering quantitative estimates for the convergence of optimal levels and eigenvalues in a polygonal setting, advancing understanding of singular perturbations in shape optimization.
Findings
Quantitative estimates of optimal level convergence in polygonal domains.
Eigenvalue convergence analysis under singular perturbations.
Enhanced understanding of spectral shape optimization in polygons.
Abstract
We carry on our study of the connection between two shape optimization problems with spectral cost. On the one hand, we consider the optimal design problem for the survival threshold of a population living in a heterogenous habitat ; this problem arises when searching for the optimal shape and location of a shelter zone in order to prevent extinction of the species. On the other hand, we deal with the spectral drop problem, which consists in minimizing a mixed Dirichlet-Neumann eigenvalue in a box . In a previous paper arXiv:1811.01623 we proved that the latter one can be obtained as a singular perturbation of the former, when the region outside the refuge is more and more hostile. In this paper we sharpen our analysis in case is a planar polygon, providing quantitative estimates of the optimal level convergence, as well as of the involved eigenvalues.
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.
Quantitative analysis of a singularly perturbed shape optimization problem in a polygon
Dario Mazzoleni, Benedetta Pellacci and Gianmaria Verzini
Abstract
We carry on our study of the connection between two shape optimization problems with spectral cost. On the one hand, we consider the optimal design problem for the survival threshold of a population living in a heterogenous habitat ; this problem arises when searching for the optimal shape and location of a shelter zone in order to prevent extinction of the species. On the other hand, we deal with the spectral drop problem, which consists in minimizing a mixed Dirichlet-Neumann eigenvalue in a box . In a previous paper [12] we proved that the latter one can be obtained as a singular perturbation of the former, when the region outside the refuge is more and more hostile. In this paper we sharpen our analysis in case is a planar polygon, providing quantitative estimates of the optimal level convergence, as well as of the involved eigenvalues.
AMS-Subject Classification. 49R05, 49Q10; 92D25, 35P15, 47A75.
Keywords. Singular limits, survival threshold, mixed Neumann-Dirichlet boundary conditions, -symmetrization, isoperimetric profile.
1 Introduction
In this note we investigate some relations between the two following shape optimization problems, settled in a box , that is, a bounded, Lipschitz domain (open and connected).
Definition 1.1**.**
Let and . For any measurable such that , we define the weighted eigenvalue
[TABLE]
and the optimal design problem for the survival threshold as
[TABLE]
Definition 1.2**.**
Let . Introducing the space (where q.e. stands for quasi-everywhere, i.e. up to sets of zero capacity), we can define, for any quasi-open such that , the mixed Dirichlet-Neumann eigenvalue as
[TABLE]
and the spectral drop problem as
[TABLE]
The two problems above have been the subject of many investigations in the literature. The interest in the study of the eigenvalue goes back to the analysis of the optimization of the survival threshold of a species living in a heterogenous habitat , with the boundary acting as a reflecting barrier. As explained by Cantrell and Cosner in a series of paper [3, 4, 5] (see also [11, 9, 12]), the heterogeneity of makes the intrinsic growth rate of the population, represented by a function , be positive in favourable sites and negative in the hostile ones. Then, if and , it turns out that the positive principal eigenvalue of the problem
[TABLE]
i.e.
[TABLE]
acts a survival threshold, namely the smaller is, the greater the chances of survival become. Moreover, by [11], the minimum of w.r.t. varying in a suitable class is achieved when is of bang-bang type, i.e. , being with fixed measure. As a consequence, one is naturally led to the shape optimization problem introduced in Definition 1.1.
On the other hand, the spectral drop problem has been introduced in [2] as a class of shape optimization problems where one minimizes the first eigenvalue of the Laplace operator with homogeneous Dirichlet conditions on and homogeneous Neumann ones on :
[TABLE]
In our paper [12], we analyzed the relations between the above problems, showing in particular that arises from in the singularly perturbed limit , as stated in the following result.
Theorem 1.3** ([12, Thm. 1.4, Lemma 3.3]).**
If , and then
[TABLE]
As a consequence, for every ,
[TABLE]
In respect of this asymptotic result, let us also mention [8], where the relation between the above eigenvalue problems has been recently investigated for fixed and regular.
In [12], we used the theorem above to transfer information from the spectral drop problem to the optimal design one. In particular, we could give a contribution in the comprehension of the shape of an optimal set for . This topic includes several open questions starting from the analysis performed in [4] (see also [9, 11]) when : in this case it is shown that any optimal set is either or . The knowledge of analogous features in the higher dimensional case is far from being well understood, but it has been recently proved in [9] that when is an N-dimensional rectangle, then does not contain any portion of sphere, contradicting previous conjectures and numerical studies [1, 15, 7]. This result prevents the existence of optimal spherical shapes, namely optimal of the form for suitable and such that .
On the other hand, we have shown that spherical shapes are optimal for , for small , when is an -dimensional polytope. This, together with Theorem 1.3, yields the following result.
Theorem 1.4** ([12, Thm. 1.7]).**
Let be a bounded, convex polytope. There exists such that, for any :
- •
* is a minimizer of the spectral drop problem in , with volume constraint , if and only if , where is a vertex of with the smallest solid angle;*
- •
if and is not a spherical shape as above, then, for sufficiently large,
[TABLE]
In particular, in case , with , and , then any minimizing spectral drop is a quarter of a disk centered at a vertex of .
Then, even though the optimal shapes for can not be spherical for any fixed , they are asymptotically spherical as , at least in the qualitative sense described in Theorem 1.4.
The main aim of the present note is to somehow revert the above point of view: we will show that, in case is explicit as a function of , one can use Theorem 1.3 in order to obtain quantitative bounds on the ratio
[TABLE]
In particular, we will pursue this program in case is a planar polygon: indeed, on the one hand, in such case the threshold in Theorem 1.4 can be estimated explicitly; on the other hand, such theorem implies that the optimal shapes for are spherical, so that can be explicitly computed. This will lead to quantitative estimates about the convergence of to .
As a byproduct of this analysis, we will also obtain some quantitative information on the ratio
[TABLE]
thus providing a quantitative version of the second part of Theorem 1.4.
These new quantitative estimates are the main results of this note, and they are contained in Theorems 2.2 and 2.3, respectively. The next section is devoted to their statements and proofs, together with further details of our analysis.
2 Setting of the problem and main results.
Let denote a convex -gon, . We introduce the following quantities and objects, all depending on :
- •
is the smallest interior angle;
- •
is the set of vertices having angle ;
- •
are the (closed) edges;
- •
denotes the following quantity:
[TABLE]
Under the above notation, we define the threshold
[TABLE]
Remark 2.1**.**
Notice that, as far as , corresponds to the shortest distance between two non- consecutive edges:
[TABLE]
Moreover, for any ,
[TABLE]
Indeed, let , with . Then
[TABLE]
and the claim follows since .
Our main results are the following.
Theorem 2.2**.**
Let denote a convex -gon, let be defined in (5), and let us assume that
[TABLE]
Then is achieved by if and only if , where . Moreover
[TABLE]
By taking advantage of the asymptotic information on , we can deduce the corresponding relation between the eigenvalue of a spherical shape and the minimum .
Theorem 2.3**.**
Let denote a convex -gon, , and let us assume that
[TABLE]
where is defined in (5). Then, taking and such that ,
[TABLE]
To prove our results, we will use the analysis we developed in [12, Section 4] to estimate by means of -symmetrizations on cones [13, 10]. To this aim we will first evaluate a suitable isoperimetric constant.
For , we write
[TABLE]
where denotes the relative De Giorgi perimeter. For we consider the isoperimetric problem
[TABLE]
and we call
[TABLE]
Given the unbounded cone with angle ,
[TABLE]
it is well known that
[TABLE]
is independent on , and hence on . As a consequence, also
[TABLE]
for every .
Lemma 2.4**.**
If is a convex -gon and , then is achieved by if and only if , where . Moreover is achieved by the same too.
Proof.
Notice that, by assumption, for any the set is a circular sector of measure , with a circular arc. Then (7) implies
[TABLE]
and we are left to show the opposite inequality (strict, in case is not of the above kind). Applying Theorems 4.6 and 5.12 in [14], and Theorems 2 and 3 in [6], we deduce that is achieved by , which is an open, connected set, such that is either a (connected) arc of circle or a straight line segment. Moreover, consists in exactly two points (the endpoints of ), and reaches the boundary of orthogonally at flat points (i.e. not at a vertex). Hence, there are three possible configurations (see Fig. 1).
- A.
The endpoints of belong to the interior of two consecutive edges and . In this case is orthogonal to both and , and is a portion of a disk centered at . Recalling (7), we deduce that , and the lemma follows. 2. B.
The endpoints of belong to the same edge . 3. C.
The endpoints of belong to two non-consecutive edges.
The rest of the proof will be devoted to show that cases B and C can not occur.
In case B, assume w.l.o.g. that and . Then , , and
[TABLE]
in contradiction with (8).
Finally, in order to rule out configuration C, by definition of we have
[TABLE]
whenever , which is fixed as . So that we get again a contradiction concluding the proof.
Finally, the assertion concerning follows by its definition and from the fact that for all (see also [12, Corollary 4.3]), we have just showed that is a constant independent of . ∎
Remark 2.5**.**
Notice that the threshold in Lemma 2.4 has no reason to be optimal. On the other hand, one can easily check that in the case of a rectangle, as treated in Theorem 1.4 it is actually optimal, since, for , is achieved by a rectangle (see e.g. [12, Remark 4.5]).
We are now in position to prove our main results.
Proof of Theorem 2.2.
First of all, we take by the assumption on and we apply [12, Corollary 4.3] and Lemma 2.4 to deduce that
[TABLE]
where stands for the first eigenvalue of the Dirichlet-Laplacian in the ball of unit radius. By Theorem 1.3 we obtain
[TABLE]
for all . Then we make the choice of , which is admissible since and , and obtain
[TABLE]
yielding the conclusion. ∎
Proof of Theorem 2.3.
Calling , for some and using conclusion 2 of [12, Lemma 3.1], we infer that . As a consequence we can use Theorem 2.2 to write
[TABLE]
Remark 2.6**.**
The estimate of Theorem 2.3 can be read as,
[TABLE]
On the other hand, even without using asymptotic expansions, as increases, the estimate becomes more precise. As an example, for all , one has the explicit estimate
[TABLE]
Acknowledgments
Work partially supported by the project ERC Advanced Grant 2013 n. 339958: “Complex Patterns for Strongly Interacting Dynamical Systems - COMPAT”, by the PRIN-2015KB9WPT Grant: “Variational methods, with applications to problems in mathematical physics and geometry”, and by the INdAM-GNAMPA group.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H. Berestycki, F. Hamel, and L. Roques. Analysis of the periodically fragmented environment model. I. Species persistence. J. Math. Biol. , 51(1):75–113, 2005.
- 2[2] G. Buttazzo and B. Velichkov. The spectral drop problem. In Recent advances in partial differential equations and applications , volume 666 of Contemp. Math. , pages 111–135. Amer. Math. Soc., Providence, RI, 2016.
- 3[3] R. S. Cantrell and C. Cosner. Diffusive logistic equations with indefinite weights: population models in disrupted environments. Proc. Roy. Soc. Edinburgh Sect. A , 112(3-4):293–318, 1989.
- 4[4] R. S. Cantrell and C. Cosner. The effects of spatial heterogeneity in population dynamics. J. Math. Biol. , 29(4):315–338, 1991.
- 5[5] R. S. Cantrell and C. Cosner. Spatial ecology via reaction-diffusion equations . Wiley Series in Mathematical and Computational Biology. John Wiley & Sons, Ltd., Chichester, 2003.
- 6[6] A. Cianchi. On relative isoperimetric inequalities in the plane. Boll. Un. Mat. Ital. B (7) , 3(2):289–325, 1989.
- 7[7] C.-Y. Kao, Y. Lou, and E. Yanagida. Principal eigenvalue for an elliptic problem with indefinite weight on cylindrical domains. Math. Biosci. Eng. , 5(2):315–335, 2008.
- 8[8] D. Kielty. Singular limits of sign-changing weighted eigenproblems. Ar Xiv e-prints , arxiv:1812.03617, 2018.
