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.
Cite
CITATION STYLE
Imbach, R., Pan, V. Y., & Yap, C. (2018). Implementation of a Near-Optimal Complex Root Clustering Algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10931 LNCS, pp. 235–244). Springer Verlag. https://doi.org/10.1007/978-3-319-96418-8_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
