Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Constrained Spline Smoothing (1403.7983v1)

Published 31 Mar 2014 in math.NA and math.CA

Abstract: Several results on constrained spline smoothing are obtained. In particular, we establish a general result, showing how one can constructively smooth any monotone or convex piecewise polynomial function (ppf) (or any $q$-monotone ppf, $q\geq 3$, with one additional degree of smoothness) to be of minimal defect while keeping it close to the original function in the ${\mathbb L}p$-(quasi)norm. It is well known that approximating a function by ppf's of minimal defect (splines) avoids introduction of artifacts which may be unrelated to the original function, thus it is always preferable. On the other hand, it is usually easier to construct constrained ppf's with as little requirements on smoothness as possible. Our results allow to obtain shape-preserving splines of minimal defect with equidistant or Chebyshev knots. The validity of the corresponding Jackson-type estimates for shape-preserving spline approximation is summarized, in particular we show, that the ${\mathbb L}_p$-estimates, $p\ge1$, can be immediately derived from the ${\mathbb L}\infty$-estimates.

Summary

We haven't generated a summary for this paper yet.