Related papers: Minimal Partitions for p-norms of Eigenvalues

This paper is concerned with the numerical minimization of energy functionals in Hilbert spaces involving convex constraints coinciding with a semi-norm for a subspace. The optimization is realized by alternating minimizations of the…

We study the problem of minimizing the second Dirichlet eigenvalue for the Laplacian operator among sets of given perimeter. In two dimensions, we prove that the optimum exists, is convex, regular, and its boundary contains exactly two…

For numerical approximation the reformulation of a PDE as a residual minimisation problem has the advantages that the resulting linear system is symmetric positive definite, and that the norm of the residual provides an a posteriori error…

In this paper we study an optimal shape design problem for the first eigenvalue of the fractional $p-$laplacian with mixed boundary conditions. The optimization variable is the set where the Dirichlet condition is imposed (that is…

This paper gives a framework to produce the lower bound of eigenvalues defined in a Hilbert space by the eigenvalues defined in another Hilbert space. The method is based on using the max-min principle for the eigenvalue problems.

In this paper, we investigate the Dirchlet eigenvalue problems of poly-Laplacian with any order and quadratic polynomial operator of the Laplacian. We give some estimates for lower bounds of the sums of their first $k$ eigenvalues which…

We are interested in the spectrum of the Dirichlet Laplacian in thin broken strips with angle $\alpha$. Playing with symmetries, this leads us to investigate spectral problems for the Laplace operator with mixed boundary conditions in…

Extremal optimization is a new general-purpose method for approximating solutions to hard optimization problems. We study the method in detail by way of the NP-hard graph partitioning problem. We discuss the scaling behavior of extremal…

We study the validity of the comparison and maximum principles, and their relation with principal eigenvalues, for a class of degenerate nonlinear operators that are extremal among operators with one dimensional fractional diffusion.

We study partitions of the rectangular two-dimensional flat torus of length 1 and width b into k domains, with b a parameter in (0, 1] and k an integer. We look for partitions which minimize the energy, definedas the largest first…

Given a conformal action of a discrete group on a Riemann surface, we study the maximization of Laplace and Steklov eigenvalues within a conformal class, considering metrics invariant under the group action. We establish natural conditions…

We prove existence results for optimization problems for the $k$th Laplace eigenvalue on closed Riemannian manifolds of dimension $m \geq 3$, depending on the choice of normalization. One such normalization leads to eigenvalue optimization…

Let $\om $ be a bounded domain in an $n$-dimensional Euclidean space $\Bbb R^n$. We study eigenvalues of an eigenvalue problem of a system of elliptic equations: $$ \{\aligned &\Delta {\mathbf u}+ \alpha{\rm grad}(\text{div}{\mathbf…

In many submodular optimization applications, datasets are naturally partitioned into disjoint subsets. These scenarios give rise to submodular optimization problems with partition-based constraints, where the desired solution set should be…

In this paper we discuss spectral properties of operators associated with the least-squares finite element approximation of elliptic partial differential equations. The convergence of the discrete eigenvalues and eigenfunctions towards the…

We study the first eigenvalue of the $p-$Laplacian (with $1<p<\infty$) on a quantum graph with Dirichlet or Kirchoff boundary conditions on the nodes. We find lower and upper bounds for this eigenvalue when we prescribe the total sum of the…

We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…

We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a positive cost function c: V-> Z^{+}, a partition $P_1,..., P_r$ of the edge set $E$, and a parameter $k_i$ for each…

We introduce and study $\ell_p$-norm-multiway-cut: the input here is an undirected graph with non-negative edge weights along with $k$ terminals and the goal is to find a partition of the vertex set into $k$ parts each containing exactly…

The paper deals with an eigenvalue problems possessing infinitely many positive and negative eigenvalues. Inequalities for the smallest positive and the largest negative eigenvalues, which have the same properties as the fundamental…