Previous |  Up |  Next


Title: An improvement of Euclid's algorithm (English)
Author: Zítko, Jan
Author: Kuřátko, Jan
Language: English
Journal: Programs and Algorithms of Numerical Mathematics
Volume: Proceedings of Seminar. Dolní Maxov, June 6-11, 2010
Issue: 2010
Pages: 251-260
Category: math
Summary: 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. (English)
Keyword: Euclid's algorithm
Keyword: greatest common divisor
Keyword: Sylvester matrix
MSC: 11A05
MSC: 13P05
MSC: 65F30
Date available: 2015-07-08T06:56:38Z
Last updated: 2015-07-08
Stable URL:


Files Size Format View
PANM_15-2010-1_35.pdf 342.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo