Related papers: Approximation by polynomials with only real critic…
In this survey, we use (more or less) elementary means to establish the well-known result that for any given smooth multivariate function, the respective multivariate Bernstein polynomials converge to that function in all derivatives on…
We generalize the Bernstein-Walsh-Siciak theorem on polynomial approximation in $\mathbb{C}^n$ to the case where the polynomial ring $\mathcal{P}(\mathbb{C}^n)$ is replaced by a subring $\mathcal{P}^S(\mathbb{C}^n)$ consisting of all…
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…
Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…
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…
This paper considers the approximation of a monomial $x^n$ over the interval $[-1,1]$ by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev…
We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…
Let $\mathscr{C}_\mathbb{Z}([0,1])$ be the metric space of real-valued continuous functions on $[0,1]$ with integer values at $0$ and $1$, equipped with the uniform (supremum) metric $d_\infty$. It is a classical theorem in approximation…
In this paper we study the set of functions $\GG$-valued which can be approximated by $\GG$-valued continuous functions in the norm $L^\infty_{\GG}(I,w)$, where $I$ is a compact interval, $\GG$ is a real and separable Hilbert space and $w$…
Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…
There is presented an approach to find an approximation polynomial of a function with two variables based on the two dimensional discrete Fourier transform. The approximation polynomial is expressed through Chebyshev polynomials. There is…
We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…
We prove an analogue of the classical Bernstein theorem concerning the rate of polynomial approximation of piecewise analytic functions on a compact subset of the real line.
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…
The density of polynomials in a weighted space of infinitely differentiable functions in a multidimensional real space is proved under minimal conditions on weight functions and on differences between weight functions. We apply this result…
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…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
We introduce and study the approximation properties of $g$-polynomials, defined as linear combinations of iterated Stieltjes integrals of a constant function. Focusing on the case where the derivator $g$ has finitely many discontinuities,…
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…
We prove a theorem on distortion of cross ratio of four points under the mapping effected by a complex polynomial with restricted critical values. Its corollaries include inequalities involving the absolute value and certain coefficients of…