, Numerically solving polynomial systems with Bertini, vol.25, 2013.
A fast recursive orthogonalization scheme for the macaulay matrix, Journal of Computational and Applied Mathematics, vol.267, pp.20-32, 2014. ,
, Solving polynomial equations: foundations, algorithms, and applications (Algorithms and Computation in Mathematics), 2005.
A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pp.133-140, 1997. ,
DOI : 10.1145/258726.258767
, Ideals, varieties, and algorithms, vol.3, 1992.
Using algebraic geometry, vol.185, 2006. ,
Back to the roots: Polynomial system solving, linear algebra, systems theory, IFAC Proceedings Volumes, vol.45, pp.1203-1208, 2012. ,
DOI : 10.3182/20120711-3-be-2027.00217
IntroductionàIntroduction`Introductionà la résolution des systèmes polynomiaux, of Mathématiques et Applications, vol.59, 2007. ,
Matrices in Elimination Theory, Journal of Symbolic Computation, vol.28, issue.1-2, pp.3-44, 1999. ,
FGb: A Library for Computing Groebner Bases, Mathematical Software-ICMS 2010, vol.6327, 2010. ,
polymake and lattice polytopes, 21st International Conference on Formal Power Series and Algebraic Combinatorics, pp.491-502, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01185382
Multivariate polynomial system solving using intersections of eigenspaces, Journal of symbolic computation, vol.32, issue.5, pp.513-531, 2001. ,
A New Criterion for Normal Form Algorithms, Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp.430-443, 1999. ,
Pythagore's dilemma, symbolic-numeric computation, and the border basis method, SymbolicNumeric Computation, pp.223-243, 2007. ,
Subdivision methods for solving polynomial equations, Journal of Symbolic Computation, vol.44, issue.3, pp.292-306, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00070350
Generalized normal forms and polynomial system solving, Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation, pp.253-260, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00070537
Stable normal forms for polynomial system solving, Theoretical Computer Science, vol.409, issue.2, pp.229-240, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00343103
Computing the common zeros of two bivariate functions via bézout resultants, Numerische Mathematik, vol.129, issue.1, pp.181-209, 2015. ,
Numerical solution of bivariate and polyanalytic polynomial systems, SIAM J. Num. Anal, vol.52, pp.1551-1572, 2014. ,
Matrix eigenproblems are at the heart of polynomial system solving, ACM SIGSAM Bulletin, vol.30, issue.4, pp.22-25, 1996. ,
Solving Systems of Polynomial Equations. No. 97 in CBMS Regional Conferences, Amer. Math. Soc. Szeg?, 1967. ,
Solving polynomial systems via truncated normal forms, SIAM Journal on Matrix Analysis and Applications, vol.39, issue.3, pp.1421-1447, 2018. ,
A stabilized normal form algorithm for generic systems of polynomial equations, Journal of Computational and Applied Mathematics, vol.342, pp.119-132, 2018. ,
Approximation theory and approximation practice, SIAM J. Scientific Computing, vol.35, 1997. ,
Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation, ACM Transactions on Mathematical Software (TOMS), vol.25, issue.2, pp.251-276, 1999. ,