Look-ahead Levinson- and Schur-type Recurrences in the Padé Table∗

@inproceedings{Gutknecht1994LookaheadLA,
  title={Look-ahead Levinson- and Schur-type Recurrences in the Padé Table∗},
  author={Martin H. Gutknecht and Marlis Hochbruck},
  year={1994}
}
For computing Padé approximants, we present presumably stable recursive algorithms that follow two adjacent rows of the Padé table and generalize the well-known classical Levinson and Schur recurrences to the case of a nonnormal Padé table. Singular blocks in the table are crossed by look-ahead steps. Ill-conditioned Padé approximants are skipped also. If the size of these lookahead steps is bounded, the recursive computation of an (m,n) Padé approximant with either the look-ahead Levinson or… CONTINUE READING