We prove a direct theorem for convex polynomial L p-approximation, 0 < p < 1, in terms of the classical modulus of smoothness! 3 (f; t) p. This theorem may be regarded as an extension to L p of the well-known pointwise estimates of the Timan type and their variants of R. DeVore, Y. K. Hu and D. Leviatan for convex approximation in L p. It leads to a characterization of convex functions in Lipschitz classes (and more general Besov spaces) in terms of their approximation by algebraic polynomials
Abstract. Let f ∈ C[−1, 1] change its convexity finitely many times in the interval, say s times, at...
We discuss whether on not it is possible to have interpolatory estimates in the approximation of a f...
AbstractThe best polynomial approximation is closely related to the Ditzian–Totik modulus of smoothn...
AbstractWe prove direct and inverse theorems for the classical modulus of smoothness and approximati...
AbstractWe prove direct and inverse theorems for the classical modulus of smoothness and approximati...
AbstractWe prove that for each convex function ƒ ∈ Lp, 0 < p < 1, there exists a convex algebraic po...
AbstractA convex function f given on [−1, 1] can be approximated in Lp, 1 < p < ∞, by convex polynom...
AbstractA convex function f given on [−1, 1] can be approximated in Lp, 1 < p < ∞, by convex polynom...
Polynomial approximation on convex polytopes in \mathbf{R}^d is considered in uniform and L^p-norms....
AbstractWe obtain uniform estimates for monotone and convex approximation of functions by algebraic ...
AbstractWe obtain uniform estimates for monotone and convex approximation of functions by algebraic ...
AbstractIn this paper we show that the best approximation of a convex function by convex algebraic p...
AbstractIn this paper we show that the best approximation of a convex function by convex algebraic p...
AbstractWe state some pointwise estimates for the rate of weighted approximation of a continuous fun...
Abstract. We prove that a convex function f 2 L p [1; 1], 0 < p < 1, can be approxi-mated by c...
Abstract. Let f ∈ C[−1, 1] change its convexity finitely many times in the interval, say s times, at...
We discuss whether on not it is possible to have interpolatory estimates in the approximation of a f...
AbstractThe best polynomial approximation is closely related to the Ditzian–Totik modulus of smoothn...
AbstractWe prove direct and inverse theorems for the classical modulus of smoothness and approximati...
AbstractWe prove direct and inverse theorems for the classical modulus of smoothness and approximati...
AbstractWe prove that for each convex function ƒ ∈ Lp, 0 < p < 1, there exists a convex algebraic po...
AbstractA convex function f given on [−1, 1] can be approximated in Lp, 1 < p < ∞, by convex polynom...
AbstractA convex function f given on [−1, 1] can be approximated in Lp, 1 < p < ∞, by convex polynom...
Polynomial approximation on convex polytopes in \mathbf{R}^d is considered in uniform and L^p-norms....
AbstractWe obtain uniform estimates for monotone and convex approximation of functions by algebraic ...
AbstractWe obtain uniform estimates for monotone and convex approximation of functions by algebraic ...
AbstractIn this paper we show that the best approximation of a convex function by convex algebraic p...
AbstractIn this paper we show that the best approximation of a convex function by convex algebraic p...
AbstractWe state some pointwise estimates for the rate of weighted approximation of a continuous fun...
Abstract. We prove that a convex function f 2 L p [1; 1], 0 < p < 1, can be approxi-mated by c...
Abstract. Let f ∈ C[−1, 1] change its convexity finitely many times in the interval, say s times, at...
We discuss whether on not it is possible to have interpolatory estimates in the approximation of a f...
AbstractThe best polynomial approximation is closely related to the Ditzian–Totik modulus of smoothn...