Homotopies exploiting Newton polytopes for solving sparse polynomial systems
SIAM Journal on Numerical Analysis
A polyhedral method for solving sparse polynomial systems
Mathematics of Computation
Complexity and real computation
Complexity and real computation
Computational methods in commutative algebra and algebraic geometry
Computational methods in commutative algebra and algebraic geometry
Some lower bounds for the complexity of continuation methods
Journal of Complexity
Multivariate polynomials, duality, and structured matrices
Journal of Complexity
Solving projective complete intersection faster
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Finding a cluster of zeros of univariate polynomials
Journal of Complexity
Polynomial root finding using iterated Eigenvalue computation
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
A multivariate Weierstrass iterative rootfinder
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Complexity results for triangular sets
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Stable border bases for ideals of points
Journal of Symbolic Computation
Nearest multivariate system with given root multiplicities
Journal of Symbolic Computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Efficient computation of algebraic immunity for algebraic and fast algebraic attacks
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Extended companion matrix for approximate GCD
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Gröbner-free normal forms for Boolean polynomials
Journal of Symbolic Computation
Hi-index | 0.00 |
We propose an algebraic framework to represent zero-dimensional algebraic systems. In this framework, we give new interpolation formulæ. We use this good representation of the algebraic systems to develop a generalization of Weierstrass's method to the multivariate systems. This method allows us to approximate simultaneously all the roots of an algebraic system. We obtain an effective iteration function with a quadratic convergence in a neighbourhood of the solutions. We use this Weierstrass iteration function in a continuation method to obtain a global method. Experiments are exposed to underline the efficiency of the approach.