Algorithms for Piecewise Polynomials and Splines with Free Knots

DOI10.2307/2008358MaRDI QIDQ3821081zbMATH OpenOpenAlexFDO

Authors Günter Meinardus, Günther Nürnberger, M. Sommer, Hans Strauss

Publication date 1989

Full work available at URL https://doi.org/10.2307/2008358

zbMATH Keywords

algorithmNewton-type methods

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Spline approximation (41A15) Best approximation, Chebyshev systems (41A50) Numerical computation using splines (65D07) Algorithms for approximation of functions (65D15) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• On the Best Least Squares Approximation of Continuous Functions using Linear Splines with Free Knots
• scientific article; zbMATH DE number 3893716
• Algorithm for the best uniform spline approximation with free knots
• scientific article; zbMATH DE number 3996307
• An algorithm for segment approximation

Cites work

• A practical guide to splines
• A Remez type algorithm for spline functions
• An algorithm for segment approximation
• Characteristic properties of the segmented rational minmax approximation problem
• scientific article; zbMATH DE number 3624683 (Why is no real title available?)
• scientific article; zbMATH DE number 3244284 (Why is no real title available?)
• scientific article; zbMATH DE number 3403165 (Why is no real title available?)
• Splines (with optimal knots) are better

Cited in

(22)

• An algorithm for segment approximation
• On a certain duality for segmented minmax problems
• Bivariate segment approximation and free knot splines: Research Problems 96-4
• Least squares splines with free knots: Global optimization approach.
• A Newton-type method for computing best segment approximations
• Approximation in normed linear spaces
• Linear least squares problems involving fixed knots polynomial splines and their singularity study
• Algorithm for the best uniform spline approximation with free knots
• Generalised rational approximation and its application to improve deep learning classifiers
• Piecewise polynomial approximation of the sixth order with automatic knots detection
• On the Best Least Squares Approximation of Continuous Functions using Linear Splines with Free Knots
• Detection of Singularities Using Segment Approximation
• Piecewise Polynomial Solutions Without a priori Break Points
• Improved Rounding for Spline Coefficients and Knots
• Modified Adaptive Algorithms
• 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
• Characterisation theorem for best polynomial spline approximation with free knots
• An algorithm for data reduction using splines with free knots
• Bivariate segment approximation and splines
• Some results in segmented approximation
• Increasing the efficiency of Chebyshev segment fractional rational approximation

This page was built for publication: Algorithms for Piecewise Polynomials and Splines with Free Knots

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