Best mean approximation by splines satisfying generalized convexity constraints
From MaRDI portal
Publication:1142945
DOI10.1016/0021-9045(80)90068-4zbMath0441.41015OpenAlexW1968000714MaRDI QIDQ1142945
Publication date: 1980
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(80)90068-4
convexity constraintsbest mean approximation by splinesHermite-Birkhoff interpolation by splinesL1- approximation
Best approximation, Chebyshev systems (41A50) Approximation with constraints (41A29) Spline approximation (41A15)
Related Items
Interpolation by smooth functions under restrictions on the derivatives, Best \(L_ p\) approximation with multiple constraints for \(1\leq p<\infty\)
Cites Work
- Hermite-Birkhoff interpolation and monotone approximation by splines
- Uniform approximation with constraints
- On uniqueness of \(L_1\)-approximation for certain families of spline functions
- Global approximation with bounded coefficients
- One-sided \(L^1\) approximation by splines with fixed knots
- Zeros of spline functions and applications
- Hermite-Birkhoff interpolation by splines
- Further asymptotic properties of best approximation by splines
- The uniqueness of the element of best mean approximation to a continuous function using splines with fixed nodes
- Monotone approximation
- Approximation by polynomials with restricted ranges of their derivatives
- Uniqueness of best approximation by monotone polynomials
- A Partial Characterization of Poised Hermite–Birkhoff Interpolation Problems
