I am still waiting for your response to commit 7257, which cannot pass
Travis CI.

In the attached file we have generated 16 random polys of degree 17 and
computed the upper and lower bounds of each one of them using:

a. dup_roots_upper/lower_bound, the method implemented in sympy,
b. dup_roots_upper/lower_bound_M, our modification of (a), and
c. posubLMQ/poslbdLMQ, the different implementation of LMQ used in giacpy

Simple comparison reveals the poor performance of (a) and the reason (b)
will not pass Travis CI. If you want us to improve sympy you will have to
change the tests. The intervals CANNOT be asserted.  On the other hand if
you are happy with the way things are, please say so and we will NOT waste
any more of our time.


On Sat, Mar 15, 2014 at 1:26 AM, Aaron Meurer <notifications@github.com>wrote:

> In sympy/polys/rootisolation.py:
>
> >
> > -       Reference:
> > -       ==========
> > -       Alkiviadis G. Akritas: "Linear and Quadratic Complexity Bounds on the
> > +    Reference:
> > +    ==========
> > +    Alkiviadis G. Akritas: "Linear and Quadratic Complexity Bounds on the
>
> It looks like you messed up the indentation here.
>
> --
> Reply to this email directly or view it on GitHub<https://github.com/sympy/sympy/pull/7257/files#r10631088>
> .
>



-- 
All the best,

Alkis