A look-ahead algorithm for the solution of general Hankel systems

DOI10.1007/BF01388691zbMath0796.65028MaRDI QIDQ1326405

Roland W. Freund, Hongyuan Zha

Publication date: 10 October 1994

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133707

zbMATH Keywords

numerical experimentnonsymmetric Lanczos algorithmill-conditioned submatricesHankel systemslook-ahead algorithm

Mathematics Subject Classification ID

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

Related Items

The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization, Stability analysis of a general Toeplitz system solver, A look-ahead strategy for the implementation of some old and new extrapolation methods, A lookahead algorithm for the solution of block Toeplitz systems, A fast algorithm for generalized Hankel matrices arising in finite-moment problems, Bernstein-Bézoutian matrices, Inversion of a block Löwner matrix, 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, Solving Toeplitz systems after extension and transformation, Fast and stable computation of the barycentric representation of rational interpolants, Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems, The Lanczos algorithm and complex Gauss quadrature, Computation of matrix-valued formally orthogonal polynomials and applications, A fast iterative method for determining the stability of a polynomial, 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 fast Hankel solver based on an inversion formula for Loewner matrices, A new algorithm for computing orthogonal polynomials, Rational approximation in linear systems and control

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic methods for Toeplitz-like matrices and operators
• On the partial realization problem
• Laurent series and their Padé approximations
• Matrix interpretations and applications of the continued fraction algorithm
• Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
• A simple Hankel interpretation of the Berlekamp-Massey algorithm
• Polynômes orthogonaux formels - applications
• Solution of linear equations with Hankel and Toeplitz matrices
• A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• On fast computation of superdiagonal Padé fractions
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• An Algorithm for the Inversion of Finite Hankel Matrices
• Shift-register synthesis and BCH decoding
• The Triangular Decomposition of Hankel Matrices
• The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis