Fast inversion of Hankel and Toeplitz matrices

DOI10.1016/0020-0190(92)90039-XzbMath0746.65025OpenAlexW1982490402MaRDI QIDQ1186587

Luca Gemignani

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90039-x

zbMATH Keywords

algorithmToeplitz matricesEuclidean algorithmHankel matricesfast inversiondesign of algorithmEuclidean scheme

Mathematics Subject Classification ID

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

Related Items

Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation, The extrapolation theorem for discrete signals in the offset linear canonical transform domain, Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices, Symmetric subresultants and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Inversion des matrices de Hankel. (Inversion of Hankel matrices)
• Algebraic methods for Toeplitz-like matrices and operators
• Inertia characteristics of self-adjoint matrix polynomials
• On the partial realization problem
• A new algorithm for solving Toeplitz systems of equations
• Asymptotically fast solution of Toeplitz and related systems of linear equations
• A new method for computing polynomial greatest common divisors and polynomial remainder sequences
• Bézoutians
• The Inverses of Block Hankel and Block Toeplitz Matrices
• Parallel Solution of Certain Toeplitz Linear Systems
• The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• An Algorithm for the Inversion of Finite Toeplitz Matrices
• Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel Matrices