#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2011

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff
- Theor. Comput. Sci.
- 2013

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 the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition. From a high-level perspective, the overall method splits into two main… (More)

- Alexander Kobel, Michael Sagraloff
- J. Complexity
- 2015

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials f , g ∈ Z[x, y] and an arbitrary polynomial h ∈ Z[x, y], each of total degree less than n and with integer coefficients of absolute value less than 2 , we show that each of the following… (More)

- Alexander Kobel, Michael Sagraloff
- ArXiv
- 2013

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial F ∈ C[x] of degree n at n complex-valued points can be done with Õ(n) exact field operations in C, where Õ(·) means that we omit polylogarithmic factors. We complement this result by an analysis of approximate multipoint evaluation of F to a… (More)

We present a new <i>certified</i> and <i>complete</i> algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in terms of a cylindrical algebraic decomposition of the plane. Compared to previous approaches, we… (More)

- Alexander Kobel, Fabrice Rouillier, Michael Sagraloff
- ISSAC
- 2016

Very recent work introduces an asymptotically fast subdivision algorithm, denoted ANewDsc, for isolating the real roots of a univariate real polynomial. The method combines Descartes? Rule of Signs to test intervals for the existence of roots, Newton iteration to speed up convergence against clusters of roots, and approximate computation to decrease the… (More)

- Alexander Kobel, Michael Sagraloff
- ArXiv
- 2014

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials f , g ∈ Z[x, y] and an arbitrary polynomial h ∈ Z[x, y], each of total degree less than n and with integer coefficients of absolute value less than 2 , we show that each of the following… (More)

Root isolation of univariate polynomials is one of the fundamental problems in computational algebra. It aims to find disjoint regions on the real line or complex plane, each containing a single root of a given polynomial, such that the union of the regions comprises all roots. For root solving over the field of complex numbers, numerical methods are the de… (More)

- ‹
- 1
- ›