Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm

DOI10.1080/00207160802322340zbMath1158.65316OpenAlexW2064999681MaRDI QIDQ3603591

Nadia Ben Atti, Gema Maria Diaz Toca

Publication date: 18 February 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160802322340

zbMATH Keywords

numerical examplepolynomialsToeplitz matrixHankel matrixEuclidean algorithmBézout matrixblock LU factorization

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Algebraic methods for Toeplitz-like matrices and operators
• On the partial realization problem
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
• Computationally efficient applications of the Euclidean algorithm to zero location
• Block diagonalization and LU-equivalence of Hankel matrices
• Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
• Algorithms in real algebraic geometry
• Sylvester-Habicht sequences and fast Cauchy index computation

This page was built for publication: Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm