Zassenhaus' algorithm has been taken from the book of von zur Gathen and
Gerhard (Algorithm 15.19). The bound B
is there given explicitly in a form that is equivalent to the one in
dup_zz_zassenhaus ("the old bound"). It seems that it is necessary for the
validity of the algorithm. There are better bounds for estimating the size
of the roots but they are not suitable for Zassenhaus' algorithm.
Kalevi Suominen
On Monday, May 11, 2020 at 10:38:39 AM UTC+3, Lagamura Chess wrote:
>
> Hello to everybody,
>
> Assisting my professor we managed to make an improvement on the
> *dup_zz_mignotte_bound
> *which has been just pulled a few days ago.
> Although, as i was trying to compare the impact in *f**actor() *i
> observed that in *dup_zz_zassenhaus* instead of calling*
> dup_zz_mignotte_bound *the old bound
> has been used locally, making mignotte useless practically. So i create
> another PR #19280 <https://github.com/sympy/sympy/pull/19280> changing
> that, but a weird issue occurred in an inequality as Kalevi Suominen
> pointed out.
>
> Can anyone give a look in that?
>
> thanks a lot,
> Stelios
>
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sympy+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sympy/395254e8-63e3-4206-8f70-7762704c30ef%40googlegroups.com.
