Related papers: A computational approach to an optimal partition p…
We address the problem of projecting a point onto a quadratic hypersurface, more specifically a central quadric. We show how this problem reduces to finding a given root of a scalar-valued nonlinear function. We completely characterize one…
In this paper, we employ Bayesian optimization to concurrently explore the optimal values for both the shape parameter and the radius in the partition of unity interpolation using radial basis functions. Bayesian optimization is a…
The Dirichlet eigenvalues of the Laplace-Beltrami operator are larger on an annulus than on any other surface of revolution in $\mathbb{R}^3$ with the same boundary. This is established by defining a sequence of shrinking cylinders about…
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (represented as a matrix of non-negative integers) into rectangles,…
A local and parallel algorithm based on the multilevel discretization is proposed in this paper to solve the eigenvalue problem by the finite element method. With this new scheme, solving the eigenvalue problem in the finest grid is…
We study the eigenvalues of a Laplace-Beltrami operator defined on the set of the symmetric polynomials, where the eigenvalues are expressed in terms of partitions of integers. By assigning partitions with the restricted uniform measure,…
Rational filter functions can be used to improve convergence of contour-based eigensolvers, a popular family of algorithms for the solution of the interior eigenvalue problem. We present a framework for the optimization of rational filters…
We propose and analyze a new stabilized cut finite element method for the Laplace-Beltrami operator on a closed surface. The new stabilization term provides control of the full $\mathbb{R}^3$ gradient on the active mesh consisting of the…
We propose faster algorithms for the following three optimization problems on $n$ collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions. 1- Maximizing total area of disjoint…
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…
In this paper we investigate the optimal partition approach for multiparametric conic linear optimization (mpCLO) problems in which the objective function depends linearly on vectors. We first establish more useful properties of the…
We present and analyze a Virtual Element Method (VEM) of arbitrary polynomial order $k\in\mathbb{N}$ for the Laplace-Beltrami equation on a surface in $\mathbb{R}^3$. The method combines the Surface Finite Element Method (SFEM) [Dziuk,…
This paper presents a mixed basis approach for Laplace eigenvalue problems, which treats the boundary as a perturbation of the free Laplace operator. The method separates the boundary from the volume via a generic function that can be…
The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…
The inversion of the Laplace-Beltrami operator and the computation of the Hodge decomposition of a tangential vector field on smooth surfaces arise as computational tasks in many areas of science, from computer graphics to machine learning…
We introduce a new local meshfree method for the approximation of the Laplace-Beltrami operator on a smooth surface of co-dimension one embedded in $\R^3$. A key element of this method is that it does not need an explicit expression of the…
We study the balanced $k$-way hypergraph partitioning problem, with a special focus on its practical applications to manycore scheduling. Given a hypergraph on $n$ nodes, our goal is to partition the node set into $k$ parts of size at most…
We consider the problem of partitioning the edges of a graph into as few paths as possible. This is a~subject of the classic conjecture of Gallai and a recurring topic in combinatorics. Regarding the complexity of partitioning a graph…
Elliptic partial differential equations on surfaces play an essential role in geometry, relativity theory, phase transitions, materials science, image processing, and other applications. They are typically governed by the Laplace-Beltrami…
Given a rectangle $R$ with area $A$ and a set of areas $L=\{A_1,...,A_n\}$ with $\sum_{i=1}^n A_i = A$, we consider the problem of partitioning $R$ into $n$ sub-regions $R_1,...,R_n$ with areas $A_1,...,A_n$ in a way that the total…