The function chebpade computes a Chebyshev-Pade approximation of degree  for the function f.

Specifically, f is expanded in a Chebyshev series on the interval  (if  is not specified then the interval  is understood), and then the Chebyshev-Pade rational approximation is computed.

If  or if the third argument is simply an integer m then the Chebyshev series of degree m is computed.

The  Chebyshev-Pade approximation is defined to be the rational function  with  and  such that the Chebyshev series expansion of  has maximal initial agreement with the Chebyshev series expansion of f. In normal cases, the series expansion agrees through the term of degree .

If the second argument is a range  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 , or a name x, 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 will be expressed in terms of the Chebyshev polynomials .  See orthopoly[T].

The method used is based on transforming the Chebyshev series to a power series with the same coefficients, computing a Pade approximation for the power series, and then converting back to the appropriate Chebyshev-Pade approximation.

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

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

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

Geddes, K.O. "Block Structure in the Chebyshev-Pade Table." SIAM J. Numer. Anal., Vol. 18(5). (Oct. 1981): 844-861.