scientific article; zbMATH DE number 3861725
Kalandiya's theorem in approximation theory states that: Let f(x) be a Hölder-continuous function of order \(\alpha\) on [-1,1] and \(p_ n(x)\) an algebraic polynomial of degree \(\leq n\) for which: (1) \(| r_ n(x)| \leq A_ 1n^{-\alpha}, r_ n(x)=f(x)-p_ n(x),\) \(x\in [- 1,1]\), where \(A_ 1\) is a constant. (The existence of \(p_ n(x)\) is assured by Jackson's theorem.) Then the following estimate is valid: \[ (2)\quad \max_{x_ 1,x_ 2\in [-1,1]}(| r_ n(x_ 2)-r_ n(x_ 1)| /| x_ 2-x_ 1|^{\beta})\leq A_ 2n^{-\alpha +2\beta}, \] where \(\beta\) is a positive number such that \(2\beta<\alpha\) and \(A_ 2\) is a constant depending on \(\alpha\) and \(\beta\) (but independent of n). This theorem has been repeatedly used for the proof of convergence of quadrature rules for Cauchy type principal value integrals. In this note a new proof of this theorem is proposed. This proof is very short and elementary (contrary to the original one), based just on a bound for \(| p'\!_ n(x)|\) on [-1,1] and on the mean value theorem. It can finally be added that in a subsequent note by the author [J. Approximation Theory 38, 354-356 (1983; Zbl 0522.41004)] the bound in the right side of (2) was improved to \(A_ 3n^{-\alpha +\beta} (A_ 3\) being a constant) for an appropriate (but always existing) sequence of polynomials \(p_ n(x)\) approximating f(x).
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3329894)