Los puntos clave no están disponibles para este artículo en este momento.
Abstract In many situations approximation of a set of data by a polygonal curve is more advantageous than approximation by a polynomial. If the join points of the polygonal curve are known, the problem is quite simple. If, however, they are to be chosen in some expeditious fashion, considerable numerical difficulties can arise if the curve-fitting problem is approached directly. In this paper it is shown that dynamic programming offers a simple direct approach to the determination of an optimal fit.
Bellman et al. (Mon,) studied this question.