About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Minimax approximations subject to a constraint
Abstract
A class of approximation problems is considered in which a continuous, positive function p(x) is approximated by a rational function satisfying some identity. It is proved under certain hypotheses that there is a unique rational approximation satisfying the constraint and yielding minimax relative error and that the corresponding relative error function does not have an equal ripple graph. This approximation is, moreover, just the rational approximation to p(x) yielding minimax logarithmic error. This approximation, in turn, is just a constant multiple of the rational approximation to dx yielding minimax relative error but not necessarily satisfying the constraint. © 1971 American Mathematical Society.