𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing the block factorization of complex Hankel matrices

✍ Scribed by Skander Belhaj

Publisher
Springer Vienna
Year
2010
Tongue
English
Weight
256 KB
Volume
87
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spectral clustering properties of block
Spectral clustering properties of block multilevel Hankel matrices
✍ Dario Fasino; Paolo Tilli πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 83 KB

By means of recent results concerning spectral distributions of Toeplitz matrices, we show that the singular values of a sequence of block p-level Hankel matrices H n (Β΅), generated by a p-variate, matrix-valued measure Β΅ whose singular part is finitely supported, are always clustered at zero, thus

Block diagonalization and LU-equivalence
Block diagonalization and LU-equivalence of Hankel matrices
✍ Nadia Ben Atti; Gema M. Diaz–Toca πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 196 KB

This article presents a new algorithm for obtaining a block diagonalization of Hankel matrices by means of truncated polynomial divisions, such that every block is a lower Hankel matrix. In fact, the algorithm generates a block LU-factorization of the matrix. Two applications of this algorithm are a