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

• ID: 2716, RIV: 10319194
• ISSN: neuvedeno, ISBN: 978-80-85823-64-6
• zdroj: Programs and Algorithms of numerical Mathematics 17
• klíčová slova: greatest common divisor; Sylvestr matrix; numerical matrix rank
• autoři: Jiří Eckstein, Jan Zítko
• autoři z KNM: nepřiřazeno

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.