Computing the block factorization of complex Hankel matrices

DOI10.1007/s00607-010-0080-5zbMath1189.65051OpenAlexW2089519480MaRDI QIDQ971932

Skander Belhaj

Publication date: 17 May 2010

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-010-0080-5

zbMATH Keywords

numerical examplesHankel matrixblock diagonalizationEuclidean algorithmtriangular Toeplitz matrixSchur complementation

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Toeplitz, Cauchy, and related matrices (15B05)

Related Items (2)

Computing the polynomial remainder sequence via Bézout matrices ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the partial realization problem
• Linear algebra, rational approximation and orthogonal polynomials
• A fast method to block-diagonalize a Hankel matrix
• Block diagonalization and LU-equivalence of Hankel matrices
• Parallel Solution of Certain Toeplitz Linear Systems
• Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
• Fast Triangular Factorization and Inversion of Hankel and Related Matrices with Arbitrary Rank Profile
• The Triangular Decomposition of Hankel Matrices
• Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials
• Fast inversion of triangular Toeplitz matrices

This page was built for publication: Computing the block factorization of complex Hankel matrices