One cubic 3-monotone spline
German Dzyubenko

TL;DR
This paper constructs cubic 3-monotone splines that closely approximate 3-monotone functions with explicit error bounds based on the function's smoothness, using nearly equidistant knots.
Contribution
It introduces a method to construct cubic 3-monotone splines with explicit approximation error bounds for 3-monotone functions.
Findings
Spline approximation error is bounded by the 4th modulus of smoothness.
Constructed splines have nearly equidistant knots.
Approximation is valid on each subinterval with a universal constant.
Abstract
For any 3-monotone on function (its third divided differences are nonnegative for all choices of four distinct points, or equivalently, has a convex derivative on ) we construct a cubic 3-monotone (like ) spline with "almost" equidistant knots such that where is an absolute constant, is the -th modulus of smoothness of , and is the max-norm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Approximation Theory and Sequence Spaces · Mathematical Approximation and Integration
