Are the degrees of best (co)convex and unconstrained polynomial approximation the same?

DOI10.1007/S10474-009-8111-4zbMath1265.41010OpenAlexW3015570340MaRDI QIDQ1046899

I. A. Shevchuk, Kirill A. Kopotun, Dany Leviatan

Publication date: 29 December 2009

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-009-8111-4

zbMATH Keywords

degree of approximation(co)convex approximation by polynomials

Mathematics Subject Classification ID

Approximation with constraints (41A29) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)

Related Items (3)

Comparing the degrees of unconstrained and shape preserving approximation by polynomials ⋮ On the degree of piecewise shape-preserving approximation by polynomials ⋮ Positive results and counterexamples in comonotone approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Uniform estimates of monotone and convex approximation of smooth functions
• Coconvex approximation.
• Coconvex approximation in the uniform norm: the final frontier
• Degree of approximation by monotone polynomials. II
• Convex Polynomial Approximation in the Uniform Norm: Conclusion
• The degree of coconvex polynomial approximation

This page was built for publication: Are the degrees of best (co)convex and unconstrained polynomial approximation the same?