Related papers: A Deterministic Algorithm of Quasi-Polynomial Comp…
This paper proposes a new deterministic sampling strategy for constructing polynomial chaos approximations for expensive physics simulation models. The proposed approach, effectively subsampled quadratures involves sparsely subsampling an…
We present a classical algorithm that, for any $D$-dimensional geometrically-local, quantum circuit $C$ of polylogarithmic-depth, and any bit string $x \in {0,1}^n$, can compute the quantity $|<x|C|0^{\otimes n}>|^2$ to within any…
In a previous study (quant-ph/9911058), several remarkably simple exact results were found, in certain specialized m-dimensional scenarios (m<5), for the a priori probability that a pair of qubits is unentangled/separable. The measure used…
We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved…
We construct and analyze a finite volume scheme for numerical solution of a three-dimensional Poisson equation. This is an extension of a two-dimensional approach by Suli 1991. Here we derive optimal convergence rates in the discrete H^1…
In this paper we study "discrete polynomial blending," a term used to define a certain discretized version of curve blending whereby one approximates from the "sum of tensor product polynomial spaces" over certain grids. Our strategy is to…
We give a method for computing asymptotic formulas and approximations for the volumes of spectrahedra, based on the maximum-entropy principle from statistical physics. The method gives an approximate volume formula based on a single convex…
In this paper we introduce a new family of Bernstein-type exponential polynomials on the hypercube $[0, 1]^d$ and study their approximation properties. Such operators fix a multidimensional version of the exponential function and its…
Intrinsic volumes, which generalize both Euler characteristic and Lebesgue volume, are important properties of $d$-dimensional sets. A random cubical complex is a union of unit cubes, each with vertices on a regular cubic lattice,…
This paper studies a generalization of hyperinterpolation over the high-dimensional unit cube. Hyperinterpolation of degree \( m \) serves as a discrete approximation of the \( L_2 \)-orthogonal projection of the same degree, using Fourier…
We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the…
In recent years, various subspace algorithms have been developed to handle large-scale optimization problems. Although existing subspace Newton methods require fewer iterations to converge in practice, the matrix operations and full…
We find minimal and maximal length of intersections of lines at a fixed distance to the origin with the cross-polytope. We also find maximal volume noncentral sections of the cross-polypote by hyperplanes which are at a fixed large distance…
The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…
In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by…
The purpose of this work is to introduce a strategy for determining the nodes and weights of a low-cardinality positive cubature formula nearly exact for polynomials of a given degree over spherical polygons. In the numerical section we…
Denote by Q_d the d-dimensional hypercube. Addressing a recent question we estimate the number of ways the vertex set of Q_d can be partitioned into vertex disjoint smaller cubes. Among other results, we prove that the asymptotic order of…