Computing best discrete least-squares approximations by first-degree splines with free knots
Numerical Analysis
2017-04-20 v1
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).
Keywords
Cite
@article{arxiv.1704.05670,
title = {Computing best discrete least-squares approximations by first-degree splines with free knots},
author = {Ludwig J. Cromme and Jens Kunath and Andreas Krebs},
journal= {arXiv preprint arXiv:1704.05670},
year = {2017}
}