Related papers: A computational approach to an optimal partition p…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…
We present a multi-level graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from the multi-grid community. Local improvement algorithms are based max-flow min-cut computations and…
We propose a method to simultaneously compute scalar basis functions with an associated functional map for a given pair of triangle meshes. Unlike previous techniques that put emphasis on smoothness with respect to the Laplace--Beltrami…
We introduce a convergent hierarchy of lower bounds on the minimum value of a real form over the unit sphere. The main practical advantage of our hierarchy over the real sum-of-squares (RSOS) hierarchy is that the lower bound at each level…
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…
Graph partitioning is a key fundamental problem in the area of big graph computation. Previous works do not consider the practical requirements when optimizing the big data analysis in real applications. In this paper, motivated by…
It is shown that eigenvalues of Laplace-Beltrami operators on compact Riemannian manifolds can be determined as limits of eigenvalues of certain finite-dimensional operators in spaces of polyharmonic functions with singularities. In…
Current algorithms for large-scale industrial optimization problems typically face a trade-off: they either require exponential time to reach optimal solutions, or employ problem-specific heuristics. To overcome these limitations, we…
We present some new problems in spectral optimization. The first one consists in determining the best domain for the Dirichlet energy (or for the first eigenvalue) of the {\it metric Laplacian}, and we consider in particular Riemannian or…
We provide new gradient-based methods for efficiently solving a broad class of ill-conditioned optimization problems. We consider the problem of minimizing a function $f : \mathbb{R}^d \rightarrow \mathbb{R}$ which is implicitly…
We consider constructing a surface from a given set of point cloud data. We explore two fast algorithms to minimize the weighted minimum surface energy in [Zhao, Osher, Merriman and Kang, Comp.Vision and Image Under., 80(3):295-319, 2000].…
This survey synthesizes the current state of the art on the regularity theory for solutions to the optimal partition problem. Namely, we consider non-negative, vector-valued Sobolev functions whose components have mutually disjoint support,…
We discuss a variant of multitask n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem asks all vehicles in a group to arrive at a same destination. It can also be viewed as…
We look for best partitions of the unit interval that minimize certain functionals defined in terms of the eigenvalues of Sturm-Liouville problems. Via \Gamma-convergence theory, we study the asymptotic distribution of the minimizers as the…
In this work, we construct a novel numerical method for solving the multi-marginal optimal transport problems with Coulomb cost. This type of optimal transport problems arises in quantum physics and plays an important role in understanding…
In this work is provided a numerical study of a diffusion problem involving a second order term on the domain boundary (the Laplace-Beltrami operator) referred to as the \textit{Ventcel problem}.A variational formulation of the Ventcel…
Recently, collocation based radial basis function (RBF) partition of unity methods (PUM) for solving partial differential equations have been formulated and investigated numerically and theoretically. When combined with stable evaluation…
This article describes a geometric partitioning software that can be used for quick computation of data partitions on many-core HPC machines. It is most suited for dynamic applications with load distributions that vary with time.…
The aim of the present work is to derive a error estimates for the Laplace eigenvalue problem in mixed form, by means of a virtual element method. With the aid of the theory for non-compact operators, we prove that the proposed method is…
The aim of this paper is to propose an efficient adaptive finite element method for eigenvalue problems based on the multilevel correction scheme and inverse power method. This method involves solving associated boundary value problems on…