Article contents
Block Factorization of Hankel Matrices and Euclidean Algorithm
Published online by Cambridge University Press: 26 August 2010
Abstract
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 [1]. 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
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2010
References
- 4
- Cited by