Message276741
> Mark, the code I showed in roots.py is somewhat more accurate and highly significantly faster than the code you just posted.
Okay, fair enough. In that case, we still need a solution for computing rootn(x * 2**e) in the case where x*2**e itself overflows / underflows an IEEE 754 float. |
|
Date |
User |
Action |
Args |
2016-09-16 19:35:30 | mark.dickinson | set | recipients:
+ mark.dickinson, tim.peters, rhettinger, vstinner, ned.deily, steven.daprano, martin.panter, serhiy.storchaka |
2016-09-16 19:35:30 | mark.dickinson | set | messageid: <1474054530.38.0.285493342429.issue27761@psf.upfronthosting.co.za> |
2016-09-16 19:35:30 | mark.dickinson | link | issue27761 messages |
2016-09-16 19:35:30 | mark.dickinson | create | |
|