Math. Model. Nat. Phenom.
Volume 5, Number 7, 2010JANO9 – The 9th International Conference on Numerical Analysis and Optimization
|Page(s)||48 - 54|
|Published online||26 August 2010|
Block Factorization of Hankel Matrices and Euclidean Algorithm
Laboratoire de Mathématiques, CNRS UMR 6623, Université de
2 Laboratoire LAMSIN, Ecole Nationale d’Ingénieurs de Tunis BP 37, 1002 Tunis Belvédère, Tunisie
* Corresponding author: E-mail:
It is shown that a real Hankel matrix admits an approximate block diagonalization in which the successive transformation matrices are upper triangular Toeplitz matrices. The structure of this factorization was first fully discussed in . This approach is extended to obtain the quotients and the remainders appearing in the Euclidean algorithm applied to two polynomials u(x) and v(x) of degree n and m, respectively, whith m < n
Mathematics Subject Classification: 15A23 / 15B05 / 65F05 / 11C08
Key words: block factorization / Hankel matrices / Toeplitz matrices / Euclidean algorithm
© EDP Sciences, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.