An improvement of Euclid's algorithm

Zítko, Jan, and Kuřátko, Jan. "An improvement of Euclid's algorithm." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics AS CR, 2010. 251-260. <http://eudml.org/doc/271277>.

@inProceedings{Zítko2010,
abstract = {The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using $c$-$s$ transformation and $QR$-factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.},
author = {Zítko, Jan, Kuřátko, Jan},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {Euclid's algorithm; greatest common divisor; Sylvester matrix},
location = {Prague},
pages = {251-260},
publisher = {Institute of Mathematics AS CR},
title = {An improvement of Euclid's algorithm},
url = {http://eudml.org/doc/271277},
year = {2010},
}

TY - CLSWK
AU - Zítko, Jan
AU - Kuřátko, Jan
TI - An improvement of Euclid's algorithm
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2010
CY - Prague
PB - Institute of Mathematics AS CR
SP - 251
EP - 260
AB - The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using $c$-$s$ transformation and $QR$-factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.
KW - Euclid's algorithm; greatest common divisor; Sylvester matrix
UR - http://eudml.org/doc/271277
ER -