A numerical absolute primality test for bivariate polynomials
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Modern computer algebra
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
A geometric-numeric algorithm for absolute factorization of multivariate polynomials
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Numerical algebraic geometry and symbolic computation
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Absolute polynomial factorization in two variables and the knapsack problem
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Parametrization of approximate algebraic curves by lines
Theoretical Computer Science - Algebraic and numerical algorithm
Numerical factorization of multivariate complex polynomials
Theoretical Computer Science - Algebraic and numerical algorithm
Parametrization of approximate algebraic surfaces by lines
Computer Aided Geometric Design
Distance bounds of ε-points on hypersurfaces
Theoretical Computer Science
Lifting and recombination techniques for absolute factorization
Journal of Complexity
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
Parametrization of approximate algebraic surfaces by lines
Computer Aided Geometric Design
Approximate parametrization of plane algebraic curves by linear systems of curves
Computer Aided Geometric Design
Computation of the topology of real algebraic space curves
Journal of Symbolic Computation
From an approximate to an exact absolute polynomial factorization
Journal of Symbolic Computation
Rational Hausdorff divisors: A new approach to the approximate parametrization of curves
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
In this paper, we propose a fast semi-numerical algorithm for computing all irreducible branches of a curve in Cτ defined by polynomials with rational coefficients, we also treat the case of a non-reduced curve. Our algorithm does not requires a prior projection procedure which, in many cases, is difficult to achieve. It relies on a fine analysis of a generic "fat" section of the curve. Our approach could be applied to more general situations, it generalizes our previous study on absolute factorization of polynomials.