Implementation of a Near-Optimal Complex Root Clustering Algorithm

Rémi Imbach, Victor Y. Pan, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationMathematical Software – ICMS 2018 - 6th International Conference, Proceedings
EditorsJames H. Davenport, George Labahn, Josef Urban, Manuel Kauers
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783319964171
StatePublished - 2018
Event6th International Conference on Mathematical Software, ICMS 2018 - South Bend, United States
Duration: Jul 24 2018Jul 27 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10931 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other6th International Conference on Mathematical Software, ICMS 2018
Country/TerritoryUnited States
CitySouth Bend

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Implementation of a Near-Optimal Complex Root Clustering Algorithm'. Together they form a unique fingerprint.

Cite this