Related papers: Minimal Partitions for p-norms of Eigenvalues
We present numerical upscaling techniques for a class of linear second-order self-adjoint elliptic partial differential operators (or their high-resolution finite element discretization). As prototypes for the application of our theory we…
In this paper, we revisit approximation properties of piecewise polynomial spaces, which contain more than ${\cal P}_{r-1}$ but not ${\cal P}_r$. We develop more accurate upper and lower error bounds that are sharper than those used in…
We present an account of different problems that arise in relation with cyclicity problems in Dirichlet-type spaces, in particular with polynomials $p$ that minimize the norm $\|pf-1\|$.
We formulate the issue of minimality of self-adjoint operators on a Hilbert space as a semi-definite problem, linking the work by Overton in [1] to the characterization of minimal hermitian matrices. This motivates us to investigate the…
It is proved that the minimal Dirichlet eigenvalue of the Laplacian in an annulus is a monotonically decreasing function of the displacement of the center of the smaller disc. The maximal value of the minimal eigenvalue is attained when the…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
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…
The problem of minimizing the maximum of $N$ convex, Lipschitz functions plays significant roles in optimization and machine learning. It has a series of results, with the most recent one requiring $O(N\epsilon^{-2/3} + \epsilon^{-8/3})$…
We present numerical minimizers for the first seven eigenvalues of the magnetic Dirichlet Laplacian with constant magnetic field in a wide range of field strengths. Adapting an approach by Antunes and Freitas, we use gradient descent for…
In these paper we study the adjacency matrix of some infinite graphs, which we call the shift operator on the $L^p$ space of the graph. In particular, we establish norm estimates, we find the norm for some cases, we decide the triviality of…
We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…
We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…
The Dirichlet eigenvalues of the Laplace-Beltrami operator are larger on a flat disc than on any other surface of revoltuion immersed in Euclidean space with the same boundary.
We discuss several properties of eigenvalues and eigenfunctions of the $p$-Laplacian on a ball subject to zero Dirichlet boundary conditions. Among main results, in two dimensions, we show the existence of nonradial eigenfunctions which…
We describe a highly efficient numerical scheme for finding two-sided bounds for the eigenvalues of the fractional Laplace operator (-Delta)^{alpha/2} in the unit ball D in R^d, with a Dirichlet condition in the complement of D. The…
The sum of the first $n \geq 1$ eigenvalues of the Laplacian is shown to be maximal among triangles for the equilateral triangle, maximal among parallelograms for the square, and maximal among ellipses for the disk, provided the ratio…
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…
In this paper, we introduce two iterative methods for longest minimal length partition problem, which asks whether the disc (ball) is the set maximizing the total perimeter of the shortest partition that divides the total region into…
This article derives lower bounds on the supremal (strict) p-negative type of finite metric spaces using purely elementary techniques. The bounds depend only on the cardinality and the (scaled) diameter of the underlying finite metric…
Minimizing the so-called "Dirichlet energy" with respect to the domain under a volume constraint is a standard problem in shape optimization which is now well understood. This article is devoted to a prototypal non-linear version of the…