By G. H. Golub, L. B. Smith
Communications of the ACM,
November 1971,
Vol. 14 No. 11, Pages 737-746
10.1145/362854.362890
Comments
The second algorithm of Remez can be used to compute the minimax approximation to a function, ƒ(x), by a linear combination of functions, {Qi(x)}n0, which form a Chebyshev system. The only restriction on the function to be approximated is that it be continuous on a finite interval [a,b]. An Algol 60 procedure is given, which will accomplish the approximation. This implementation of the second algorithm of Remez is quite general in that the continuity of ƒ(x) is all that is required whereas previous implementations have required differentiability, that the end points of the interval be “critical points,” and that the number of “critical points” be exactly n + 2. Discussion of the method used and of its numerical properties is given as well as some computational examples of the use of the algorithm. The use of orthogonal polynomials (which change at each iteration) as the Chebyshev system is also discussed.
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.
