Convex polynomial and spline approximation in \(C[-1,1]\)
From MaRDI portal
Publication:1322596
DOI10.1007/BF01205165zbMath0799.41007MaRDI QIDQ1322596
Yingkang Hu, Xiang Ming Yu, Dany Leviatan
Publication date: 5 May 1994
Published in: Constructive Approximation (Search for Journal in Brave)
Approximation with constraints (41A29) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Spline approximation (41A15)
Related Items (9)
Coconvex polynomial approximation ⋮ Shape-preserving approximation in \(L_ p\) ⋮ Positive and copositive spline approximation in \(L_ p[0,1\)] ⋮ Convex polynomial and spline approximation in \(L_ p, 0<p<\infty\) ⋮ Minimal shape-preserving projections onto Πn ⋮ The existence of shape-preserving operators with a given action ⋮ Shape-preserving approximation by polynomials ⋮ Univariate splines: Equivalence of moduli of smoothness and applications ⋮ Comonotone Jackson's inequality
Cites Work
- Unnamed Item
- Unnamed Item
- Monotone and comonotone polynomial approximation revisited
- Pointwise estimates for monotone polynomial approximation
- Degree of approximation by monotone polynomials. I
- Monotone and Convex Approximation by Splines: Error Estimates and a Curve Fitting Algorithm
- Monotone Approximation by Polynomials
- Pointwise Estimates for Convex Polynomial Approximation
This page was built for publication: Convex polynomial and spline approximation in \(C[-1,1]\)
