Fast Triangular Factorization and Inversion of Hankel and Related Matrices with Arbitrary Rank Profile

DOI10.1137/S0895479889172643zbMath0798.65032MaRDI QIDQ4292678

Debajyoti Pal, Thomas Kailath

Publication date: 30 October 1994

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

generating functiondisplacement structureinertiainversesrank profiletriangular factorizationquasi-Hankel matrices

Mathematics Subject Classification ID

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

Related Items (7)

Stable factorization for Hankel and Hankel‐like matrices ⋮ A fast method to block-diagonalize a Hankel matrix ⋮ Computing the inertia of Bézout and Hankel matrices ⋮ Computing the block factorization of complex Hankel matrices ⋮ A fast iterative method for determining the stability of a polynomial ⋮ A framework for polynomial preconditioners based on fast transforms. I: Theory ⋮ Computationally efficient applications of the Euclidean algorithm to zero location

This page was built for publication: Fast Triangular Factorization and Inversion of Hankel and Related Matrices with Arbitrary Rank Profile