Computing the block factorization of complex Hankel matrices

Authors:
Skander Belhaj
Affiliations:
Univ. de Franche-Comté, Lab. de Mathématiques, CNRS UMR 6623, UFR des Sci. et Tech., 25030, Besançon Cedex, France and Ecole Nationale d’Ingénieurs de Tunis, Lab ...
Venue:
Computing
Year:
2010

Citing 7
Cited 0

Parallel solution of certain toeplitz linear systems

SIAM Journal on Computing
Fundamentals of digital image processing

Fundamentals of digital image processing
Fast Triangular Factorization and Inversion of Hankel and Related Matriceswith Arbitrary Rank Profile

SIAM Journal on Matrix Analysis and Applications
Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Fast inversion of triangular Toeplitz matrices

Theoretical Computer Science - Algebraic and numerical algorithm
Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm

International Journal of Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an algorithm for finding an approximate block diagonalization of complex Hankel matrices. Our method is based on inversion techniques of an upper triangular Toeplitz matrix, specifically, by simple forward substitution. We also consider an approximate block diagonalization of complex Hankel matrices via Schur complementation. An application of our algorithm by calculating the approximate polynomial quotient and remainder appearing in the Euclidean algorithm is also given. We have implemented our algorithms in Matlab. Numerical examples are included. They show the effectiveness of our strategy.