# Optimized look-ahead recurrences for adjacent rows in the Padé table

- Received:
- Revised:

DOI: 10.1007/BF01731983

- Cite this article as:
- Gutknecht, M.H. & Hochbruck, M. Bit Numer Math (1996) 36: 264. doi:10.1007/BF01731983

- 5 Citations
- 14 Downloads

## 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 equations**Tx = b**. In this application it comes in several versions: an*O*(*N*^{2}) Levinson-type form, an*O*(*N*^{2}) Schur-type form, and a superfast*O*(*N* log^{2}*N*) Schur-type version. As an option of the first two versions, the corresponding block LDU decompositions of**T**^{−1} or**T**, respectively, can be found.