@inproceedings{ddb59c37bf11454f90e968d81dd91b95,
title = "Implementation of a Near-Optimal Complex Root Clustering Algorithm",
abstract = "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.",
author = "R{\'e}mi Imbach and Pan, {Victor Y.} and Chee Yap",
note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 6th International Conference on Mathematical Software, ICMS 2018 ; Conference date: 24-07-2018 Through 27-07-2018",
year = "2018",
doi = "10.1007/978-3-319-96418-8_28",
language = "English (US)",
isbn = "9783319964171",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "235--244",
editor = "Davenport, {James H.} and George Labahn and Josef Urban and Manuel Kauers",
booktitle = "Mathematical Software – ICMS 2018 - 6th International Conference, Proceedings",
}