An algorithm for minimal degree linear Chebyshev approximation on a discrete set

✍ Scribed by F. D. K. Roberts

• Publisher: John Wiley and Sons
• Year: 1976
• Tongue: English
• Weight: 779 KB
• Volume: 10
• Category: Article
• ISSN: 0029-5981
• DOI: 10.1002/nme.1620100311

✦ Synopsis

Abstract

An algorithm for computing a linear Chebyshev approximation to a function defined on a finite set of points is presented. The method requires the accuracy of the approximation to be specified, and determines the least degree approximation which achieves this accuracy. The algorithm is based upon the simplex method of linear programming. A FORTRAN program is supplied in the Appendix.