Related papers: Polynomial approximation of piecewise analytic fun…
Let {X_n} be a sequence of analytic sets converging to some analytic set X in the sense of holomorphic chains. We introduce a condition which implies that every irreducible component of X is the limit of a sequence of irreducible components…
A fully implementable filtered polynomial approximation on spherical shells is considered. The method proposed is a quadrature-based version of a filtered polynomial approximation. The radial direction and the angular direction of the…
In this paper we consider class of continuous functions, called quasiaharmonic functions, admitting best approximations by harmonic polynomials. In this class we prove a uniqueness theorem by analogy with the analytic functions.
We design a new, fast algorithm for agnostically learning univariate probability distributions whose densities are well approximated by piecewise polynomial functions. Let $f$ be the density function of an arbitrary univariate distribution,…
Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…
Recently we found necessary and sufficient conditions for the convergence at a preassigned point of the spherical partial sums of the Fourier integral in a class of piecewise smooth functions in Euclidean space. These yield elementary…
The paper studies semi-almost periodic holomorphic functions on a polydisk which have, in a sense, the weakest possible discontinuities on the boundary torus. The basic result used in the proofs is an extension of the classical Bohr…
For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…
Because of the high approximation power and simplicity of computation of smooth radial basis functions (RBFs), in recent decades they have received much attention for function approximation. These RBFs contain a shape parameter that…
This note is concerned with accurate and computationally efficient approximations of moments of Gaussian random variables passed through sigmoid or softmax mappings. These approximations are semi-analytical (i.e. they involve the numerical…
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
We construct a smooth real-valued function P(n) in [0,1], defined via a triple integral with a periodic kernel, that approximates the characteristic function of prime numbers. The function is built to suppress when n is divisible by some m…
Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…
Given a system of functions f = (f1, . . . , fd) analytic on a neighborhood of some compact subset E of the complex plane, we give necessary and sufficient conditions for the convergence with geometric rate of the common denominators of…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
Recent work has shown the surprising power of low-degree sandwiching polynomial approximators in the context of challenging learning settings such as learning with distribution shift, testable learning, and learning with contamination. A…
We propose an algorithm that approximates a given matrix polynomial of degree $d$ by another skew-symmetric matrix polynomial of a specified rank and degree at most $d$. The algorithm is built on recent advances in the theory of generic…
In metric of spaces $L_{s}, \ 1\leq s\leq\infty$, we obtain exact in order estimates of best $m$-term trigonometric approximations of classes of convolutions of periodic functions, that belong to unit all of space $L_{p}, \ 1\leq…