Free Access
Issue
Math. Model. Nat. Phenom.
Volume 5, Number 7, 2010
JANO9 – The 9th International Conference on Numerical Analysis and Optimization
Page(s) 48 - 54
DOI https://doi.org/10.1051/mmnp/20105708
Published online 26 August 2010
  1. S. Belhaj. A fast method to block-diagonalize a Hankel matrix. Numer Algor, 47 (2008), 15-34. [CrossRef]
  2. S. Belhaj. Block diagonalization of Hankel and Bézout matrices : connection with the Euclidean algorithm, submitted.
  3. N. Ben Atti, G.M. Diaz-Toca. Block diagonalization and LU-equivalence of Hankel matrices. Linear Algebra and its Applications, 412 (2006), 247-269. [CrossRef] [MathSciNet]
  4. D. Bini, L. Gemignani. On the Euclidean scheme for polynomials having interlaced real zeros. Proc. 2nd ann. ACM symp. on parallel algorithms and architectures, Crete, (1990), 254-258.
  5. D. Bini, L. Gemignani. Fast parallel computation of the polynomial remainder sequence via Bézout and Hankel matrices. SIAM J. Comput., 24 (1995), 63–77. [CrossRef] [MathSciNet]
  6. A. Borodin, J. VonZurGathen, J. Hopcroft. Fast parallel matrix and gcd computation. Information and Control, 52 (1982), 241-256. [CrossRef] [MathSciNet]
  7. G. Diaz-Toca, N. Ben Atti. Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm. Int. J. Comput. Math., 86 (2009), 135-149. [CrossRef] [MathSciNet]
  8. W. B. Gragg, A. Lindquist. On partial realization problem. Linear Algebra Appl., 50 (1983), 277-319. [CrossRef] [MathSciNet]
  9. G. Heining, K. Rost. Algebraic methods for Toeplitz-like matrices and operators. Birkhäuser Verlag, Basel, 1984.

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.