Clustering Complex Zeros of Triangular System of Polynomials - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Clustering Complex Zeros of Triangular System of Polynomials

Résumé

This paper gives the first algorithm for finding a set of natural ε-clusters of complex zeros of a triangular system of polynomials within a given polybox in C^n, for any given ε > 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 numeric, produces guaranteed results and is based on subdivision. We implemented it and compared it with state of the art solvers on various triangular systems, including systems with clusters of solutions or multiple solutions.
Fichier principal
Vignette du fichier
2019-CASC-extAbtract.pdf (243.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01825708 , version 1 (28-06-2018)
hal-01825708 , version 2 (29-03-2019)
hal-01825708 , version 3 (09-12-2019)

Identifiants

Citer

Rémi Imbach, Marc Pouget, Chee Yap. Clustering Complex Zeros of Triangular System of Polynomials. CASC 2019 - 21st International Workshop on Computer Algebra in Scientific Computing, Aug 2019, Moscow, Russia. ⟨hal-01825708v3⟩
133 Consultations
107 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More