Abstract
The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid's algorithm is simulated by the reduction of the Sylvester matrix to an upper triangular form by using c-s transformation and QR-factorization method.
Both procedures are described and numerically compared with classical Euclid's algorithm. The new procedures yield more precise results.