Related papers: A computational approach to an optimal partition p…
The discrete Laplace operator on a triangulated polyhedral surface is related to geometric properties of the surface. This paper studies extremum problems for eigenvalues of the discrete Laplace operators. Among all triangles, an…
Various methods have been proposed in the literature to determine an optimal partitioning of the set of actors in a network into core and periphery subsets. However, these methods either work only for relatively small input sizes, or do not…
Optimal surface segmentation is a state-of-the-art method used for segmentation of multiple globally optimal surfaces in volumetric datasets. The method is widely used in numerous medical image segmentation applications. However, nodes in…
Creating spherical initial conditions in smoothed particle hydrodynamics simulations that are spherically conformal is a difficult task. Here, we describe two algorithmic methods for evenly distributing points on surfaces, that when paired…
The aim of this paper is to present a first evaluation of a dynamic partition strategy associated to the recently proposed asynchronous distributed computation scheme based on the D-iteration approach. The D-iteration is a fluid diffusion…
In this paper we propose a new approach to least squares approximation problems. This approach is based on partitioning and Schur function. The nature of this approach is combinatorial, while most existing approaches are based on algebra…
Computing high-quality graph partitions is a challenging problem with numerous applications. In this paper, we present a novel meta-heuristic for the balanced graph partitioning problem. Our approach is based on integer linear programs that…
The graph partitioning problem is a well-known NP-hard problem. In this paper, we formulate a 0-1 quadratic integer programming model for the graph partitioning problem with vertex weight constraints and fixed vertex constraints, and…
The Boundary Element Method (BEM) is implemented using piecewise linear elements to solve the two-dimensional Dirichlet problem for Laplace's equation posed on a disk. A benefit of the BEM as opposed to many other numerical solution…
This paper introduces bootstrap multigrid methods for solving eigenvalue problems arising from the discretization of partial differential equations. Inspired by the full bootstrap algebraic multigrid (BAMG) setup algorithm that includes an…
We propose a novel iterative numerical method to solve the three-dimensional inverse obstacle scattering problem of recovering the shape of the obstacle from far-field measurements. To address the inherent ill-posed nature of the inverse…
We develop a discontinuous cut finite element method (CutFEM) for the Laplace-Beltrami operator on a hypersurface embedded in $\mathbb{R}^d$. The method is constructed by using a discontinuous piecewise linear finite element space defined…
In this paper we present a new Eulerian finite element method for the discretization of scalar partial differential equations on evolving surfaces. In this method we use the restriction of standard space-time finite element spaces on a…
We propose a numerical method for solving block-structured mesh partitioning problems based on the variational level-set method of (Zhao et al., J Comput Phys 127, 1996) which has been widely used in many partitioning problems such as image…
Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…
The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related to location, the partition problem can be modeled, in…
There are many applications of graph cuts in computer vision, e.g. segmentation. We present a novel method to reformulate the NP-hard, k-way graph partitioning problem as an approximate minimal s-t graph cut problem, for which a globally…
Large-scale parallel numerical simulations are essential for a wide range of engineering problems that involve complex, coupled physical processes interacting across a broad range of spatial and temporal scales. The data structures involved…
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…
Topology optimization problems often support multiple local minima due to a lack of convexity. Typically, gradient-based techniques combined with continuation in model parameters are used to promote convergence to more optimal solutions;…