Publication at Faculty of Mathematics and Physics |
2013
Abstract
The coefficients of the greatest common divisor of two univariate polynomials can be obtained from the Sylvester subresultant matrix transformed to lower triangular form. Firstly, it is supposed that the coefficients of polynomials are given exactly.
Transformation is in detail described and an algorithm for the calculation of the greatest common divisor is formulated. If inexact polynomials are given, then an approximate greatest common divisor (AGCD) is introduced.
The considered techniques for an AGCD computations are shortly discussed and numerically compared in the presented paper.