Related papers: Numerical study of optimal partitioning problems i…
We consider the problem of minimizing the number of triangles in a graph of given order and size and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that…
We study a non local approximation of the Gaussian perimeter, proving the Gamma convergence to the local one. Surprisingly, in contrast with the local setting, the halfspace turns out to be a volume constrained stationary point if and only…
As an alternative to the paradigmatic fragmentation problem of a single object crushed into a great number of pieces, we survey a large collection of identical bodies, each one randomly split into two fragments only. While some key features…
This paper is devoted to the numerical approximation of a degenerate anisotropic elliptic problem. The numerical method is designed for arbitrary space-dependent anisotropy directions and does not require any specially adapted coordinate…
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…
In this paper we provide a characterization of sets of finite local and non local perimeter via a $\Gamma-$convergence result. As an application we give a proof of the isoperimetric inequality, both in the local and in the non local case.
The benefits of a recently proposed method to approximate hard optimization problems are demonstrated on the graph partitioning problem. The performance of this new method, called Extremal Optimization, is compared to Simulated Annealing in…
A 3D-2D dimension reduction for a nonlinear optimal design problem with a perimeter penalization is performed in the realm of $\Gamma$-convergence, providing an integral representation for the limit functional.
We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the…
Inspired by a planar partitioning problem involving multiple improper chambers, this article investigates using classical techniques what can be said of the existence, uniqueness, and regularity of minimizers in a certain free-endpoint…
The paper presents a numerical study for the finite element method with anisotropic meshes. We compare the accuracy of the numerical solutions on quasi-uniform, isotropic, and anisotropic meshes for a test problem which combines several…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
We compute approximate solutions to inverse problems for determining parameters in differential equation models with stochastic data on output quantities. The formulation of the problem and modeling framework define a solution as a…
We study an optimization problem related to the approximation of given data by a linear combination of transformed modes. In the simplest case, the optimization problem reduces to a minimization problem well-studied in the context of proper…
We consider shape optimization problems of the form $$\min\big\{J(\Omega)\ :\ \Omega\subset X,\ m(\Omega)\le c\big\},$$ where $X$ is a metric measure space and $J$ is a suitable shape functional. We adapt the notions of $\gamma$-convergence…
We investigate the numerical approximation of integrals over $\mathbb{R}^d$ equipped with the standard Gaussian measure $\gamma$ for integrands belonging to the Gaussian-weighted Sobolev spaces $W^\alpha_p(\mathbb{R}^d, \gamma)$ of mixed…
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
As shown in [15], under some structural assumptions, working on congested traffic problems in general and increasingly dense networks leads, at the limit by {\Gamma}-convergence, to continuous minimization problems posed on measures on…
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minimal possible quasi-isometry constant (global estimate for…
We propose a numerical method for the solution of electromagnetic problems on axisymmetric domains, based on a combination of a spectral Fourier approximation in the azimuthal direction with an IsoGeometric Analysis (IGA) approach in the…