On fast computation of superdiagonal Padé fractions

DOI10.1007/BFb0120971zbMath0501.65006OpenAlexW40832282MaRDI QIDQ3966993

D. Y. Y. Yun, Fred G. Gustavson, Daniel D. Warner, William B. Gragg

Publication date: 1982

Published in: Algorithms and Theory in Filtering and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120971

zbMATH Keywords

numerical stabilitycontinued fractionsChristoffel-Darboux formulathree term recurrence relationsJ-fractionspositive definite Hankel matricesfast Pade fraction algorithmsuperdiagonal fractions

Mathematics Subject Classification ID

Padé approximation (41A21) Algorithms for approximation of functions (65D15) Numerical summation of series (65B10)

Related Items

A look-ahead algorithm for the solution of general Hankel systems, The multipoint Padé table and general recurrences for rational interpolation, A stabilized superfast solver for indefinite Hankel systems, Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle, Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems, Numerical experience with a superfast real Toeplitz solver