2018 | OriginalPaper | Buchkapitel
Implementation of a Near-Optimal Complex Root Clustering Algorithm
verfasst von : Rémi Imbach, Victor Y. Pan, Chee Yap
Erschienen in: Mathematical Software – ICMS 2018
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Ccluster
, a software for computing natural \(\varepsilon \)-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
.