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

DOI10.1007/S10957-016-0887-0MaRDI QIDQ346817zbMATH OpenOpenAlexFDO

Authors N. Sukhorukova, Julien Ugon

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

uniform approximationweighting functionsalternancepolynomial splines

Mathematics Subject Classification ID

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

Recommendations

• Chebyshev Approximation by Spline Functions with Free Knots
• scientific article; zbMATH DE number 44907
• scientific article; zbMATH DE number 3996307
• scientific article; zbMATH DE number 5720481
• scientific article; zbMATH DE number 740113

Cites work

• scientific article; zbMATH DE number 5844487 (Why is no real title available?)
• scientific article; zbMATH DE number 3954641 (Why is no real title available?)
• scientific article; zbMATH DE number 3736326 (Why is no real title available?)
• scientific article; zbMATH DE number 44907 (Why is no real title available?)
• scientific article; zbMATH DE number 51950 (Why is no real title available?)
• scientific article; zbMATH DE number 872150 (Why is no real title available?)
• A generalization of the Remez algorithm to a class of linear spline approximation problems with constraints on spline parameters
• Approximation by generalized splines
• Bivariate segment approximation and free knot splines: Research Problems 96-4
• Characterization of Chebyshev Approximations by Splines
• Convex Analysis
• Convex optimisation-based methods for K-complex detection
• Linear least squares problems involving fixed knots polynomial splines and their singularity study
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Uniform Approximation by Chebyshev Spline Functions. II: Free Knots
• Uniform approximation by the highest defect continuous polynomial splines: Necessary and sufficient optimality conditions and their generalisations

Cited in

(9)

• scientific article; zbMATH DE number 1524371 (Why is no real title available?)
• Chebyshev Approximation by Spline Functions with Free Knots
• Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema
• scientific article; zbMATH DE number 740113 (Why is no real title available?)
• scientific article; zbMATH DE number 1524365 (Why is no real title available?)
• The smooth extension embedding method with Chebyshev polynomials
• Uniform approximation by the highest defect continuous polynomial splines: Necessary and sufficient optimality conditions and their generalisations
• Uniform spline approximation with links as a sum of polynomial and power function
• Linear least squares problems involving fixed knots polynomial splines and their singularity study

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

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