Are the degrees of best (co)convex and unconstrained polynomial approximation the same?
type: Item
instance of: scholarly article
title: Are the degrees of best (co)convex and unconstrained polynomial approximation the same?
zbMATH Open document ID: 1265.41010
author: I. O. Shevchuk
author: Kirill A. Kopotun
author: D. Leviatan
published in: Acta Mathematica Hungarica
publication date: 2009-12-29T00:00:00Z
Mathematics Subject Classification ID: 41A10
Mathematics Subject Classification ID: 41A25
Mathematics Subject Classification ID: 41A29
zbMATH DE Number: 5652022
zbMATH Keywords: (co)convex approximation by polynomials
zbMATH Keywords: degree of approximation
MaRDI profile type: Publication
full work available at URL: s10474-009-8111-4
OpenAlex ID: W3015570340
cites work: Q3817079
cites work: Q3522935
cites work: Uniform estimates of monotone and convex approximation of smooth functions
cites work: The degree of coconvex polynomial approximation
cites work: Convex Polynomial Approximation in the Uniform Norm: Conclusion
cites work: Coconvex approximation in the uniform norm: the final frontier
cites work: Coconvex approximation.
cites work: Degree of approximation by monotone polynomials. II
DOI: 10.1007/S10474-009-8111-4
description: scientific article; zbMATH DE number 5652022