Padé table explained

In complex analysis, a Padé table is an array, possibly of infinite extent, of the rational Padé approximants

R_{m, n}

to a given complex formal power series. Certain sequences of approximants lying within a Padé table can often be shown to correspond with successive convergents of a continued fraction representation of a holomorphic or meromorphic function.

History

Although earlier mathematicians had obtained sporadic results involving sequences of rational approximations to transcendental functions, Frobenius (in 1881) was apparently the first to organize the approximants in the form of a table. Henri Padé further expanded this notion in his doctoral thesis Sur la representation approchee d'une fonction par des fractions rationelles, in 1892. Over the ensuing 16 years Padé published 28 additional papers exploring the properties of his table, and relating the table to analytic continued fractions.

Modern interest in Padé tables was revived by H. S. Wall and Oskar Perron, who were primarily interested in the connections between the tables and certain classes of continued fractions. Daniel Shanks and Peter Wynn published influential papers about 1955, and W. B. Gragg obtained far-reaching convergence results during the '70s. More recently, the widespread use of electronic computers has stimulated a great deal of additional interest in the subject.^[1]

Notation

A function f(z) is represented by a formal power series:

f(z) = c _{0} + c _{1} z + c _{2} z ^{2} + … = \sum ^{inf ty} _{l =0} c _{l} z ^{l,}

where c₀ ≠ 0, by convention. The (m, n)th entry^[2] R_{m, n} in the Padé table for f(z) is then given by

R _{m,n} (z) = (P _{m(z)})/(Q _{n(z)}) = (a _{0} + a _{1} z + a _{2} z ^{2} + … + a _{m} z ^{m})/(b _{0} + b _{1} z + b _{2} z ^{2} + … + b _{n} z ^{n})

where P_m(z) and Q_n(z) are polynomials of degrees not more than m and n, respectively. The coefficients and can always be found by considering the expression

f(z) ≈ \sum ^{m + n} _{l =0} c _{l} z ^{l} = : f _{approx} (z) Q _{n(z)} f _{approx} (z) = P _{m(z)} Q _{n(z)} \left(c _{0} + c _{1} z + c _{2} z ^{2} + … + c _{m+n} z ^{m+n} \right) = P _{m(z)}

and equating coefficients of like powers of z up through m + n. For the coefficients of powers m + 1 to m + n, the right hand side is 0 and the resulting system of linear equations contains a homogeneous system of n equations in the n + 1 unknowns b_i, and so admits of infinitely many solutions each of which determines a possible Q_n. P_m is then easily found by equating the first m coefficients of the equation above. However, it can be shown that, due to cancellation, the generated rational functions R_m, n are all the same, so that the (m, n)th entry in the Padé table is unique.^[1] Alternatively, we may require that b₀ = 1, thus putting the table in a standard form.

Although the entries in the Padé table can always be generated by solving this system of equations, that approach is computationally expensive. Usage of the Padé table has been extended to meromorphic functions by newer, timesaving methods such as the epsilon algorithm.^[3]

The block theorem and normal approximants

Because of the way the (m, n)th approximant is constructed, the difference

Q_n(z)f(z) - P_m(z)

is a power series whose first term is of degree no less than

m + n + 1.

If the first term of that difference is of degree

m + n + r + 1, r > 0,

then the rational function R_m, n occupies

(r + 1)²

cells in the Padé table, from position (m, n) through position (m+r, n+r), inclusive. In other words, if the same rational function appears more than once in the table, that rational function occupies a square block of cells within the table. This result is known as the block theorem.

If a particular rational function occurs exactly once in the Padé table, it is called a normal approximant to f(z). If every entry in the complete Padé table is normal, the table itself is said to be normal. Normal Padé approximants can be characterized using determinants of the coefficients c_n in the Taylor series expansion of f(z), as follows. Define the (m, n)th determinant by

D _{m,n} = \left|\begin{matrix} c _{m} & c _{m-1} & \ldots & c _{m-n+2} & c _{m-n+1} \\ c _{m+1} & c _{m} & \ldots & c _{m-n+3} & c _{m-n+2} \\ \vdots & \vdots & & \vdots & \vdots\\ c _{m+n-2} & c _{m+n-3} & \ldots & c _{m} & c _{m-1} \\ c _{m+n-1} & c _{m+n-2} & \ldots & c _{m+1} & c _{m\\ \end{matrix}\right|}

with D_m,0 = 1, D_m,1 = c_m, and c_k = 0 for k < 0. Then

• the (m, n)th approximant to f(z) is normal if and only if none of the four determinants D_m,n-1, D_m,n, D_m+1,n, and D_m+1,n+1 vanish; and
• the Padé table is normal if and only if none of the determinants D_m,n are equal to zero (note in particular that this means none of the coefficients c_k in the series representation of f(z) can be zero).^[4]

Connection with continued fractions

One of the most important forms in which an analytic continued fraction can appear is as a regular continued fraction, which is a continued fraction of the form

f(z) = b _{0} + \cfrac{a _{1z}{1} - \cfrac{a _{2z}{1} - \cfrac{a _{3z}{1} - \cfrac{a _{4z}{1} - \ddots}}}}.

where the a_i ≠ 0 are complex constants, and z is a complex variable.

There is an intimate connection between regular continued fractions and Padé tables with normal approximants along the main diagonal: the "stairstep" sequence of Padé approximants R_0,0, R_1,0, R_1,1, R_2,1, R_2,2, ... is normal if and only if that sequence coincides with the successive convergents of a regular continued fraction. In other words, if the Padé table is normal along the main diagonal, it can be used to construct a regular continued fraction, and if a regular continued fraction representation for the function f(z) exists, then the main diagonal of the Padé table representing f(z) is normal.^[1]

An example – the exponential function

Here is an example of a Padé table, for the exponential function.

A portion of the Padé table for the exponential function e^z

	0	1	2	3	4
0	(1)/(1)	(1)/(1- z)	(1)/(1 - z + {\scriptstyle (1)/(2)) z ^{2}}	(1)/(1 - z + {\scriptstyle (1)/(2)) z ^{2} - {\scriptstyle (1)/(6) }z^3}	(1)/(1- z + (1)/(z ^{2} - (1)/(6) z ^{3} + (1)/(24) z ^{4} 2))
1	(1+ z)/(1)	(1 + {\scriptstyle (1)/(2))/(z}{ 1) - {\scriptstyle (1)/(2) }z}	(1 + {\scriptstyle (1)/(3))/(z} { 1) - {\scriptstyle (2)/(3) }z + z^2}	(1 + {\scriptstyle (1)/(4))/(z} { 1) - {\scriptstyle (3)/(4) }z + z^2 - z^3}	(1+ (1)/(z 5))/(1- (4)/(z + (3)/(10) z ^{2} - (1)/(15) z ^{3} + (1)/(120) z ^{4} 5))
2	(1 + z + {\scriptstyle (1)/(2))/(z) ^{2}{1}}	(1 + {\scriptstyle (2)/(3))/(z) + {\scriptstyle (1)/(6) }z^2}	(1 + {\scriptstyle (1)/(2))/(z) + {\scriptstyle (1)/(12) }z^2}	(1 + {\scriptstyle (2)/(5))/(z) + {\scriptstyle (1)/(20) }z^2}	(1+ (1)/(z + (1)/(30) z ^{2} 3))/(1- (2)/(z + (1)/(5) z ^{2} - (1)/(30) z ^{3} + (1)/(360) z ^{4} 3))
3	(1 + z + {\scriptstyle (1)/(2))/(z) ^{2} + {\scriptstyle (1)/(6) }z^3}	(1 + {\scriptstyle (3)/(4))/(z) + {\scriptstyle (1)/(4) }z^2 + z^3}	(1 + {\scriptstyle (3)/(5))/(z) + {\scriptstyle (3)/(20) }z^2 + z^3}	(1 + {\scriptstyle (1)/(2))/(z) + {\scriptstyle (1)/(10) }z^2 + z^3}	(1+ (3)/(z + (1)/(14) z ^{2} + (1)/(210) z ^{3} 7))/(1- (4)/(z + (1)/(7) z ^{2} - (2)/(105) z ^{3} + (1)/(840) z ^{4} 7))
4	(1 + z + {\scriptstyle (1)/(2))/(z) ^{2} + {\scriptstyle (1)/(6) }z^3+ z^4}	(1 + {\scriptstyle (4)/(5))/(z) + {\scriptstyle (3)/(10) }z^2 + z^3+ z^4}	(1 + {\scriptstyle (2)/(3))/(z) + {\scriptstyle (1)/(5) }z^2 + z^3+ z^4}	(1 + {\scriptstyle (4)/(7))/(z) + {\scriptstyle (1)/(7) }z^2 + z^3+ z^4}	(1+ (1)/(z + (3)/(28) z ^{2} + (1)/(84) z ^{3} + (1)/(1680) z ^{4} 2))/(1- (1)/(z + (3)/(28) z ^{2} - (1)/(84) z ^{3} + (1)/(1680) z ^{4} 2))

Several features are immediately apparent.

• The first column of the table consists of the successive truncations of the Taylor series for e^z.
• Similarly, the first row contains the reciprocals of successive truncations of the series expansion of e^−z.
• The approximants R_m,n and R_n,m are quite symmetrical  - the numerators and denominators are interchanged, and the patterns of plus and minus signs are different, but the same coefficients appear in both of these approximants. They can be expressed in terms of special functions as

R _{m,n} = ({)/(_{1F}) _{1(-m;-m-n;z)}{{}} _{1F} _{1(-n;-m-n;-z)}} = (n! 2 ^{m\theta} _{m\left( (z)/(2)} ;n - m +2 , 2 \right))/(m! 2 ^{n\theta} _{n\left( - (z)/(2)} ;m - n +2 , 2 \right)) ,

where

{} _{1F} _{1(a;b;z)} is a generalized hypergeometric series and \theta _{n(x;\alpha,\beta)} is a generalized reverse Bessel polynomial.^[5]

The expressions on the main diagonal reduce to

R _{n,n} = \theta _{n(z/2)/\theta} _{n(-z/2)} , where \theta _{n(x)} is a reverse Bessel polynomial.^[6]

• Computations involving the R_n,n (on the main diagonal) can be done quite efficiently. For example, R_3,3 reproduces the power series for the exponential function perfectly up through ¹/₇₂₀ z⁶, but because of the symmetry of the two cubic polynomials, a very fast evaluation algorithm can be devised.

The procedure used to derive Gauss's continued fraction can be applied to a certain confluent hypergeometric series to derive the following C-fraction expansion for the exponential function, valid throughout the entire complex plane:

e ^{z} = 1 + \cfrac{z}{ 1 - \cfrac{ (1)/(2) z}{ 1 + \cfrac{ (1)/(6) z}{ 1 - \cfrac{ (1)/(6) z} { 1 + \cfrac{ (1)/(10) z}{ 1 - \cfrac{ (1)/(10) z}{ 1 + - \ddots}}}}}}.

By applying the fundamental recurrence formulas one may easily verify that the successive convergents of this C-fraction are the stairstep sequence of Padé approximants R_0,0, R_1,0, R_1,1, ... In this particular case a closely related continued fraction can be obtained from the identity

e ^{z} = (1)/(e ^{-z}) ;

that continued fraction looks like this:

e ^{z} = \cfrac{ 1 }{ 1 - \cfrac{z}{ 1 + \cfrac{ (1)/(2) z}{ 1 - \cfrac{ (1)/(6) z}{ 1 + \cfrac{ (1)/(6) z} { 1 - \cfrac{ (1)/(10) z}{ 1 + \cfrac{ (1)/(10) z}{ 1 - + \ddots}}}}}}}.

This fraction's successive convergents also appear in the Padé table, and form the sequence R_0,0, R_0,1, R_1,1, R_1,2, R_2,2, ...

Generalizations

A formal Newton series L is of the form

L(z) = c _{0} + \sum ^{inf ty} _{n =1} c _{n} \prod ^{n} _{k =1} (z - \beta _{k)}

where the sequence of points in the complex plane is known as the set of interpolation points. A sequence of rational approximants R_m,n can be formed for such a series L in a manner entirely analogous to the procedure described above, and the approximants can be arranged in a Newton-Padé table. It has been shown^[7] that some "staircase" sequences in the Newton-Padé table correspond with the successive convergents of a Thiele-type continued fraction, which is of the form

a _{0} + \cfrac{a _{1(z} - \beta _{1)}{1} - \cfrac{a _{2(z} - \beta _{2)}{1} - \cfrac{a _{3(z} - \beta _{3)}{1} - \ddots}}}.

Mathematicians have also constructed two-point Padé tables by considering two series, one in powers of z, the other in powers of 1/z, which alternately represent the function f(z) in a neighborhood of zero and in a neighborhood of infinity.^[1]

See also

• Shanks transformation

References

• Book: Jones, William B.. Thron, W. J.. Continued Fractions: Theory and Applications. registration. Addison-Wesley Publishing Company. Reading, Massachusetts. 1980. 185–197. 0-201-13510-8.
• Book: Wall, H. S.. Analytic Theory of Continued Fractions. Chelsea Publishing Company. 1973. 377–415. 0-8284-0207-8.
  (This is a reprint of the volume originally published by D. Van Nostrand Company, Inc., in 1948.)

Notes and References

1. Jones and Thron, 1980.
2. The (m, n)th entry is considered to lie in row m and column n, and numbering of the rows and columns begins at (0, 0).
3. 10.2307/2002183. 2002183. American Mathematical Society. 91–96. Apr 1956. On a Device for Computing the e_m(S_n) Transformation. Peter. Mathematical Tables and Other Aids to Computation. 10. 54. Wynn.
4. 1–62. 10.1137/1014001. Gragg. Jan 1972. W.B.. The Padé Table and its Relation to Certain Algorithms of Numerical Analysis. SIAM Review. 1. 14. 0036-1445. 2028911. free.
5. • Underhill. C.. Some Asymptotic Properties of Padé Approximants to e ^{-x} . Mathematics of Computation. 47. 175. 1986. 253–263. 2008092.
6. • Web site: The On-Line Encyclopedia of Integer Sequences (OEIS). Founded in 1964 by Sloane, N. J. A.. The OEIS Foundation Inc.. (See sequence .)
7. Book: Thiele, T.N.. Interpolationsrechnung. Teubner. Leipzig. 1909. 1-4297-0249-4.