Characterization theorem for best polynomial spline approximation with free knots

Abstract

In this paper, we derive a necessary condition for a best approximation by piecewise polynomial functions. We apply nonsmooth nonconvex analysis to obtain this result, which is also a necessary and sufficient condition for inf-stationarity in the sense of Demyanov-Rubinov. We start from identifying a special property of the knots. Then, using this property, we construct a characterization theorem for best free knots polynomial spline approximation, which is stronger than the existing characterisation results when only continuity is required.

Cited by in corpus (7)

• Rational approximation and its application to improving deep learning classifiers
• Multivariate approximation by polynomial and generalised rational functions
• Linear least squares problems involving fixed knots polynomial splines and their singularity study
• The extension of linear inequality method for generalised rational Chebyshev approximation to approximation by general quasilinear functions
• Directional differentiability, coexhausters, codifferentials and polyhedral DC functions
• Converting exhausters and coexhausters
• Alternance Theorems and Chebyshev Splines Approximation