Computing best discrete least-squares approximations by first-degree\n splines with free knots

2017/04/19 by Ludwig J. Cromme, Cromme, Ludwig J., Jens Kunath +3
Engineering · Computer Science · Mathematics · #Advanced Numerical Analysis Techniques #Digital Image Processing Techniques #Statistical and numerical algorithms

paper · pdf · doi:10.48550/arxiv.1704.05670

Abstract

We present an algorithm to compute best least-squares approximations of\ndiscrete real-valued functions by first-degree splines (broken lines) with free\nknots. We demonstrate that the algorithm delivers after a finite number of\nsteps a (global) best approximation. The analysis is complemented by remarks on\nprogramming and by a number of numerical examples including applications from\nmedicine (MBC, MIC).\n

Related

• Discrete approximation by first-degree splines with free knots
• Best free knot linear spline approximation and its application to neural networks
• Linear least squares problems involving fixed knots polynomial splines and their singularity study
• The optimal free knot spline approximation of stochastic differential equations with additive noise
• Efficient function approximation on general bounded domains using splines on a Cartesian grid