Block diagonalization and LU-equivalence of Hankel matrices
From MaRDI portal
Recommendations
- Computing the block factorization of complex Hankel matrices
- A fast method to block-diagonalize a Hankel matrix
- The new algorithm for \(LDL^T\) decomposition of block Hankel matrices
- Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
- A simple Hankel interpretation of the Berlekamp-Massey algorithm
Cites work
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- Algebraic methods for Toeplitz-like matrices and operators
- Linear algebra, rational approximation and orthogonal polynomials
- New techniques for the computation of linear recurrence coefficients
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- On the partial realization problem
- The Berlekamp-Massey algorithm revisited
Cited in
(7)- A fast method to block-diagonalize a Hankel matrix
- Block diagonalization in Banach algebras
- On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
- The new algorithm for \(LDL^T\) decomposition of block Hankel matrices
- Computing the block factorization of complex Hankel matrices
- Computing the polynomial remainder sequence via Bézout matrices
- Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm
This page was built for publication: Block diagonalization and LU-equivalence of Hankel matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576218)
