A geometric-numeric algorithm for absolute factorization of multivariate polynomials

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2002, Pages 37-45

  Corless, Robert M ^a   Galligo, André ^a   Kotsireas, Ilias S ^a   Watt, Stephen M ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; INTERPOLATION; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; POLES AND ZEROS; POLYNOMIALS; PROBABILITY;

ABSOLUTE FACTORIZATION; COMPUTER ALGEBRA; GEOMETRIC-NUMERIC ALGORITHM; MULTIVARIATE POLYNOMIALS; SINGLE EXTENSION METHOD;

ALGORITHMS;

EID: 0036049274     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780506.780512     Document Type: Conference Paper

References (27)

1. Factoring rational polynomials over the complexes
2. Towards factoring bivariate approximate polynomials
3. Absolute factorization of polynomials: A geometric approach
4. An absolute primality test for bivariate polynomials
5. Semi-numerical determination of irreducible branches of a reduced space curve
6. Absolute irreducible decomposition of curves
7. Absolute primality of polynomials is decidable in random polynomial time in the number of variables
8. Fast parallel absolute irreducibility testing
9. Polynomial factorization 1987-1991
10. Effective Hilbert irreducibility
11. Semi-numerical absolute factorization of polynomials with integer coefficients
12. Approximate factorization of multivariate polynomials and absolute irreducibility testing
13. Approximate multivariate polynomial factorization based on zero-sum relations
14. Initial value problems for ODEs in problem solving environments
15. Using monodromy to decompose solution sets of polynomial systems into irreducible components
16. Symmetric functions applied to decomposing solution sets of polynomial systems
17. Numerical decomposition of the solution sets of polynomial systems into irreducible components