This paper compares three algorithms for the symbolic computation of Pade approximants: an 0(n3) algorithm based on the direct solution of the Hankel linear system exploiting only the property of symmetry, an 0(n2) algorithm based on the extended Euclidean algorithm, and an 0(n log2n) algorithm based on a divide-and-conquer version of the extended Euclidean algorithm. Implementations of these algorithms are presented and some timing comparisons are given. It is found that the 0(n2) algorithm is often the fastest for practical sizes of problems and, surprisingly, the 0(n3) algorithm wins in the important case where the power series being approximated has an exact rational function representation.
[1]
W. Gragg,et al.
The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
,
1972
.
[2]
David Y. Y. Yun,et al.
Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants
,
1980,
J. Algorithms.
[3]
Keith O. Geddes.
Symbolic Computation of Padé Approximants
,
1979,
TOMS.
[4]
Alfred V. Aho,et al.
The Design and Analysis of Computer Algorithms
,
1974
.
[5]
James B. Shearer,et al.
A Property of Euclid’s Algorithm and an Application to Padé Approximation
,
1978
.