Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm

Authors:
Gema M. Diaz-Toca;Nadia Ben Atti
Affiliations:
Departments de Matematicas Aplicada, Universidad de Murcia, Murcia, Spain;Laboratoire de Mathematiques, Universite de Franche-Comte, Besancon cedex, France
Venue:
International Journal of Computer Mathematics
Year:
2009

Citing 5
Cited 1

Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
Fast Parallel Computation of the Polynomial Remainder Sequence Via Bezout and Hankel Matrices

SIAM Journal on Computing
Sylvester—Habicht sequences and fast Cauchy index computation

Journal of Symbolic Computation
Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices

Journal of Symbolic Computation
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Computing the block factorization of complex Hankel matrices

Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given two polynomials, this paper is devoted to describing the natural relation between the Euclidean algorithm and the block LU factorization of the Hankel and Bezout matrices associated to such polynomials.