Convex polynomial and spline approximation in C[-1, 1]

Yingkang Hu, Dany Leviatan, Xiang Ming Yu

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

We prove that a convex function f ∈ C[-1, 1] can be approximated by convex polynomials pn of degree n at the rate of ω3(f, 1/n). We show this by proving that the error in approximating f by C2 convex cubic splines with n knots is bounded by ω3(f, 1/n) and that such a spline approximant has an L third derivative which is bounded by n3ω3(f, 1/n). Also we prove that if f ∈ C2[-1, 1], then it is approximable at the rate of n-2 ω(f″, 1/n) and the two estimates yield the desired result.

Original languageEnglish
Pages (from-to)31-64
Number of pages34
JournalConstructive Approximation
Volume10
Issue number1
DOIs
StatePublished - Mar 1994

Scopus Subject Areas

  • Analysis
  • General Mathematics
  • Computational Mathematics

Keywords

  • AMS classification: 41A10, 41A15, 41A25, 41A29
  • Degree of convex approximation
  • Polynomial and spline approximation

Fingerprint

Dive into the research topics of 'Convex polynomial and spline approximation in C[-1, 1]'. Together they form a unique fingerprint.

Cite this