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

A. Krebs, Ludwig J. Cromme, Jens Kunath

Publication date: 19 April 2017

Abstract: We present an algorithm to compute best least-squares approximations of discrete real-valued functions by first-degree splines (broken lines) with free knots. We demonstrate that the algorithm delivers after a finite number of steps a (global) best approximation. The analysis is complemented by remarks on programming and by a number of numerical examples including applications from medicine (MBC, MIC).

This page was built for publication: Computing best discrete least-squares approximations by first-degree splines with free knots

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