Characterisation theorem for best polynomial spline approximation with free knots
From MaRDI portal
Publication:5267977
DOI10.1090/TRAN/6863zbMATH Open1369.49018arXiv1412.2323OpenAlexW2941649145MaRDI QIDQ5267977FDOQ5267977
Publication date: 14 June 2017
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1412.2323
Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Spline approximation (41A15) Best approximation, Chebyshev systems (41A50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation by generalized splines
- Bivariate segment approximation and free knot splines: Research Problems 96-4
- Quasidifferentiability and related topics. Dedicated to Prof. Franco Giannessi on his 65th birthday and to Prof. Diethard Pallaschke on his 60th birthday
- Uniform Approximation by Chebyshev Spline Functions. II: Free Knots
- Characterization of Chebyshev Approximations by Splines
- Uniform approximation by the highest defect continuous polynomial splines: Necessary and sufficient optimality conditions and their generalisations
- Algorithms for Piecewise Polynomials and Splines with Free Knots
- Uniform approximation by generalized splines with free knots
- Chebyshev Approximation by Spline Functions with Free Knots
- Title not available (Why is that?)
Cited In (6)
- Multivariate approximation by polynomial and generalized rational functions
- Directional differentiability, coexhausters, codifferentials and polyhedral DC functions
- Title not available (Why is that?)
- Finite alternation theorems and a constructive approach to piecewise polynomial approximation in Chebyshev norm
- Generalised rational approximation and its application to improve deep learning classifiers
- The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions
This page was built for publication: Characterisation theorem for best polynomial spline approximation with free knots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267977)
