Block Factorization of Hankel Matrices and Euclidean Algorithm

@inproceedings{Belhaj2010BlockFO,
  title={Block Factorization of Hankel Matrices and Euclidean Algorithm},
  author={Skander Belhaj},
  year={2010}
}
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 

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Atti.Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm

G. Diaz-Toca, N. Ben
  • Int. J. Comput. Math.,
  • 2009
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Ben Atti . Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm

W. B. Gragg, A. Lindquist
  • Int . J . Comput . Math .
  • 2009

Diaz-Toca. Block diagonalization and LU-equivalence of Hankel matrices

G.M.N. Ben Atti
  • Linear Algebra and its Applications,
  • 2006
VIEW 1 EXCERPT

Gemignani.Fast parallel computation of the polynomial remainder sequence via Bézout and Hankel matrices

L. D. Bini
  • SIAM J. Comput.,
  • 1995
VIEW 1 EXCERPT

Gemignani.On the Euclidean scheme for polynomials having interlaced real zeros

L. D. Bini
  • Proc. 2nd ann. ACM symp. on parallel algorithms and architectures,
  • 1990
VIEW 1 EXCERPT