ALGORITHMS FOR PIECEWISE STRAIGHT LINE APPROXIMATIONS

被引：15

作者：

PHILLIPS, GM

机构：

[1] Department of Applied Mathematics, University of St. Andrews, St. Andrews, Fife

来源：

COMPUTER JOURNAL | 1968年 / 11卷 / 02期

关键词：

D O I：

10.1093/comjnl/11.2.211

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A simple algorithm is described for obtaining approximations to a given function, by means of straight line segments, with any pre-assigned accuracy. The approximation obtained is a best one in the minimax sense. Secondly, given the number of segments k another algorithm finds the best approximation by means of k segments. © 1968 The British Computer Society.

引用

页码：211 / &