Finite alternation theorems and a constructive approach to piecewise polynomial approximation in Chebyshev norm

DOI10.1007/s11228-019-00528-xzbMath1444.41004OpenAlexW3005312715MaRDI QIDQ2174925

Nadezda Sukhorukova, Julien Ugon, Jean-Pierre Crouzeix

Publication date: 27 April 2020

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-019-00528-x

zbMATH Keywords

polynomial splinesChebyshev approximationalternating sequencefixed and free knots

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10) Spline approximation (41A15)

Related Items (3)

The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions ⋮ Multivariate approximation by polynomial and generalized rational functions ⋮ Generalised rational approximation and its application to improve deep learning classifiers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniform approximation by the highest defect continuous polynomial splines: Necessary and sufficient optimality conditions and their generalisations
• Weak Chebyshev spaces and best L//1-approximation
• Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients
• Constrained multi-degree reduction with respect to Jacobi norms
• Characterization theorem for best polynomial spline approximation with free knots, variable degree and fixed tails
• Approximation to Data by Splines with Free Knots
• Characterisation theorem for best polynomial spline approximation with free knots
• Uniform Approximation by Chebyshev Spline Functions. II: Free Knots
• Degree reduction of Bézier curves

This page was built for publication: Finite alternation theorems and a constructive approach to piecewise polynomial approximation in Chebyshev norm