Abstract
A new look-ahead algorithm for recursively computing Padé approximants is introduced. It generates a subsequence of the Padé approximants on two adjacent rows (defined by fixed numerator degree) of the Padé table. Its two basic versions reduce to the classical Levinson and Schur algorithms if no look-ahead is required. The new algorithm can be viewed as a combination of the look-ahead sawtooth and the look-ahead Levinson and Schur algorithms that we proposed before, but now the look-ahead step size is minimal (as in the sawtooth version) and the computational costs are as low as in the least expensive competing algorithms (including our look-ahead Levinson and Schur algorithms). The underlying recurrences link well-conditioned basic pairs,i.e., pairs of sufficiently different neighboring Padé forms.
The algorithm can be used to solve Toeplitz systems of equationsTx = b. In this application it comes in several versions: anO(N 2) Levinson-type form, anO(N 2) Schur-type form, and a superfastO(N log2 N) Schur-type version. As an option of the first two versions, the corresponding block LDU decompositions ofT −1 orT, respectively, can be found.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Bultheel,Laurent Series and their Padé Approximations, Birkhäuser, Basel/Boston, 1987.
A. Bultheel and M. Van Barel,Formal orthogonal polynomials and rational approximation for arbitrary bilinear forms, Tech. Report TW 163, Department of Computer Science, Katholieke Universiteit Leuven (Belgium), 1991.
T. F. Chan and P. C. Hansen,A look-ahead Levinson algorithm for general Toeplitz systems, IEEE Trans. Signal Processing, 40 (1992), pp. 1079–1090.
S. C. Cooper, A. Magnus, and J. H. McCabe,On the non-normal two-point Padé table, J. Comput. Appl. Math., 16 (1986), pp. 371–380.
A. Draux,Polynômes orthogonaux formels—applications, vol. 974 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1983.
R. Freund and H. Zha,Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems, Linear Algebra Appl., 188/189 (1993), pp. 255–304.
R. W. Freund,A look-ahead Bareiss algorithm for general Toeplitz matrices, Numer. Math., 68 (1994), pp. 35–69.
W. B. Gragg,The Padé table and its relation to certain algorithms of numerical analysis, SIAM Rev., 14 (1972), pp. 1–62.
M. H. Gutknecht,Stable row recurrences in the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems, Linear Algebra Appl., 188/189 (1993), pp. 351–421.
M. H. Gutknecht and M. Hochbruck,Look-ahead Levinson- and Schur-type recurrences in the Padé table, Electronic Trans. Numer. Anal., 2 (1994), pp. 104–129.
M. H. Gutknecht and M. Hochbruck,Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems, Numer. Math., 70 (1995), pp. 181–227.
T. Huckle,Superfast solution of linear equations with low displacement rank, Tech. Report SCCM-93-15, Computer Science Department, Stanford University, December 1993.
N. Levinson,The Wiener rms (root-mean-square) error criterion in filter design and prediction, J. Math. Phys., 25 (1947), pp. 261–278.
I. Schur,Ueber Potenzreihen, die im Innern des Einheitskreises beschränkt sind, I, Crelle's J. (J. Reine Angew. Math.), 147 (1917), pp. 205–232.
L. N. Trefethen and M. H. Gutknecht,Padé, stable Padé, and Chebyshev-Padé approximation, in Algorithms for Approximation, J. Mason and M. Cox, eds., IMA Conference Series, new series, Vol. 10, Clarendon Press, Oxford, 1987, pp. 227–264.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gutknecht, M.H., Hochbruck, M. Optimized look-ahead recurrences for adjacent rows in the Padé table. Bit Numer Math 36, 264–286 (1996). https://doi.org/10.1007/BF01731983
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01731983