This procedure computes the best minimax rational approximation of degree (m, n) for a given real function f(x) on the interval [a, b] with respect to the positive weight function w(x), via the Remez algorithm.

Specifically, it computes the rational expression  such that

is minimized over all rational expressions  with numerator of degree <= m and denominator of degree <= n.

Note that if f(x) is nonzero on the interval of approximation then the relative error will be minimized by specifying the weight function .

If the second argument is a range a..b then the first argument is understood to be a Maple operator, and the result will be returned as an operator. If the second argument is an equation  then the first argument is understood to be an expression in the variable x, and the result will be returned as an expression. In all cases, the numerator and denominator of the result are each expressed in Horner (nested multiplication) form.

Note that for the purpose of evaluating a rational function efficiently (minimizing the number of arithmetic operations), the rational function should be converted to a continued-fraction form. See numapprox[confracform].

If  or if the third argument is simply an integer m then the best minimax polynomial approximation of degreem is computed.

If the fourth argument w is specified then it is assumed to be an operator if f is an operator, and it is assumed to be an expression if f is an expression. If the fourth argument is omitted then the weight function is understood to be  for all x.

If the fifth argument ‘maxerror‘ is present then it must be a name. Upon return, its value will be an estimate of the minimax norm specified by equation (1) above.

Various levels of user information will be displayed during the computation if infolevel[minimax] is assigned values between 1 and 3.

The command with(numapprox,minimax) allows the use of the abbreviated form of this command.