The approximate GCD of inexact polynomials
| Autor: | Barry H. Dayton, Zhonggang Zeng |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
Discrete mathematics
Euclidean algorithm Binary GCD algorithm Mathematics::Number Theory Factorization of polynomials ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION MathematicsofComputing_NUMERICALANALYSIS Greatest common divisor Factorization of polynomials over finite fields Dixon's factorization method Polynomial greatest common divisor Square-free polynomial Mathematics |
| Zdroj: | ISSAC |
| DOI: | 10.1145/1005285.1005331 |
| Popis: | This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. The method and the companion software appear to be the first practical package with such capabilities. The most significant features of the algorithm are its robustness and accuracy as demonstrated in computational experiments. In addition, two variations of a squarefree factorization method for multivariate polynomials are proposed as an application of the GCD algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|