Algorithms for Piecewise Polynomials and Splines with Free Knots
From MaRDI portal
Publication:3821081
DOI10.2307/2008358zbMath0668.41009OpenAlexW4236414142MaRDI QIDQ3821081
Manfred Sommer, Günther Nürnberger, Günter Meinardus, Hans Strauss
Publication date: 1989
Full work available at URL: https://doi.org/10.2307/2008358
Numerical computation using splines (65D07) Numerical computation of solutions to systems of equations (65H10) Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10) Spline approximation (41A15) Algorithms for approximation of functions (65D15)
Related Items
Bivariate segment approximation and free knot splines: Research Problems 96-4 ⋮ 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 ⋮ Least squares splines with free knots: Global optimization approach. ⋮ Linear least squares problems involving fixed knots polynomial splines and their singularity study ⋮ Bivariate segment approximation and splines ⋮ Some results in segmented approximation ⋮ Increasing the efficiency of Chebyshev segment fractional rational approximation ⋮ Improved Rounding for Spline Coefficients and Knots ⋮ Detection of Singularities Using Segment Approximation ⋮ On a certain duality for segmented minmax problems ⋮ Algorithm for the best uniform spline approximation with free knots ⋮ Approximation in normed linear spaces ⋮ Characterisation theorem for best polynomial spline approximation with free knots
Cites Work
