Approximation of a Convex Function by Convex Algebraic Polynomials in Lp, 1 ≤ p < ∞
✍ Scribed by M. Nikoltjevahedberg
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 276 KB
- Volume
- 73
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we show that the best approximation of a convex function by convex algebraic polynomials in (L_{p}, 1 \leqslant p<x), is (O\left(n^{-2 / p}\right)). 1993 Academic Press. Inc.
📜 SIMILAR VOLUMES
We prove direct and inverse theorems for the classical modulus of smoothness and approximation by algebraic polynomials in \(L_{p}[-1,1]\). These theorems contain the well-known theorems of A. Timan, V. Dzyadyk, G. Freud, and Yu. Brudnyi as special cases when \(p=x\). They also provide a characteriz
In this note we will show that for \(0<p<1\) simultaneous polynomial approximation is not possible. "1995 Academic Press. Inc.
Let n51 and B52: A real-valued function f defined on the n-simplex D n is approximately convex with respect to We determine the extremal function of this type which vanishes on the vertices of D n : We also prove a stability theorem of Hyers-Ulam type which yields as a special case the best constan