Padé table
This article or section is in a state of significant expansion or restructuring. You are welcome to assist in its construction by editing it as well. If this article or section has not been edited in several days, please remove this template. If you are the editor who added this template and you are actively editing, please be sure to replace this template with {{in use}} during the active editing session. Click on the link for template parameters to use.
This article was last edited by DavidCBryant (talk | contribs) 17 years ago. (Update timer) |
In complex analysis, a Padé table is an array, possibly of infinite extent, of the rational Padé approximants Rm, n to a 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.[1]
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.[2]
Notation
A function f(z) is represented by a formal power series:
The (m, n)th entry Rm, n in the Padé table for f(z) is then given by
where Pm(z) and Qn(z) are polynomials of degrees m and n, respectively. The coefficients {ai} and {bi} can always be found by considering the expression
and equating coefficients of like powers of z. The resulting system of linear equations contains a homogeneous system of n equations in n + 1 unknowns, and so admits of infinitely many solutions. However, it can be shown that the generated rational functions Rm, n are all the same, so that the (m, n)th entry in the Padé table is unique.[2] Alternatively, we may require that b0 = 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. More efficient methods have been devised, including the epsilon algorithm.[3]
An example – the exponential function
Here is an example of a Padé table, for the exponential function.
0 | 1 | 2 | 3 | |
---|---|---|---|---|
0 | ||||
1 | ||||
2 | ||||
3 |
Several interesting features are immediately apparent.
- The first row of the table consists of the successive truncations of the Taylor series for ez.
- Similarly, the first column contains the reciprocals of successive truncations of the series expansion of e−z.
- The approximants Rm,n and Rn,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.
- Computations involving the Rn,n (on the main diagonal) can be done quite efficiently. For example, R3,3 reproduces the power series for the exponential function perfectly up through 1/720 z6, but because of the symmetry of the two cubic polynomials, a very fast evaluation algorithm can be devised.
Notes
- ^ O'Connor, John J.; Robertson, Edmund F., "Padé table", MacTutor History of Mathematics Archive, University of St Andrews
- ^ a b Jones and Thron, 1980.
- ^ Wynn, Peter (Apr 1956). "On a Device for Computing the em(Sn) Transformation". Mathematical Tables and Other Aids to Computation. 10 (54): 91–96.
References
- Jones, William B. (1980). Continued Fractions: Theory and Applications. Reading, Massachusetts: Addison-Wesley Publishing Company. pp. 185–197. ISBN 0-201-13510-8.
{{cite book}}
: Unknown parameter|coauthors=
ignored (|author=
suggested) (help)