Fast parallel absolute irreducibility testing
Journal of Symbolic Computation
Ideal Bases and Primary Decomposition: Case of Two Variables
Journal of Symbolic Computation
Practical determination of the dimension of an algebraic variety
Proceedings of the third conference on Computers and mathematics
Effective Noether irreducibility forms and applications
Selected papers of the 23rd annual ACM symposium on Theory of computing
A numerical absolute primality test for bivariate polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Irreducible decomposition of curves
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
A geometric-numeric algorithm for absolute factorization of multivariate polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On approximate irreducibility of polynomials in several variables
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computer algebra handbook
Numerical algebraic geometry and symbolic computation
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
Approximate factorization of multivariate polynomials using singular value decomposition
Journal of Symbolic Computation
Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
International Journal of Computational Science and Engineering
Extracting numerical factors of multivariate polynomials from taylor expansions
Proceedings of the 2009 conference on Symbolic numeric computation
| Hi-index | 0.00 |
In this paper, we propose a semi-numerical algorithm for computing all irreducible branches of a curve in C3 defined by polynomials with rational coefficients. It is based on some properties appearing after a generic change of coordinate. Using numerical computation, Galois group action and rational approximation, it provides an efficient probabilistic algorithm for medium degrees. Our method generalizes our study on absolute factorization of polynomials ([2, 6]).