A fast method to block-diagonalize a Hankel matrix
From MaRDI portal
Publication:2477406
DOI10.1007/s11075-007-9144-9zbMath1141.65020OpenAlexW2075523571MaRDI QIDQ2477406
Publication date: 13 March 2008
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-007-9144-9
algorithmnumerical resultsHankel matrixfactorizationTriangular Toeplitz matrixSchur complementationBini methodBlock diagonalization
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
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
Uses Software
Cites Work
- Algebraic methods for Toeplitz-like matrices and operators
- On the partial realization problem
- Linear algebra, rational approximation and orthogonal polynomials
- Approximate real polynomial division via approximate inversion of real triangular Toeplitz matrices
- Block diagonalization and LU-equivalence of Hankel matrices
- Parallel Solution of Certain Toeplitz Linear Systems
- Fast Triangular Factorization and Inversion of Hankel and Related Matrices with Arbitrary Rank Profile
- A Stable Numerical Method for Inverting Shape from Moments
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
