Related papers: Approximation with one-bit polynomials in Bernstei…

In the paper we consider the problem of multivariate function approximation in polynomial basis. In order to solve this problem, we adjust the least squares method (LSM) by adding information about derivatives of the function. This…

This paper considers binomial approximation of continuous time stochastic processes. It is shown that, under some mild integrability conditions, a process can be approximated in mean square sense and in other strong metrics by binomial…

Let $\alpha_{n1},\dots,\alpha_{nn}$ be the zeros of the $n$th Bessel polynomial $y_n(z)$ and let $a_{nk}=1-\alpha_{nk}/2$, $b_{nk}=1+\alpha_{nk}/2$ $(k=1,\dots,n)$. We propose the new formula \[z f'(z)\approx \sum_{k=1}^n \big(f(a_{nk}…

We prove a version of the Bernstein-Walsh theorem on uniform polynomial approximation of holomorphic functions on compact sets in several complex variables. Here we consider subclasses of the full polynomial space associated to a convex…

In this paper, we introduce a new class of positive linear operators that generalize the classical Bernstein operators. Specifically, we construct a sequence of operators that reproduce the logarithmic function $\ln(1+\mu+x)$, with $\mu >…

In this article, we achieve some general statistical approximation results for $ \lambda $-Bernstein operators in addition to some other approximation properties. We prove a statistical Voronovskaja-type approximation theorem. We also…

Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

We investigate affine Berkovich spaces over maximally complete fields and prove that they may be approximated by simpler spaces when the only functions we need to evaluate are polynomials of bounded degree. We derive applications to…

We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…

In this paper we generalize to a certain class of Stein manifolds the Bernstein-Walsh-Siciak theorem which describes the equivalence between possible holomorphic continuation of a function $f$ defined on a compact set $K$ in $\mathbb{C}^N$…

In this paper we develop a theory of matrix completion for the extreme case of noisy 1-bit observations. Instead of observing a subset of the real-valued entries of a matrix M, we obtain a small number of binary (1-bit) measurements…

Many problems are NP-hard and, unless P = NP, do not admit polynomial-time exact algorithms. The fastest known exact algorithms exactly usually take time exponential in the input size. Much research effort has gone into obtaining faster…

It is not surprising that one should expect that the degree of constrained (shape preserving) approximation be worse than the degree of unconstrained approximation. However, it turns out that, in certain cases, these degrees are the same.…

We study the approximation of univariate and multivariate set-valued functions (SVFs) by the adaptation to SVFs of positive samples-based approximation operators for real-valued functions. To this end, we introduce a new weighted average of…

Let ${{\bf x}}=(x_1,\dots,x_d) \in [-1,1]^d$ be linearly independent over $\mathbb Z$, set $K=\{(e^{z},e^{x_1 z},e^{x_2 z}\dots,e^{x_d z}): |z| \le 1\}.$ We prove sharp estimates for the growth of a polynomial of degree $n$, in terms of…

The purpose of this paper is to establish L^p error estimates, a Bernstein inequality, and inverse theorems for approximation by a space comprising spherical basis functions located at scattered sites on the unit n-sphere. In particular,…

The problem of minimization of the sum of two convex functions has various theoretical and real-world applications. One of the popular methods for solving this problem is the proximal gradient method (proximal forward-backward algorithm). A…

We give a {\em deterministic} algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree-$2$ polynomial threshold function. Given a degree-2 input polynomial $p(x_1,\dots,x_n)$ and a parameter $\eps >…

Let X be an analytic set defined by polynomials whose coefficients a_1,...,a_s are holomorphic functions. We formulate conditions such that for all sequences {a_(1,n)},...,{a_(s,n)} of holomorphic functions converging locally uniformly to…