Related papers: Polynomial approximation on a compact subset of th…

In this paper we demonstrate how to partition the real number line into four subsets which may be reassembled, via "piecewise rigid functions" that preserve Lebesgue measure, into two copies of the line. We then employ a similar process to…

We investigate approximation of a Bernoulli partial sum process to the accompanying Poisson process in the non-i.i.d. case. The rate of closeness is studied in terms of the minimal distance in probability.

We give the theorem of coincidence of a class of functions defined by a generalised modulus of smoothness with a class of functions defined by the order of the best approximation by algebraic polynomials. We also prove the appropriate…

We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…

In [14,26], new approximation classes of self-referential functions are introduced as fractal versions of the classes of polynomials and rational functions. As a sequel, in the present article, we define a new approximation class consisting…

It is shown how piecewise differentiable functions $F: \mathbb R^n \mapsto \mathbb R^m $ that are defined by evaluation programs can be approximated locally by a piecewise linear model based on a pair of sample points $\check x$ and $\hat…

For a nonempty compact subset $\sigma$ in the plane, the space $AC(\sigma)$ is the closure of the space of complex polynomials in two real variables under a particular variation norm. In the classical setting, $AC[0,1]$ contains several…

Let X be a separable Banach space which admits a separating polynomial; in particular X a separable Hilbert space. Let $f:X \rightarrow R$ be bounded, Lipschitz, and $C^1$ with uniformly continuous derivative. Then for each {\epsilon}>0,…

We prove an effective version of the Oppenheim conjecture with a polynomial error rate. The proof is based on an effective equidistribution theorem which in turn relies on recent progress towards restricted projection problem.

In this short note we prove that, if (C[a,b],{A_n}) is an approximation scheme and (A_n) satisfies de La Vall\'ee-Poussin Theorem, there are instances of continuous functions on [a,b], real analytic on (a,b], which are poorly approximable…

In this paper, we give a sharp lower bound for the minimum deviation of the Chebyshev polynomial on a compact subset of the real line in terms of the corresponding logarithmic capacity. Especially if the set is the union of several real…

In this work, we introduce new approximation operators for univariate set-valued functions with general compact images. We adapt linear approximation methods for real-valued functions by replacing linear combinations of numbers with new…

Grouped data are commonly encountered in applications. The Bernstein polynomial model is proposed as an approximate model in this paper for estimating a univariate density function based on grouped data. The coefficients of the Bernstein…

We solve the convergence case of the generalized Baker-Schmidt problem for simultaneous approximation on affine subspaces, under natural diophantine type conditions. In one of our theorems, we do not require monotonicity on the…

In this paper we present a geometric proof of the following fact. Let $D$ be a Jordan domain in $\mathbb{C}$, and let $f$ be analytic on $cl(D)$. Then there is an injective analytic map $\phi:D\to\mathbb{C}$, and a polynomial $p$, such that…

We consider the problem of approximation of a continuous function $f$ defined on a compact metric space $X$ by elements from a sum of two algebras. We prove a de la Vall\'{e}e Poussin type theorem, which estimates the approximation error…

Bernstein polynomial approximation to a continuous function has a slower rate of convergence as compared to other approximation methods. "The fact seems to have precluded any numerical application of Bernstein polynomials from having been…

Let $U$ be a bounded open subset of the complex plane and let $A_{\alpha}(U)$ denote the set of functions analytic on $U$ that also belong to the little Lipschitz class with Lipschitz exponent $\alpha$. It is shown that if $A_{\alpha}(U)$…

Unlike the classical polynomial case there has not been invented up to very recently a tool similar to the Bernstein-Bezier representation which would allow us to control the behavior of the exponential polynomials. The exponential analog…

The problem of minimizing a polynomial over the standard simplex is one of the basic NP-hard nonlinear optimization problems --- it contains the maximum clique problem in graphs as a special case. It is known that the problem allows a…