Constrained Spline Smoothing

DOI10.1137/060658746MaRDI QIDQ3395082zbMATH OpenOpenAlexFDO

Authors Kirill A. Kopotun, D. Leviatan, A. V. Prymak

Publication date 20 August 2009

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.7983

zbMATH Keywords

constrained spline smoothingconvex spline approximationJackson-type estimatesminimal defectmonotone spline approximationpiecewise polynomial functionsshape-preserving spline approximationsmoothingsplines

Mathematics Subject Classification ID

Spline approximation (41A15) Rate of convergence, degree of approximation (41A25) Approximation with constraints (41A29) Numerical computation using splines (65D07) Numerical smoothing, curve fitting (65D10)

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, $qgeq3$, with one additional degree of smoothness) to be of minimal defect while keeping it close to the original function in the ${mathbbL}_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 ${mathbbL}_p$-estimates, $pge1$, can be immediately derived from the ${mathbbL}_{i}nfty$-estimates.

Recommendations

• Nearly monotone and nearly convex approximation by smooth splines in \(\mathbb L_p, p>0\)
• Smoothing noisy data under monotonicity constraints existence, characterization and convergence rates
• Shape-preserving approximation by spline functions
• An algorithm for computing constrained smoothing spline functions
• Interpolation and approximation by monotone cubic splines

Cited in

(9)

• Nearly monotone and nearly convex approximation by smooth splines in \(\mathbb L_p, p>0\)
• Constrained interpolation and smoothing
• Smoothing noisy data under monotonicity constraints existence, characterization and convergence rates
• Spline smoothing under constraints on derivatives
• Interpolatory pointwise estimates for convex polynomial approximation
• A smoothing stochastic simulated annealing method for localized shapes approximation
• scientific article; zbMATH DE number 2064494 (Why is no real title available?)
• Smoothing Splines and Shape Restrictions
• Three-monotone spline approximation

This page was built for publication: Constrained Spline Smoothing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395082)