Title :
Polynomial GCD and Factorization via Approximate Gröbner Bases
Author :
Lichtblau, Daniel
Author_Institution :
Wolfram Res., Champaign, IL, USA
Abstract :
We discuss computation of approximate Gröbner bases at finite precision. We show how this can be used to deduce exact results for polynomial greatest common divisors and factorization. In particular we indicate an algorithm for factoring multivariate polynomials over the closure algebraic of the rationals.
Keywords :
matrix decomposition; polynomial approximation; approximate Grobner bases; closure algebraic; finite precision; multivariate polynomial factorization; polynomial greatest common divisor; Algebra; Approximation algorithms; Approximation methods; Computational modeling; Polynomials; Robustness; Timing; Gröbner basis; hybrid symbolic-numeric computation; polynomial gcd;
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2010 12th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-1-4244-9816-1
DOI :
10.1109/SYNASC.2010.76
