Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions

DOI10.1007/s10957-016-0887-0zbMath1349.90842OpenAlexW2254812398MaRDI QIDQ346817

Julien Ugon, Nadezda Sukhorukova

Publication date: 30 November 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-016-0887-0

zbMATH Keywords

polynomial splinesuniform approximationweighting functionsalternance

Mathematics Subject Classification ID

Interior-point methods (90C51) Best approximation, Chebyshev systems (41A50) Spline approximation (41A15)

Related Items (1)

Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema

Cites Work

• Unnamed Item
• 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
• Convex optimisation-based methods for K-complex detection
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Approximation by generalized splines
• Bivariate segment approximation and free knot splines: Research Problems 96-4
• Linear least squares problems involving fixed knots polynomial splines and their singularity study
• A generalization of the Remez algorithm to a class of linear spline approximation problems with constraints on spline parameters
• Uniform Approximation by Chebyshev Spline Functions. II: Free Knots
• Characterization of Chebyshev Approximations by Splines
• Convex Analysis

This page was built for publication: Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions