33 citations · 59 across the 4 of their papers we have counts for
5 papers
Computing Real Roots of Real Polynomials ... and now For Real!
Alexander Kobel, Fabrice Rouillier, Michael Sagraloff
Very recent work introduces an asymptotically fast subdivision algorithm, denoted ANewDsc, for isolating the real roots of a univariate real polynomial. The method combines Descart…
On the Complexity of Computing with Planar Algebraic Curves
Alexander Kobel, Michael Sagraloff
In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials , $g \in…
Fast Approximate Polynomial Multipoint Evaluation and Applications
Alexander Kobel, Michael Sagraloff
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial of degree at complex-valued points…
Exact Symbolic-Numeric Computation of Planar Algebraic Curves
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel +1
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of th…
Arrangement Computation for Planar Algebraic Curves
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel +1
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposit…