By Charles B. Dunham
Communications of the ACM,
October 1969,
Vol. 12 No. 10, Pages 581-582
10.1145/363235.363263
Comments
In this note we point out how rational approximations which are best with respect to maximum logarithmic error can be computed by existing algorithms. Let y be a quantity that we wish to approximate and y be an approximation, then the logarithmic error is defined to be log (y/y). In a recent paper [3] it is shown that minimax logarithmic approximations are optimal for square root calculations, making the minimax logarithmic problem of practical interest. Suppose we wish to approximate a positive continuous function ƒ by a positive rational function R, then the logarithmic error at a point x is log (ƒ(x)) - log (R(x)). Our approximation problem is thus equivalent to ordinary approximation of a continuous function g = log (ƒ) by log (R). This is contained in the more general theory of approximation by ϕ(R), ϕ monotonic which appears in [1]. Computational procedures (based on the Remez algorithm) for the general problem are given in [2, 5]. These are easily adapted to the special case of logarithmic approximation and can readily be coded by modification of a standard rational Remez algorithm.
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.
