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

DOI10.1007/BF01731983zbMath0852.65025OpenAlexW2005537210MaRDI QIDQ1914867

Marlis Hochbruck, Martin H. Gutknecht

Publication date: 4 December 1996

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

Padé approximationLevinson algorithmToeplitz matrixSchur algorithmfast algorithmToeplitz systemsill-conditionedsawtooth algorithm\(LDU\) decompositions

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (6)

The stability of inversion formulas for Toeplitz matrices ⋮ A lookahead algorithm for the solution of block Toeplitz systems ⋮ Further optimized look-ahead recurrences for adjacent rows in the Padé table and Toeplitz matrix factorizations ⋮ Look-ahead methods for block Hankel systems ⋮ A stabilized superfast solver for indefinite Hankel systems ⋮ Computations with Gohberg-Semencul-type formulas for Toeplitz matrices

Cites Work

• Unnamed Item
• On the non-normal two-point Padé table
• Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
• Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
• A look-ahead Bareiss algorithm for general Toeplitz matrices
• Polynômes orthogonaux formels - applications
• Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
• Look-ahead Levinson- and Schur-type recurrences in the Padé table
• A look-ahead Levinson algorithm for general Toeplitz systems
• The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis

This page was built for publication: Optimized look-ahead recurrences for adjacent rows in the Padé table