Implementation of a Near-Optimal Complex Root Clustering Algorithm - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2018

Implementation of a Near-Optimal Complex Root Clustering Algorithm

Résumé

We describe Ccluster, a software for computing natural ε-clusters of complex roots in a given box of the complex plane. This algorithm from Becker et al. (2016) is near-optimal when applied to the benchmark problem of isolating all complex roots of an integer polynomial. It is one of the first implementations of a near-optimal algorithm for complex roots. We describe some low level techniques for speeding up the algorithm. Its performance is compared with the well-known MPSolve library and Maple.

Dates et versions

hal-02077920 , version 1 (24-03-2019)

Identifiants

Citer

Rémi Imbach, Victor Y. Pan, Chee Yap. Implementation of a Near-Optimal Complex Root Clustering Algorithm. Mathematical Software -- ICMS 2018, pp.235-244, 2018, ⟨10.1007/978-3-319-96418-8_28⟩. ⟨hal-02077920⟩
43 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More