Related papers: A geometry-based relaxation algorithm for equilibr…
This paper proposes a novel computationally efficient dynamic bi-orthogonality based approach for calibration of a computer simulator with high dimensional parametric and model structure uncertainty. The proposed method is based on a…
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…
We introduce Renet, a principled generalization of the Relaxed Lasso to the Elastic Net family of estimators. While, on the one hand, $\ell_1$-regularization is a standard tool for variable selection in high-dimensional regimes and, on the…
The coupled evolution of an eroding cylinder immersed in a fluid within the subcritical Reynolds range is explored with scale resolving simulations. Erosion of the cylinder is driven by fluid shear stress. K\'arm\'an vortex shedding…
One of the most fundamental ingredients in mixed-integer nonlinear programming solvers is the well-known McCormick relaxation for a product of two variables x and y over a box-constrained domain. The starting point of this paper is the fact…
Polymer systems in slab geometries are studied on the basis of the recently presented Gaussian Ellipsoid Model [J. Chem. Phys. 114, 7655 (2001)].The potential of the confining walls has an exponential shape. For homogeneous systems in…
We present calculations of forces for two dimensional static sandpile models. Using a symbolic calculation software we obtain exact results for several different orientations of the lattice and for different types of supporting surfaces.…
We propose a tensor-network algorithm for discrete-time stochastic dynamics of a homogeneous system in the thermodynamic limit. We map a $d$-dimensional nonequilibrium Markov process to a $(d+1)$-dimensional infinite tensor network by using…
This paper presents an algorithm to generate a new kind of polygonal mesh obtained from triangulations. Each polygon is built from a terminal-edge region surrounded by edges that are not the longest-edge of any of the two triangles that…
The response of many materials to applied forces and boundary constraints depends upon internal geometric changes at multiple submacroscopic levels. Hierarchical structured deformations provide a mathematical setting for the description of…
Assemblies of anisotropic particles commonly appear in studies of active many-body systems. However, in two dimensions, the geometric ramifications of the finite density of such objects are not entirely understood. To fully characterize…
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…
We study the non--equilibrium motion of an elastic string in a two dimensional pinning landscape using Langevin dynamics simulations. The relaxation of a line, initially flat, is characterized by a growing length, $L(t)$, separating the…
Estimating 3D human poses from 2D images is challenging due to occlusions and projective acquisition. Learning-based approaches have been largely studied to address this challenge, both in single and multi-view setups. These solutions…
The relaxational dynamics of 1+1 dimensional directed polymer in random potential is studied by Monte Carlo simulation. A series of temperature quench experiments is performed changing waiting times. Clear crossover from quasi-equilibrium…
We simulate a growth model with restricted surface relaxation process in d=1 and d=2, where d is the dimensionality of a flat substrate. In this model, each particle can relax on the surface to a local minimum, as the Edwards-Wilkinson…
This paper introduces several new algorithms for consensus over the special orthogonal group. By relying on a convex relaxation of the space of rotation matrices, consensus over rotation elements is reduced to solving a convex problem with…
This paper studied the geometric and combinatorial aspects of the classical Lawson's flip algorithm in 1972. Let A be a finite set of points in R2, omega be a height function which lifts the vertices of A into R3. Every flip in…
This paper studies hidden convexity properties associated with constrained optimization problems over the set of rotation matrices $\text{SO}(n)$. Such problems are nonconvex due to the constraint $X \in \text{SO}(n)$. Nonetheless, we show…
Mesh simplification is the process of reducing the number of vertices, edges and triangles in a three-dimensional (3D) mesh while preserving the overall shape and salient features of the mesh. A popular strategy for this is edge collapse,…