Related papers: A Deterministic Algorithm of Quasi-Polynomial Comp…
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…
A coarse-grained multi-blob description of polymer solutions is presented, based on soft, transferable effective interactions between bonded and non-bonded blobs. The number of blobs is chosen such that the blob density does not exceed…
Let $\RR$ be a real closed field (e.g. the field of real numbers) and $\mathscr{S} \subset \RR^n$ be a semi-algebraic set defined as the set of points in $\RR^n$ satisfying a system of $s$ equalities and inequalities of multivariate…
We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…
We introduce a $0.611$-approximation algorithm for Quantum MaxCut and a $\frac{1+\sqrt{5}}{4} \approx 0.809$-approximation algorithm for the EPR Hamiltonian of [arXiv:2209.02589]. A novel ingredient in both of these algorithms is to…
This paper deals with diffusive limit of the p-system with damping and its approximation by an Asymptotic Preserving (AP) Finite Volume scheme. Provided the system is endowed with an entropy-entropy flux pair, we give the convergence rate…
In this paper we study the problem of hyperball (hypersphere) packings in $3$-dimensional hyperbolic space. We introduce a new definition of the non-compact saturated ball packings and describe to each saturated hyperball packing, a new…
We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a finite-range stable potential. This result holds for all activities $\lambda$ for which the…
The intersection of two orthogonal cylinders represents a classical problem in computational geometry with direct applications to engineering design, manufacturing, and numerical simulation. While analytical solutions exist for the fully…
For special $d$-dimensional hyperbolic shells $E$ with $ d\geq 5$ we show that the number of lattice points in $E$ intersected with a $d$-dimensional cube $C_r$ of edge length $r$, can be approximated by the volume of $E\cap C_r$, as $r$…
We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…
The quasi--equilibrium or maximum entropy approximation is applied in order to derive constitutive equations from kinetic models of polymer dynamics. It is shown in general and illustrated for an example how canonical distribution functions…
The maximum volume $j$-simplex problem asks to compute the $j$-dimensional simplex of maximum volume inside the convex hull of a given set of $n$ points in $\mathbb{Q}^d$. We give a deterministic approximation algorithm for this problem…
This paper is about minimum cost constrained selection of inputs and outputs for generic arbitrary pole placement. The input-output set is constrained in the sense that the set of states that each input can influence and the set of states…
We propose a deterministic particle method for a one-dimensional nonlocal equation with interactions through the repulsive Morse potential. We show that the particle method converges as the number of particles goes to infinity towards weak…
We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…
We describe stochastic Newton and stochastic quasi-Newton approaches to efficiently solve large linear least-squares problems where the very large data sets present a significant computational burden (e.g., the size may exceed computer…
As the main problem, we consider covering of a $d$-dimensional cube by $n$ balls with reasonably large $d$ (10 or more) and reasonably small $n$, like $n=100$ or $n=1000$. We do not require the full coverage but only 90\% or 95\% coverage.…