Fast parallel absolute irreducibility testing
Journal of Symbolic Computation
Factoring rational polynomials over the complexes
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Absolute factorization of polynomials: a geometric approach
SIAM Journal on Computing
A numerical absolute primality test for bivariate polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Modern computer algebra
Initial value problems for ODEs in problem solving environments
Journal of Computational and Applied Mathematics - Special issue on numerical anaylsis 2000 Vol. VI: Ordinary differential equations and integral equations
Towards factoring bivariate approximate polynomials
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Semi-numerical determination of irreducible branches of a reduced space curve
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Approximate multivariate polynomial factorization based on zero-sum relations
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
SIAM Journal on Numerical Analysis
Irreducible decomposition of curves
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Polynomial Factorization 1987-1991
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Geometric completion of differential systems using numeric-symbolic continuation
ACM SIGSAM Bulletin
On approximate irreducibility of polynomials in several variables
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Approximate computation of pseudovarieties
ACM SIGSAM Bulletin
Absolute polynomial factorization in two variables and the knapsack problem
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Approximate factorization of multivariate polynomials via differential equations
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Numerical factorization of multivariate complex polynomials
Theoretical Computer Science - Algebraic and numerical algorithm
Lifting and recombination techniques for absolute factorization
Journal of Complexity
Approximate bivariate factorization: a geometric viewpoint
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Approximate factorization of multivariate polynomials using singular value decomposition
Journal of Symbolic Computation
Symbolic-numeric sparse interpolation of multivariate polynomials
Journal of Symbolic Computation
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
International Journal of Computational Science and Engineering
Exact polynomial factorization by approximate high degree algebraic numbers
Proceedings of the 2009 conference on Symbolic numeric computation
Extracting numerical factors of multivariate polynomials from taylor expansions
Proceedings of the 2009 conference on Symbolic numeric computation
Finding exact minimal polynomial by approximations
Proceedings of the 2009 conference on Symbolic numeric computation
From an approximate to an exact absolute polynomial factorization
Journal of Symbolic Computation
Polynomial homotopies on multicore workstations
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Computing curves bounding trigonometric planar maps: symbolic and hybrid methods
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
Hi-index | 0.00 |
In this paper, we propose a new semi-numerical algorithmic method for factoring multivariate polynomials absolutely. It is based on algebraic and geometric properties after reduction to the bivariate case in a generic system of coordinates. The method combines 4 tools: zero-sum relations at triplets of points, partial information on monodromy action, Newton interpolation on a structured grid, and a homotopy method. The algorithm relies on a probabilistic approach and uses numerical computations to propose a candidate factorization (with probability almost one) which is later validated.