Skip to Main content Skip to Navigation

Algèbre matricielle rapide en calcul formel et calcul numérique

Abstract : We introduce a new algorithm for the approximate block factorization of real Hankel matrices. We then describe the natural relationship between the Euclidean algorithm and our approximate block factorization, not only for Hankel matrices associated to two polynomials but also for Bézout matrices associated to the same polynomials. Finally, in the complex case, we present a revised algorithm for our approximate block factorization of Hankel matrices by calculating the approximate polynomial quotients and remainders appearing in the Euclidean algorithm.
Complete list of metadatas

Cited literature [66 references]  Display  Hide  Download
Contributor : Skander Belhaj <>
Submitted on : Friday, May 28, 2010 - 4:53:36 PM
Last modification on : Saturday, December 19, 2020 - 3:00:35 AM
Long-term archiving on: : Thursday, September 16, 2010 - 3:41:28 PM


  • HAL Id : tel-00487346, version 1


Skander Belhaj. Algèbre matricielle rapide en calcul formel et calcul numérique. Mathématiques [math]. Ecole Nationale d'Ingénieurs de Tunis (Université de Tunis El Manar); Université de Franche-Comté, 2010. Français. ⟨tel-00487346⟩



Record views


Files downloads