Searcharxiv⌕ Search

arXiv subjects

Beniamin Bogosel

Publications and source records attributed to Beniamin Bogosel.

34 records · Page 2Linked to original sources

On the numerical approximation of Blaschke-Santaló diagrams using Centroidal Voronoi Tessellations

Identifying Blaschke-Santaló diagrams is an important topic that essentially consists in determining the image $Y=F(X)$ of a map $F:X\to{\mathbb{R}}^d$, where the dimension of the source space $X$ is much larger than the one of the target space. In some cases, that occur for instance in shape optimization problems, $X$ can even be a subset of an infinite-dimensional space. The usual Monte Carlo method, consisting in randomly choosing a number $N$ of points $x_1,\dots,x_N$ in $X$ and plotting them in the target space ${\mathbb{R}}^d$, produces in many cases areas in $Y$ of very high and very low concentration leading to a rather rough numerical identification of the image set. On the contrary, our goal is to choose the points $x_i$ in an appropriate way that produces a uniform distribution in the target space. In this way we may obtain a good representation of the image set $Y$ by a relatively small number $N$ of samples which is very useful when the dimension of the source space $X$ is large (or even infinite) and the evaluation of $F(x_i)$ is costly. Our method consists in a suitable use of {\it Centroidal Voronoi Tessellations} which provides efficient numerical results. Simulations for two and three dimensional examples are shown in the paper.

math.NA↗

Propagation for KPP bulk-surface systems in a general cylindrical domain

In this paper, we investigate propagation phenomena for KPP bulk-surface systems in a cylindrical domain with general section and heterogeneous coefficients. As for the scalar KPP equation, we show that the asymptotic spreading speed of solutions can be computed in terms of the principal eigenvalues of a family of self-adjoint elliptic operators. Using this characterization, we analyze the dependence of the spreading speed on various parameters, including diffusion rates and the size and shape of the section of the domain. In particular, we provide new theoretical results on several asymptotic regimes like small and high diffusion rates and sections with small and large sizes. These results generalize earlier ones which were available in the radial homogeneous case. Finally, we numerically investigate the issue of shape optimization of the spreading speed. By computing its shape derivative, we observe, in the case of homogeneous coefficients, that a disk either maximizes or minimizes the speed, depending on the parameters of the problem, both with or without constraints. We also show the results of numerical shape optimization with non homogeneous coefficients, when the disk is no longer an optimizer.

math.AP↗

Optimization of the Steklov-Lamé eigenvalues with respect to the domain

This work deals with theoretical and numerical aspects related to the behavior of the Steklov-Lamé eigenvalues on variable domains. After establishing the eigenstructure for the disk, we prove that for a certain class of Lamé parameters, the disk maximizes the first non-zero eigenvalue under area or perimeter constraints in dimension two. Upper bounds for these eigenvalues can be found in terms of the scalar Steklov eigenvalues, involving various geometric quantities. We prove that the Steklov-Lamé eigenvalues are upper semicontinuous for the complementary Hausdorff convergence of $\varepsilon$-cone domains and, as a consequence, there exist shapes maximizing these eigenvalues under convexity and volume constraints. A numerical method based on fundamental solutions is proposed for computing the Steklov-Lamé eigenvalues, allowing to study numerically the shapes maximizing the first ten non-zero eigenvalues.

math.OC↗

On the Polygonal Faber-Krahn Inequality

It has been conjectured by Pólya and Szegö seventy years ago that the planar set which minimizes the first eigenvalue of the Dirichlet-Laplace operator among polygons with $n$ sides and fixed area is the regular polygon. Despite its apparent simplicity, this result has only been proved for triangles and quadrilaterals. In this paper we prove that for each $n \ge 5$ the proof of the conjecture can be reduced to a finite number of certified numerical computations. Moreover, the local minimality of the regular polygon can be reduced to a single numerical computation. For $n=5, 6,7, 8$ we perform this computation and certify the numerical approximation by finite elements, up to machine errors.

math.OC↗

Numerical shape optimization among convex sets

This article proposes a new discrete framework for approximating solutions to shape optimization problems under convexity constraints. The numerical method, based on the support function or the gauge function, is guaranteed to generate discrete convex shapes and is easily implementable using standard optimization software. The framework can handle various objective functions ranging from geometric quantities to functionals depending on partial differential equations. Width or diameter constraints are handled using the support function. Functionals depending on a convex body and its polar body can be handled using a unified framework.

math.OC↗

Parametric Shape Optimization using the Support Function

The optimization of shape functionals under convexity, diameter or constant width constraints shows numerical challenges. The support function can be used in order to approximate solutions to such problems by finite dimensional optimization problems under various constraints. We propose a numerical framework in dimensions two and three and we present applications from the field of convex geometry. We consider the optimization of functionals depending on the volume, perimeter and Dirichlet Laplace eigenvalues under the aforementioned constraints. In particular we confirm numerically Meissner's conjecture, regarding three dimensional bodies of constant width with minimal volume.

math.OC↗

Longest minimal length partitions

This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which performs multiple optimizations steps at each iteration to approximate minimal partitions. Using these partitions we compute perturbations of the domain which increase the minimal perimeter. The initialization of the optimal partitioning algorithm uses capacity-constrained Voronoi diagrams. A new algorithm is proposed to identify such diagrams, by computing the gradients of areas and perimeters for the Voronoi cells with respect to the Voronoi points.

math.OC↗

Maximization of the Steklov eigenvalues with a diameter constraint

In this paper, we address the problem of maximizing the Steklov eigenvalues with a diameter constraint. We provide an estimate of the Steklov eigenvalues for a convex domain in terms of its diameter and volume and we show the existence of an optimal convex domain. We establish that balls are never maximizers, even for the first non-trivial eigenvalue that contrasts with the case of volume or perimeter constraints. Under an additional regularity assumption, we are able to prove that the Steklov eigenvalue is multiple for the optimal domain. We illustrate our theoretical results by giving some optimal domains in the plane thanks to a numerical algorithm.

math.SP↗

Minimal Partitions for p-norms of Eigenvalues

In this article we are interested in studying partitions of the square, the disk and the equilateral triangle which minimize a p-norm of eigenvalues of the Dirichlet-Laplace operator. The extremal case of the infinity norm, where we minimize the largest fundamental eigenvalue of each cell, is one of our main interests. We propose three numerical algorithms which approximate the optimal configurations and we obtain tight upper bounds for the energy, which are better than the ones given by theoretical results. A thorough comparison of the results obtained by the three methods is given. We also investigate the behavior of the minimal partitions with respect to p. This allows us to see when partitions minimizing the 1-norm and the infinity-norm are different.

math.OC↗

Regularity result for a shape optimization problem under perimeter constraint

We study the problem of optimizing the eigenvalues of the Dirichlet Laplace operator under perimeter constraint. We prove that optimal sets are analytic outside a closed singular set of dimension at most $d-8$ by writing a general optimality condition in the case the optimal eigenvalue is multiple. As a consequence we find that the optimal $k$-th eigenvalue is strictly smaller than the optimal $(k+1)$-th eigenvalue. We also provide an elliptic regularity result for sets with positive and bounded weak curvature.

math.OC↗

Phase field approach to optimal packing problems and related Cheeger clusters

In a fixed domain of $\Bbb{R}^N$ we study the asymptotic behaviour of optimal clusters associated to $α$-Cheeger constants and natural energies like the sum or maximum: we prove that, as the parameter $α$ converges to the "critical" value $\Big (\frac{N-1}{N}\Big ) _+$, optimal Cheeger clusters converge to solutions of different packing problems for balls, depending on the energy under consideration. As well, we propose an efficient phase field approach based on a multiphase Gamma convergence result of Modica-Mortola type, in order to compute $α$-Cheeger constants, optimal clusters and, as a consequence of the asymptotic result, optimal packings. Numerical experiments are carried over in two and three space dimensions.

math.OC↗

Efficient algorithm for large spectral partitions

We present an amelioration of current known algorithms for optimal spectral partitioning problems. The idea is to use the advantage of a representation using density functions while decreasing the computational time. This is done by restricting the computation to neighbourhoods of regions where the associated densities are above a certain threshold. The algorithm extends and improves known methods in the plane and on surfaces in dimension 3. It also makes possible to make some of the first computations of volumic 3D spectral partitions on sufficiently large discretizations.

math.OC↗

Optimal partitions for the sum and the maximum of eigenvalues

In this paper we compare the candidates to be spectral minimal partitions for two criteria: the maximum and the average of the first eigenvalue on each subdomains of the partition. We analyze in detail the square, the disk and the equilateral triangle. Using numerical simulations, we propose candidates for the max, prove that most of them can not be optimal for the sum and then exhibit better candidates for the sum.

math.OC↗

Partitions of Minimal Length on Manifolds

We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $Γ$-convergence result and we show some numerical results. We compare our results to those already present in the literature in the case of the sphere. For general surfaces we provide an optimization algorithm on meshes which can give a good approximation of the optimal cost, starting from the results obtained using the relaxed formulation.

math.OC↗

A Multiphase Shape Optimization Problem for Eigenvalues: Qualitative Study and Numerical Results

We consider the multiphase shape optimization problem $$\min\Big\{\sum_{i=1}^hλ_1(Ω_i)+α|Ω_i|:\ Ω_i\ \hbox{open},\ Ω_i\subset D,\ Ω_i\capΩ_j=\emptyset\Big\},$$ where $α>0$ is a given constant and $ D\subset\Bbb{R}^2$ is a bounded open set with Lipschitz boundary. We give some new results concerning the qualitative properties of the optimal sets and the regularity of the corresponding eigenfunctions. We also provide numerical results for the optimal partitions.

math.OC↗