-based univariate algebraic kernel, which provides certified real-root isolation of univariate polynomials with integer coefficients and standard functionalities such as basic arithmetic operations, greatest common divisor (gcd) and square-free factorization, as well as comparison and sign evaluations of real algebraic numbers.
We compare our kernel with other comparable kernels, demonstrating the efficiency of our approach. Our experiments are performed on large data sets including polynomials of high degree (up to 2 000) and with very large coefficients (up to 25 000 bits per coefficient).
We also address the problem of computing arrangements of
-monotone polynomial curves. We apply our kernel to this problem and demonstrate its efficiency compared to previous solutions available in
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten