Module for the Pade Approximation

Check out the new Numerical Analysis Projects page.

 

Background. A Pade rational approximation to f(x) on [a,b] is the quotient of two polynomials [Graphics:Images/PadeApproximationMod_gr_1.gif] and [Graphics:Images/PadeApproximationMod_gr_2.gif] of degrees n and m, respectively. We use the notation [Graphics:Images/PadeApproximationMod_gr_3.gif] to denote this quotient:

        [Graphics:Images/PadeApproximationMod_gr_4.gif].  

    The method is attributed to the French mathematician Henri Eugène Padé (1863-1953), and requires that f(x) and its derivatives be continuous at x = 0. There are two reasons for the arbitrary choice of x = 0. First, it makes the manipulations simpler. Second, a change of variable can be used to shift the calculations over to the interval that contains zero. The polynomials used in the construction are:

        [Graphics:Images/PadeApproximationMod_gr_5.gif][Graphics:Images/PadeApproximationMod_gr_6.gif]
    and
        [Graphics:Images/PadeApproximationMod_gr_7.gif][Graphics:Images/PadeApproximationMod_gr_8.gif].

    The polynomials are constructed so that f(x) and [Graphics:Images/PadeApproximationMod_gr_9.gif] agree at x = 0 and their derivatives up to n + m agree at x = 0.  In the case [Graphics:Images/PadeApproximationMod_gr_10.gif], the approximation is just the Maclaurin expansion for  f(x). For a fixed value of n + m the error is usually smallest when [Graphics:Images/PadeApproximationMod_gr_11.gif] and [Graphics:Images/PadeApproximationMod_gr_12.gif] have the same degree or when [Graphics:Images/PadeApproximationMod_gr_13.gif] had degree one higher than [Graphics:Images/PadeApproximationMod_gr_14.gif].

    Notice that the constant coefficient of [Graphics:Images/PadeApproximationMod_gr_15.gif] is [Graphics:Images/PadeApproximationMod_gr_16.gif]. This is permissible, because it cannot be 0 and [Graphics:Images/PadeApproximationMod_gr_17.gif] is not changed when both [Graphics:Images/PadeApproximationMod_gr_18.gif] and [Graphics:Images/PadeApproximationMod_gr_19.gif] are divided by the same constant. Hence the rational function [Graphics:Images/PadeApproximationMod_gr_20.gif]has n + m + 1 unknown coefficients. Sometimes a specific choice for n and m will yield an inconsistent set of equations to solve, so one of the values n or m must be changed up or down.

    Assume that f(x) is analytic and has the Maclaurin series expansion:

        [Graphics:Images/PadeApproximationMod_gr_21.gif][Graphics:Images/PadeApproximationMod_gr_22.gif]  

We proceed to construct the rational function [Graphics:Images/PadeApproximationMod_gr_23.gif].  Observe that we want [Graphics:Images/PadeApproximationMod_gr_24.gif], so that [Graphics:Images/PadeApproximationMod_gr_25.gif].
To start, we form the difference and call it Z(x):

        [Graphics:Images/PadeApproximationMod_gr_26.gif].

We assume that Z(x) has a Maclaurin expansion too:

        [Graphics:Images/PadeApproximationMod_gr_27.gif][Graphics:Images/PadeApproximationMod_gr_28.gif].  

Now expand the former equation in its series form  

        [Graphics:Images/PadeApproximationMod_gr_29.gif][Graphics:Images/PadeApproximationMod_gr_30.gif].  

    If Z(x) were identically zero, then f(x) would be identically equal to the rational function [Graphics:Images/PadeApproximationMod_gr_31.gif]. Since this does not happen in general, the best that we can hope for is that a significant number of the leading terms in the Maclaurin expansion for Z(x) are zero. Recall that the rational function [Graphics:Images/PadeApproximationMod_gr_32.gif]has n + m + 1 unknown constants. We attempt to construct [Graphics:Images/PadeApproximationMod_gr_33.gif] and [Graphics:Images/PadeApproximationMod_gr_34.gif]under the additional assumption that [Graphics:Images/PadeApproximationMod_gr_35.gif],...,[Graphics:Images/PadeApproximationMod_gr_36.gif]. The equation that we must solve is

        [Graphics:Images/PadeApproximationMod_gr_37.gif][Graphics:Images/PadeApproximationMod_gr_38.gif].  

The lower index i = n + m + 1 in the summation on the right side of the equation is chosen because the first n + m derivatives of f(x) and [Graphics:Images/PadeApproximationMod_gr_39.gif]are to agree at x = 0.

    When the left side of the above equation is expanded and the coefficients of the powers [Graphics:Images/PadeApproximationMod_gr_40.gif] are set equal to zero for i=0,1,...,m+n, the result is a system of n+m+1 linear equations:

            [Graphics:Images/PadeApproximationMod_gr_41.gif],  
            [Graphics:Images/PadeApproximationMod_gr_42.gif],  
            [Graphics:Images/PadeApproximationMod_gr_43.gif],  
            [Graphics:Images/PadeApproximationMod_gr_44.gif],  
            ...  
            [Graphics:Images/PadeApproximationMod_gr_45.gif],  
            ...
            [Graphics:Images/PadeApproximationMod_gr_46.gif],  
            [Graphics:Images/PadeApproximationMod_gr_47.gif],  
            ...
            [Graphics:Images/PadeApproximationMod_gr_48.gif],  
            [Graphics:Images/PadeApproximationMod_gr_49.gif].  

    Notice that in each equation the sum of the subscripts on the factors of each product is the same, and this sum increases consecutively from 0 to n+m. The last m equations involve only the unknowns [Graphics:Images/PadeApproximationMod_gr_50.gif] and must be solved first. Then the known values [Graphics:Images/PadeApproximationMod_gr_51.gif] can be substituted in the first n+1 equations.  Then the first n+1 equations are used successively to find  [Graphics:Images/PadeApproximationMod_gr_52.gif].  

 

Animations (Pade Approximation).  Internet hyperlink to animations.

 

Example 1.  Find the Pade approximation [Graphics:Images/PadeApproximationMod_gr_53.gif]for [Graphics:Images/PadeApproximationMod_gr_54.gif].  

Solution 1.

 

Example 2.  Find the Pade approximation [Graphics:Images/PadeApproximationMod_gr_96.gif]for [Graphics:Images/PadeApproximationMod_gr_97.gif].  
Solution 2.

 

 

Research Experience for Undergraduates

Pade Approximation  Pade Approximation  
Internet hyperlinks to web sites and a bibliography of articles.  

 

Downloads (Pade Approximation Pade Approximation).  
Download this Mathematica notebook.  

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2003