Inequalities and Inverse Theorems in Restricted Rational Approximation Theory

Borwein, Peter

Canadian journal of mathematics, Tome 32 (1980) no. 2, pp. 354-361

Résumé

The following lemma, part a) due to S. N. Bernstein and part b) due to A. A. Markov, is fundamental to the proofs of many inverse theorems in polynomial approximation theory.LEMMA 1. [2, p. 62 and p. 67] Let ∏n denote the real polynomials of degree at most n. Let p ∈ ∏n, then a) b) From the lemma one can deduce, for example:THEOREM 1. Iƒ there is a sequence of polynomials pn ∈ ∏n and a δ > 0 so that ‖f – pn‖[a, b] ≧ A/n k + δ then f is k times continuously differentiate on (a, b).We shall refer to inequalities, such as those of Lemma 1 that bound the derivative r′ of a rational function of degree n in terms of its supremum norm ‖r‖[a, b] and n, as Bernstein-type inequalities.

Détail

DOI : 10.4153/CJM-1980-028-5

Bibliographie

[1] 1. Lorentz, G. G., Approximation of functions (Holt, Rinehart and Winston, New York, 1966). Google Scholar

[2] 2. Meinardus, G., Approximation of functions: Theory and numerical methods (Springer-Verlag, New York, 1967). Google Scholar