Message70719
| Author |
mark.dickinson |
| Recipients |
fredrikj, mark.dickinson |
| Date |
2008年08月04日.20:38:20 |
| SpamBayes Score |
0.014522266 |
| Marked as misclassified |
No |
| Message-id |
<1217882304.13.0.925742767644.issue3451@psf.upfronthosting.co.za> |
| In-reply-to |
| Content |
Here's a pure Python implementation of the Burnikel and Ziegler recursive
division algorithm. I've no idea whether it's faster or slower than
Newton, but it might be worth a look. It depends heavily on bit
operations, which ought to be much faster when coded in C. (Some of the
shifts would be completely unnecessary---replaced by changes in indexing
instead.)
The original paper describing the algorithm is available here:
http://cr.yp.to/bib/1998/burnikel.ps |
|
History
|
|---|
| Date |
User |
Action |
Args |
| 2008年08月04日 20:38:24 | mark.dickinson | set | recipients:
+ mark.dickinson, fredrikj |
| 2008年08月04日 20:38:24 | mark.dickinson | set | messageid: <1217882304.13.0.925742767644.issue3451@psf.upfronthosting.co.za> |
| 2008年08月04日 20:38:23 | mark.dickinson | link | issue3451 messages |
| 2008年08月04日 20:38:22 | mark.dickinson | create |
|