New view at the calculation of the greatest common divisor of two polynomials

Abstract

The greatest common divisor (GCD) of two polynomials is computed by the reduction of the Sylvester matrix to lower triangular form. The process is exactly mathematically described.

The STLN-algorithm is mentioned for calculation of GCD of two polynomials with inexact coefficients and demonstrated on a numerical example.

Keywords

• greatest common divisor
• STLN-algorithm
• numerical test