
In contrast to the behavior of best uniform polynomial approximants on [ 0 , 1 ] [0,1] we show that if f ∈ C [ 0 , 1 ] f \in C[0,1] there exists a sequence of polynomials { P n } \{ {P_n}\} of respective degree ≤ n \leq n which converges uniformly to f f on [ 0 , 1 ] [0,1] and geometrically fast at each point of [ 0 , 1 ] [0,1] where f f is analytic. Moreover we describe the best possible rates of convergence at all regular points for such a sequence.
Approximation by polynomials, algebraic polynomials, Rate of convergence, degree of approximation, rates of convergence, best uniform polynomial approximants
Approximation by polynomials, algebraic polynomials, Rate of convergence, degree of approximation, rates of convergence, best uniform polynomial approximants
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
