Related papers: Weak-star convergence and a polynomial approximati…

We strengthen the Weierstrass approximation theorem by proving that any real-valued continuous function on an interval $I \subset \mathbb{R}$ can be uniformly approximated by a real-valued polynomial whose only (possibly complex) critical…

The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…

Let $k$ be a field, $V$ a $k$-vector space and $X$ be a subset of $V $. A function $f:X\to k$ is weakly polynomial of degree $\leq a$, if the restriction of $f$ on any affine subspace $L\subset X$ is a polynomial of degree $\leq a$. In this…

We study best approximation to a given function, in the least square sense on a subset of the unit circle, by polynomials of given degree which are pointwise bounded on the complementary subset. We show that the solution to this problem, as…

We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…

We strengthen the classical approximation theorems of Weierstrass, Runge and Mergelyan by showing the polynomial and rational approximants can be taken to have a simple geometric structure. In particular, when approximating a function $f$…

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

We introduce the notions of $\varepsilon$-approximate fixed point and weak $\varepsilon$-approximate fixed point. We show that for a group of unitary matrices even the existence of a nontrivial weak $\varepsilon$-approximate fixed point for…

The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…

Given a finite point set $P\subset\mathbb{R}^d$, we call a multiset $A$ a one-sided weak $\varepsilon$-approximant for $P$ (with respect to convex sets), if $|P\cap C|/|P|-|A\cap C|/|A|\leq\varepsilon$ for every convex set $C$. We show…

Let $E$ be a compact set in $\mathbb C$ with connected complement, and let $A(E)$ be the class of all complex continuous function on $E$ that are analytic in the interior $E^0$ of $E$. Let $f \in A(E)$ be zero free on $E^0$. By Mergelyan's…

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…

Let $T\subset\mathbb{R}$, $M$ be a metric space with metric $d$, and $M^T$ be the set of all functions mapping $T$ into $M$. Given $f\in M^T$, we study the properties of the approximate variation $\{V_\varepsilon(f)\}_{\varepsilon>0}$,…

Let $ f_0 $ and $ f_\infty $ be formal power series at the origin and infinity, and $ P_n/Q_n $, with $ \mathrm{deg}(P_n),\mathrm{deg}(Q_n)\leq n $, be a rational function that simultaneously interpolates $ f_0 $ at the origin with order $…

We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…

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…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

The paper concerns the uniform polynomial approximation of a function $f$, continuous on the unit Euclidean sphere of ${\mathbb R}^3$ and known only at a finite number of points that are somehow uniformly distributed on the sphere. First we…

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…