Jump to content

Padé table: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
rm dot
 
(37 intermediate revisions by 31 users not shown)
Line 1: Line 1:
[[File:Henri Padé.jpeg|thumb|right|[[Henri Padé]].]]
[[File:Henri Padé.jpeg|thumb|right|[[Henri Padé]]]]


In [[complex analysis]], a '''Padé table''' is an array, possibly of infinite extent, of the rational [[Padé approximant]]s
In [[complex analysis]], a '''Padé table''' is an array, possibly of infinite extent, of the rational [[Padé approximant]]s


:''R''<sub>''m'', ''n''</sub>
:''R''<sub>''m'', ''n''</sub>


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


==History==
==History==
Line 13: Line 13:


==Notation==
==Notation==
A function ''f''(''z'') is represented by a formal power series:
A function ''f''(''z'') is represented by a formal [[power series]]:


:<math>
:<math>
f(z) = c_0 + c_1z + c_2z^2 + \cdots = \sum_{n=0}^\infty c_nz^n,
f(z) = c_0 + c_1 z + c_2 z^2 + \cdots = \sum_{l=0}^\infty c_l z^l,
</math>
</math>


Line 23: Line 23:
:<math>
:<math>
R_{m,n}(z) = \frac{P_m(z)}{Q_n(z)} =
R_{m,n}(z) = \frac{P_m(z)}{Q_n(z)} =
\frac{a_0 + a_1z + a_2z^2 + \cdots + a_mz^m}{b_0 + b_1z + b_2z^2 + \cdots + b_nz^n}
\frac{a_0 + a_1 z + a_2 z^2 + \cdots + a_m z^m}{b_0 + b_1 z + b_2 z^2 + \cdots + b_n z^n}
</math>
</math>


Line 29: Line 29:


:<math>
:<math>
Q_n(z) \left(c_0 + c_1z + c_2z^2 + \cdots + c_{m+n}z^{m+n}\right) = P_m(z)
f(z) \approx \sum_{l=0}^{m+n} c_l z^l =: f_{\mathrm{approx}}(z)
</math>

:<math>
Q_n(z) f_{\mathrm{approx}}(z) = P_m(z)
</math>

:<math>
Q_n(z) \left(c_0 + c_1 z + c_2 z^2 + \cdots + c_{m+n} z^{m+n} \right) = P_m(z)
</math>
</math>


and equating coefficients of like powers of ''z'' up through ''m''&nbsp;+&nbsp;''n''. For the coefficients of powers ''m''&nbsp;+&nbsp;1 to ''m''&nbsp;+&nbsp;''n'', the right hand side is 0 and the resulting [[system of linear equations]] contains a homogeneous system of ''n'' equations in the ''n''&nbsp;+&nbsp;1 unknowns ''b<sub>i</sub>'', and so admits of infinitely many solutions each of which determines a possible ''Q<sub>n</sub>''. ''P<sub>m</sub>'' 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<sub>m,&nbsp;n</sub>'' are all the same, so that the (''m'',&nbsp;''n'')th entry in the Padé table is unique.<ref name="JT"/> Alternatively, we may require that ''b''<sub>0</sub>&nbsp;=&nbsp;1, thus putting the table in a standard form.
and equating coefficients of like powers of ''z'' up through ''m''&nbsp;+&nbsp;''n''. For the coefficients of powers ''m''&nbsp;+&nbsp;1 to ''m''&nbsp;+&nbsp;''n'', the right hand side is 0 and the resulting [[system of linear equations]] contains a homogeneous system of ''n'' equations in the ''n''&nbsp;+&nbsp;1 unknowns ''b<sub>i</sub>'', and so admits of infinitely many solutions each of which determines a possible ''Q<sub>n</sub>''. ''P<sub>m</sub>'' 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<sub>m,&nbsp;n</sub>'' are all the same, so that the (''m'',&nbsp;''n'')th entry in the Padé table is unique.<ref name="JT"/> Alternatively, we may require that ''b''<sub>0</sub>&nbsp;=&nbsp;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]].<ref>{{cite journal|last = Wynn|first = Peter|title = On a Device for Computing the ''e<sub>m</sub>''(''S<sub>n</sub>'') Transformation|journal = Mathematical Tables and Other Aids to Computation|volume = 10|issue = 54|date = Apr 1956|pages = 91–96|url = http://links.jstor.org/sici?sici=0891-6837%28195604%2910%3A54%3C91%3AOADFCT%3E2.0.CO%3B2-Y&size=LARGE|month = Apr|year = 1956|doi = 10.2307/2002183}}</ref>
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.<ref>{{cite journal|doi = 10.2307/2002183|jstor = 2002183|publisher = American Mathematical Society|pages = 91–96|date = Apr 1956|title = On a Device for Computing the ''e<sub>m</sub>''(''S<sub>n</sub>'') Transformation|first = Peter|journal = Mathematical Tables and Other Aids to Computation|volume = 10|issue = 54|last = Wynn}}</ref>


==The block theorem and normal approximants==
==The block theorem and normal approximants==
Because of the way the (''m'', ''n'')th approximant is constructed, the difference
Because of the way the (''m'', ''n'')th approximant is constructed, the difference


:''Q<sub>n</sub>''(''z'')''f''(''z'')&nbsp;&minus;&nbsp;''P<sub>n</sub>''(''z'')
:''Q<sub>n</sub>''(''z'')''f''(''z'')&nbsp;&minus;&nbsp;''P<sub>m</sub>''(''z'')


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


:''m''&nbsp;+&nbsp;''n''&nbsp;+&nbsp;1.
:''m''&nbsp;+&nbsp;''n''&nbsp;+&nbsp;1.


If the first term of that difference is of degree
If the first term of that difference is of degree


:''m''&nbsp;+&nbsp;''n''&nbsp;+&nbsp;''r''&nbsp;+&nbsp;1, ''r''&nbsp;>&nbsp;0,
:''m''&nbsp;+&nbsp;''n''&nbsp;+&nbsp;''r''&nbsp;+&nbsp;1, ''r''&nbsp;>&nbsp;0,


then the rational function ''R<sub>m,&nbsp;n</sub>'' occupies
then the rational function ''R<sub>m,&nbsp;n</sub>'' occupies


:(''r'' + 1)<sup>2</sup>
:(''r'' + 1)<sup>2</sup>


cells in the Padé table, from position (''m'',&nbsp;''n'') through position (''m''+''r'',&nbsp;''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'''.
cells in the Padé table, from position (''m'',&nbsp;''n'') through position (''m''+''r'',&nbsp;''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'''.
Line 68: Line 76:
with ''D''<sub>''m'',0</sub> = 1, ''D''<sub>''m'',1</sub> = ''c<sub>m</sub>'', and ''c<sub>k</sub>''&nbsp;=&nbsp;0 for ''k''&nbsp;<&nbsp;0. Then
with ''D''<sub>''m'',0</sub> = 1, ''D''<sub>''m'',1</sub> = ''c<sub>m</sub>'', and ''c<sub>k</sub>''&nbsp;=&nbsp;0 for ''k''&nbsp;<&nbsp;0. Then
* the (''m'', ''n'')th approximant to ''f''(''z'') is normal if and only if none of the four determinants ''D''<sub>''m'',''n''&minus;1</sub>, ''D<sub>m,n</sub>'', ''D''<sub>''m''+1,''n''</sub>, and ''D''<sub>''m''+1,''n''+1</sub> vanish; and
* the (''m'', ''n'')th approximant to ''f''(''z'') is normal if and only if none of the four determinants ''D''<sub>''m'',''n''&minus;1</sub>, ''D<sub>m,n</sub>'', ''D''<sub>''m''+1,''n''</sub>, and ''D''<sub>''m''+1,''n''+1</sub> vanish; and
* the Padé table is normal if and only if none of the determinants ''D<sub>m,n</sub>'' are equal to zero (note in particular that this means none of the coefficients ''c<sub>k</sub>'' in the series representation of ''f''(''z'') can be zero).<ref>{{cite journal|last = Gragg|first = W.B.|title = The Padé Table and its Relation to Certain Algorithms of Numerical Analysis|journal = SIAM Review|volume = 14|issue = 1|date = Jan 1972|pages = 1–62|url = http://links.jstor.org/sici?sici=0036-1445%28197201%2914%3A1%3C1%3ATPTAIR%3E2.0.CO%3B2-2&size=LARGE|month = Jan|year = 1972|doi = 10.1137/1014001}}</ref>
* the Padé table is normal if and only if none of the determinants ''D<sub>m,n</sub>'' are equal to zero (note in particular that this means none of the coefficients ''c<sub>k</sub>'' in the series representation of ''f''(''z'') can be zero).<ref>{{cite journal|pages = 1–62|doi = 10.1137/1014001|last = Gragg|date = Jan 1972|first = W.B.|title = The Padé Table and its Relation to Certain Algorithms of Numerical Analysis|journal = SIAM Review|issue = 1|volume = 14|issn = 0036-1445|jstor=2028911|doi-access = free}}</ref>


==Connection with continued fractions==
==Connection with continued fractions==
One of the most important forms in which an analytic continued fraction can appear is as a regular [[C-fraction]], which is a continued fraction of the form
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


:<math>
:<math>
Line 79: Line 87:
where the ''a<sub>i</sub>'' &ne; 0 are complex constants, and ''z'' is a complex variable.
where the ''a<sub>i</sub>'' &ne; 0 are complex constants, and ''z'' is a complex variable.


There is an intimate connection between regular C-fractions and Padé tables with normal approximants along the main diagonal: the "stairstep" sequence of Padé approximants ''R''<sub>0,0</sub>, ''R''<sub>1,0</sub>, ''R''<sub>1,1</sub>, ''R''<sub>2,1</sub>, ''R''<sub>2,2</sub>, &hellip; is normal if and only if that sequence coincides with the successive [[Convergent (continued fraction)|convergents]] of a regular C-fraction. In other words, if the Padé table is normal along the main diagonal, it can be used to construct a regular C-fraction, and if a regular C-fraction representation for the function ''f''(''z'') exists, then the main diagonal of the Padé table representing ''f''(''z'') is normal.<ref name="JT"/>
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''<sub>0,0</sub>, ''R''<sub>1,0</sub>, ''R''<sub>1,1</sub>, ''R''<sub>2,1</sub>, ''R''<sub>2,2</sub>, ... is normal if and only if that sequence coincides with the successive [[Convergent (continued fraction)|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.<ref name="JT"/>


==An example – the exponential function==
==An example – the exponential function<!--linked from 'Exponential function'-->==
Here is an example of a Padé table, for the [[exponential function]].
Here is an example of a Padé table, for the [[exponential function]].


Line 87: Line 95:
|+A portion of the Padé table for the exponential function ''e<sup>z</sup>''
|+A portion of the Padé table for the exponential function ''e<sup>z</sup>''
|-
|-
! <sub>''m''</sub> \ <sup>''n''</sup> !! 0 !! 1 !! 2 !! 3
! {{diagonal split header|''m''|''n''}} !! 0 !! 1 !! 2 !! 3
!4
|-
|-
! 0
! 0
Line 94: Line 103:
||<math>\frac{1}{1 - z + {\scriptstyle\frac{1}{2}}z^2}</math>
||<math>\frac{1}{1 - z + {\scriptstyle\frac{1}{2}}z^2}</math>
||<math>\frac{1}{1 - z + {\scriptstyle\frac{1}{2}}z^2 - {\scriptstyle\frac{1}{6}}z^3}</math>
||<math>\frac{1}{1 - z + {\scriptstyle\frac{1}{2}}z^2 - {\scriptstyle\frac{1}{6}}z^3}</math>
|<math>\frac{1}{1-z+\frac{1}{2}z^{2}-\frac{1}{6}z^{3}+\frac{1}{24}z^{4}}</math>
|-
|-
! 1
! 1
Line 102: Line 112:
||<math>\frac{1 + {\scriptstyle\frac{1}{4}}z}
||<math>\frac{1 + {\scriptstyle\frac{1}{4}}z}
{1 - {\scriptstyle\frac{3}{4}}z + {\scriptstyle\frac{1}{4}}z^2 - {\scriptstyle\frac{1}{24}}z^3}</math>
{1 - {\scriptstyle\frac{3}{4}}z + {\scriptstyle\frac{1}{4}}z^2 - {\scriptstyle\frac{1}{24}}z^3}</math>
|<math>\frac{1+\frac{1}{5}z}{1-\frac{4}{5}z+\frac{3}{10}z^{2}-\frac{1}{15}z^{3}+\frac{1}{120}z^{4}}</math>
|-
|-
! 2
! 2
Line 111: Line 122:
||<math>\frac{1 + {\scriptstyle\frac{2}{5}}z + {\scriptstyle\frac{1}{20}}z^2}
||<math>\frac{1 + {\scriptstyle\frac{2}{5}}z + {\scriptstyle\frac{1}{20}}z^2}
{1 - {\scriptstyle\frac{3}{5}}z + {\scriptstyle\frac{3}{20}}z^2 - {\scriptstyle\frac{1}{60}}z^3}</math>
{1 - {\scriptstyle\frac{3}{5}}z + {\scriptstyle\frac{3}{20}}z^2 - {\scriptstyle\frac{1}{60}}z^3}</math>
|<math>\frac{1+\frac{1}{3}z+\frac{1}{30}z^{2}}{1-\frac{2}{3}z+\frac{1}{5}z^{2}-\frac{1}{30}z^{3}+\frac{1}{360}z^{4}}</math>
|-
|-
! 3
! 3
Line 120: Line 132:
||<math>\frac{1 + {\scriptstyle\frac{1}{2}}z + {\scriptstyle\frac{1}{10}}z^2 + {\scriptstyle\frac{1}{120}}z^3}
||<math>\frac{1 + {\scriptstyle\frac{1}{2}}z + {\scriptstyle\frac{1}{10}}z^2 + {\scriptstyle\frac{1}{120}}z^3}
{1 - {\scriptstyle\frac{1}{2}}z + {\scriptstyle\frac{1}{10}}z^2 - {\scriptstyle\frac{1}{120}}z^3}</math>
{1 - {\scriptstyle\frac{1}{2}}z + {\scriptstyle\frac{1}{10}}z^2 - {\scriptstyle\frac{1}{120}}z^3}</math>
|<math>\frac{1+\frac{3}{7}z+\frac{1}{14}z^{2}+\frac{1}{210}z^{3}}{1-\frac{4}{7}z+\frac{1}{7}z^{2}-\frac{2}{105}z^{3}+\frac{1}{840}z^{4}}</math>
|-
|-
! 4
! 4
Line 129: Line 142:
||<math>\frac{1 + {\scriptstyle\frac{4}{7}}z + {\scriptstyle\frac{1}{7}}z^2 + {\scriptstyle\frac{2}{105}}z^3+ {\scriptstyle\frac{1}{840}}z^4}
||<math>\frac{1 + {\scriptstyle\frac{4}{7}}z + {\scriptstyle\frac{1}{7}}z^2 + {\scriptstyle\frac{2}{105}}z^3+ {\scriptstyle\frac{1}{840}}z^4}
{1 - {\scriptstyle\frac{3}{7}}z + {\scriptstyle\frac{1}{14}}z^2 - {\scriptstyle\frac{1}{210}}z^3}</math>
{1 - {\scriptstyle\frac{3}{7}}z + {\scriptstyle\frac{1}{14}}z^2 - {\scriptstyle\frac{1}{210}}z^3}</math>
|<math>\frac{1+\frac{1}{2}z+\frac{3}{28}z^{2}+\frac{1}{84}z^{3}+\frac{1}{1680}z^{4}}{1-\frac{1}{2}z+\frac{3}{28}z^{2}-\frac{1}{84}z^{3}+\frac{1}{1680}z^{4}}</math>
|}
|}


Several interesting features are immediately apparent.
Several features are immediately apparent.
* The first column of the table consists of the successive truncations of the [[Taylor series]] for ''e<sup>z</sup>''.
* The first column of the table consists of the successive truncations of the [[Taylor series]] for ''e''<sup>''z''</sup>.
* Similarly, the first row contains the reciprocals of successive truncations of the series expansion of ''e''<sup>&minus;z</sup>''.
* Similarly, the first row contains the reciprocals of successive truncations of the series expansion of ''e''<sup>−''z''</sup>.
* The approximants ''R<sub>m,n</sub>'' and ''R<sub>n,m</sub>'' are quite symmetrical &ndash; 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. In fact, using the <math>{}_1F_1</math> notation of [[Hypergeometric series]],
* The approximants ''R<sub>m,n</sub>'' and ''R<sub>n,m</sub>'' are quite symmetrical &ndash; 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
::<math>R_{m,n}=\frac{{}_1F_1(-m;-m-n;z)}{{}_1F_1(-n;-m-n;-z)}</math>
::<math>R_{m,n}=\frac{{}_1F_1(-m;-m-n;z)}{{}_1F_1(-n;-m-n;-z)} = \frac{n!\,2^m\theta_m\left(\frac{z}{2};n-m+2,2\right)}{m!\,2^n\theta_n\left(-\frac{z}{2};m-n+2,2\right)}</math>,
:where <math>{}_1F_1(a;b;z)</math> is a [[generalized hypergeometric series]] and <math>\theta_n(x;\alpha,\beta)</math> is a [[Bessel polynomials#Generalization|generalized reverse Bessel polynomial]].<ref>*{{cite journal|last = Underhill|first = C.|title = Some Asymptotic Properties of Padé Approximants to <math>e^{-x}</math>|journal = Mathematics of Computation|volume = 47|issue = 175|year = 1986|pages = 253–263|jstor = 2008092}}
* Computations involving the ''R<sub>n,n</sub>'' (on the main diagonal) can be done quite efficiently. For example, ''R<sub>3,3</sub>'' reproduces the power series for the exponential function perfectly up through <sup>1</sup>/<sub>720</sub> ''z''<sup>6</sup>, but because of the symmetry of the two cubic polynomials, a very fast evaluation algorithm can be devised.
</ref>
:The expressions on the main diagonal reduce to <math>R_{n,n}=\theta_n(z/2)/\theta_n(-z/2)</math>, where <math>\theta_n(x)</math> is a [[Bessel polynomials|reverse Bessel polynomial]].<ref>*{{cite web
| title = The On-Line Encyclopedia of Integer Sequences (OEIS)
| others = Founded in 1964 by Sloane, N. J. A.
| publisher = The OEIS Foundation Inc.
| url = https://oeis.org/
}} (See sequence {{OEIS2C|A113025}}.)
</ref>
* Computations involving the ''R''<sub>''n'',''n''</sub> (on the main diagonal) can be done quite efficiently. For example, ''R''<sub>3,3</sub> reproduces the power series for the exponential function perfectly up through <sup>1</sup>/<sub>720</sub> ''z''<sup>6</sup>, 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:
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:


:<math>e^z = 1 + \cfrac{z}{1 - \cfrac{\frac{1}{2}z}{1 + \cfrac{\frac{1}{6}z}{1 - \cfrac{\frac{1}{6}z}
:<math>
e^z = 1 + \cfrac{z}{1 - \cfrac{\frac{1}{2}z}{1 + \cfrac{\frac{1}{6}z}{1 - \cfrac{\frac{1}{6}z}
{1 + \cfrac{\frac{1}{10}z}{1 - \cfrac{\frac{1}{10}z}{1 + - \ddots}}}}}}.</math>
{1 + \cfrac{\frac{1}{10}z}{1 - \cfrac{\frac{1}{10}z}{1 + - \ddots}}}}}}.
</math>


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''<sub>0,0</sub>, ''R''<sub>1,0</sub>, ''R''<sub>1,1</sub>, &hellip; Interestingly, in this particular case a closely related continued fraction can be obtained from the identity
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''<sub>0,0</sub>, ''R''<sub>1,0</sub>, ''R''<sub>1,1</sub>, ... In this particular case a closely related continued fraction can be obtained from the identity


:<math>e^z = \frac{1}{e^{-z}};</math>
:<math>
e^z = \frac{1}{e^{-z}};
</math>


that continued fraction looks like this:
that continued fraction looks like this:


:<math>e^z = \cfrac{1}{1 - \cfrac{z}{1 + \cfrac{\frac{1}{2}z}{1 - \cfrac{\frac{1}{6}z}{1 + \cfrac{\frac{1}{6}z}
:<math>
e^z = \cfrac{1}{1 - \cfrac{z}{1 + \cfrac{\frac{1}{2}z}{1 - \cfrac{\frac{1}{6}z}{1 + \cfrac{\frac{1}{6}z}
{1 - \cfrac{\frac{1}{10}z}{1 + \cfrac{\frac{1}{10}z}{1 - + \ddots}}}}}}}.</math>
{1 - \cfrac{\frac{1}{10}z}{1 + \cfrac{\frac{1}{10}z}{1 - + \ddots}}}}}}}.
</math>


This fraction's successive convergents also appear in the Padé table, and form the sequence ''R''<sub>0,0</sub>, ''R''<sub>0,1</sub>, ''R''<sub>1,1</sub>, ''R''<sub>1,2</sub>, ''R''<sub>2,2</sub>, &hellip;
This fraction's successive convergents also appear in the Padé table, and form the sequence ''R''<sub>0,0</sub>, ''R''<sub>0,1</sub>, ''R''<sub>1,1</sub>, ''R''<sub>1,2</sub>, ''R''<sub>2,2</sub>, ...


==Generalizations==
==Generalizations==
Line 167: Line 184:
</math>
</math>


where the sequence {&beta;<sub>''k''</sub>} of points in the complex plane is known as the set of ''interpolation points''. A sequence of rational approximants ''R<sub>m,n</sub>'' 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<ref>{{cite book|last = Thiele|first = T.N.|title = Interpolationsrechnung|publisher = Teubner|location = Leipzig|date = 1909}}</ref> 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
where the sequence {&beta;<sub>''k''</sub>} of points in the complex plane is known as the set of ''interpolation points''. A sequence of rational approximants ''R<sub>m,n</sub>'' 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<ref>{{cite book|last = Thiele|first = T.N.|title = Interpolationsrechnung|url = https://archive.org/details/in.ernet.dli.2015.153147|publisher = Teubner|location = Leipzig|year = 1909|isbn = 1-4297-0249-4}}</ref> 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


:<math>
:<math>
Line 173: Line 190:
</math>
</math>


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.<ref name="JT"/>
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.<ref name="JT"/>


==See also==
==See also==
Line 182: Line 199:


==References==
==References==
*{{cite book|last = Jones|first = William B.|coauthors = Thron, W. J.|title = Continued Fractions: Theory and Applications|publisher = Addison-Wesley Publishing Company|location = Reading, Massachusetts|year = 1980|pages = 185–197|isbn = 0-201-13510-8}}
*{{cite book|last = Jones|first = William B.|author2=Thron, W. J.|title = Continued Fractions: Theory and Applications|url = https://archive.org/details/continuedfractio0000jone|url-access = registration|publisher = Addison-Wesley Publishing Company|location = Reading, Massachusetts|year = 1980|pages = [https://archive.org/details/continuedfractio0000jone/page/185 185–197]|isbn = 0-201-13510-8}}
*{{cite book|last = Wall|first = H. S.|title = Analytic Theory of Continued Fractions|publisher = Chelsea Publishing Company|year = 1973|pages = 377–415|isbn = 0-8284-0207-8}}<br><small>(This is a reprint of the volume originally published by D. Van Nostrand Company, Inc., in 1948.)</small>
*{{cite book|last = Wall|first = H. S.|title = Analytic Theory of Continued Fractions|publisher = [[Chelsea Publishing Company]]|year = 1973|pages = 377–415|isbn = 0-8284-0207-8}}<br><small>(This is a reprint of the volume originally published by [[D. Van Nostrand Company, Inc.]], in 1948.)</small>
{{DEFAULTSORT:Pade table}}

[[Category:Continued fractions]]
[[Category:Continued fractions]]
[[Category:Numerical analysis]]
[[Category:Numerical analysis]]

Latest revision as of 18:28, 17 July 2024

Henri Padé

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

Rm, 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

[edit]

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

[edit]

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

where c0 ≠ 0, by convention. The (m, n)th entry[3] Rm, n in the Padé table for f(z) is then given by

where Pm(z) and Qn(z) are polynomials of degrees not more than 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 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 bi, and so admits of infinitely many solutions each of which determines a possible Qn. Pm 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 Rm, n are all the same, so that the (mn)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. Usage of the Padé table has been extended to meromorphic functions by newer, timesaving methods such as the epsilon algorithm.[4]

The block theorem and normal approximants

[edit]

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

Qn(z)f(z) − Pm(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 Rm, n occupies

(r + 1)2

cells in the Padé table, from position (mn) through position (m+rn+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 cn in the Taylor series expansion of f(z), as follows. Define the (mn)th determinant by

with Dm,0 = 1, Dm,1 = cm, and ck = 0 for k < 0. Then

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

Connection with continued fractions

[edit]

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

where the ai ≠ 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 R0,0, R1,0, R1,1, R2,1, R2,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.[2]

An example – the exponential function

[edit]

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

A portion of the Padé table for the exponential function ez
n
m
0 1 2 3 4
0
1
2
3
4

Several features are immediately apparent.

  • The first column of the table consists of the successive truncations of the Taylor series for ez.
  • Similarly, the first row contains the reciprocals of successive truncations of the series expansion of ez.
  • 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. They can be expressed in terms of special functions as
,
where is a generalized hypergeometric series and is a generalized reverse Bessel polynomial.[6]
The expressions on the main diagonal reduce to , where is a reverse Bessel polynomial.[7]
  • 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.

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:

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 R0,0, R1,0, R1,1, ... In this particular case a closely related continued fraction can be obtained from the identity

that continued fraction looks like this:

This fraction's successive convergents also appear in the Padé table, and form the sequence R0,0, R0,1, R1,1, R1,2, R2,2, ...

Generalizations

[edit]

A formal Newton series L is of the form

where the sequence {βk} of points in the complex plane is known as the set of interpolation points. A sequence of rational approximants Rm,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[8] 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

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.[2]

See also

[edit]

Notes

[edit]
  1. ^ O'Connor, John J.; Robertson, Edmund F., "Padé table", MacTutor History of Mathematics Archive, University of St Andrews
  2. ^ a b c d Jones and Thron, 1980.
  3. ^ 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).
  4. ^ Wynn, Peter (Apr 1956). "On a Device for Computing the em(Sn) Transformation". Mathematical Tables and Other Aids to Computation. 10 (54). American Mathematical Society: 91–96. doi:10.2307/2002183. JSTOR 2002183.
  5. ^ Gragg, W.B. (Jan 1972). "The Padé Table and its Relation to Certain Algorithms of Numerical Analysis". SIAM Review. 14 (1): 1–62. doi:10.1137/1014001. ISSN 0036-1445. JSTOR 2028911.
  6. ^ *Underhill, C. (1986). "Some Asymptotic Properties of Padé Approximants to ". Mathematics of Computation. 47 (175): 253–263. JSTOR 2008092.
  7. ^ *"The On-Line Encyclopedia of Integer Sequences (OEIS)". Founded in 1964 by Sloane, N. J. A. The OEIS Foundation Inc.{{cite web}}: CS1 maint: others (link) (See sequence OEISA113025.)
  8. ^ Thiele, T.N. (1909). Interpolationsrechnung. Leipzig: Teubner. ISBN 1-4297-0249-4.

References

[edit]