Further optimized look-ahead recurrences for adjacent rows in the Padé table and Toeplitz matrix factorizations

DOI10.1016/S0377-0427(97)00157-XzbMath0932.65025OpenAlexW2044738423WikidataQ114121039 ScholiaQ114121039MaRDI QIDQ1379003

Marlis Hochbruck

Publication date: 30 August 1998

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(97)00157-x

zbMATH Keywords

Levinson algorithmSchur algorithmformal Laurent seriesToeplitz systemsPadé tablelook-ahead algorithmblock LDU decompositions

Mathematics Subject Classification ID

Padé approximation (41A21) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Cites Work

• Unnamed Item
• Algebraic methods for Toeplitz-like matrices and operators
• 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 algorithm for the solution of general Hankel systems
• A look-ahead Bareiss algorithm for general Toeplitz matrices
• A lookahead algorithm for the solution of block Toeplitz systems
• Look-ahead methods for block Hankel systems
• Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
• Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems
• Formal orthogonal polynomials and Hankel/Toeplitz duality
• Optimized look-ahead recurrences for adjacent rows in the Padé table
• Look-ahead Levinson- and Schur-type recurrences in the Padé table
• A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
• A look-ahead Levinson algorithm for general Toeplitz systems
• An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
• Displacement Structure: Theory and Applications
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis

This page was built for publication: Further optimized look-ahead recurrences for adjacent rows in the Padé table and Toeplitz matrix factorizations