On the Best Least Squares Approximation of Continuous Functions using Linear Splines with Free Knots

DOI10.1093/imanum/11.3.393zbMath0760.65009OpenAlexW2008706531MaRDI QIDQ3974668

P. D. Loach, Andrew J. Wathen

Publication date: 25 June 1992

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/11.3.393

zbMATH Keywords

algorithmsglobal convergencedynamic programmingefficiencycontinuous functionlocal convergencehybrid algorithmfree knotsbest linear spline \(L_ 2\)-approximant

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical smoothing, curve fitting (65D10) Algorithms for approximation of functions (65D15)

Related Items (6)

Pseudo-inverses of difference matrices and their application to sparse signal approximation ⋮ The unimodality of initial B-spline approximations in spline fitting ⋮ Least squares splines with free knots: Global optimization approach. ⋮ Optimal moving grids for time-dependent partial differential equations ⋮ Knot calculation for spline fitting based on the unimodality property ⋮ Improved Rounding for Spline Coefficients and Knots

This page was built for publication: On the Best Least Squares Approximation of Continuous Functions using Linear Splines with Free Knots