Comparison of algorithms for calculation of the greatest common divisor of several polynomials

Abstrakt

The paper deals with a problem of numerical computing of the greatest common divisor of polynomials. In the paper there are compared two possible appraches base either on Sylveter or on Bezout matrices.

Klíčová slova

• greatest common divisor
• Sylvestr matrix
• numerical matrix rank