HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Clustering Complex Zeros of Triangular Systems of Polynomials

Rémi Imbach 1 Marc Pouget 2 Chee Yap 1
2 GAMBLE - Geometric Algorithms and Models Beyond the Linear and Euclidean realm
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : This paper gives the first algorithm for finding a set of natural $\epsilon$-clusters of complex zeros of a regular triangular system of polynomials within a given polybox in C^n , for any given $\epsilon>0$. Our algorithm is based on a recent near-optimal algorithm of Becker et al (2016) for clustering the complex roots of a univariate polynomial where the coefficients are represented by number oracles. Our algorithm is based on recursive subdivision. It is local, numeric, certified and handles solutions with multiplicity. Our implementation is compared to with well-known homotopy solvers on various triangular systems. Our solver always gives correct answers, is often faster than the homotopy solvers that often give correct answers, and sometimes faster than the ones that give sometimes correct results.
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download

Contributor : Marc Pouget Connect in order to contact the contributor
Submitted on : Tuesday, June 23, 2020 - 10:12:35 AM
Last modification on : Friday, February 4, 2022 - 9:00:13 AM
Long-term archiving on: : Thursday, September 24, 2020 - 3:39:32 PM


Files produced by the author(s)




Rémi Imbach, Marc Pouget, Chee Yap. Clustering Complex Zeros of Triangular Systems of Polynomials. Mathematics in Computer Science, Springer, 2020, ⟨10.1007/s11786-020-00482-0⟩. ⟨hal-02878388⟩



Record views


Files downloads