This issue tracker has been migrated to GitHub, and is currently read-only.
For more information, see the GitHub FAQs in the Python's Developer Guide.

Author mark.dickinson
Recipients fredrikj, mark.dickinson
Date 2008-08-04.20:38:20
SpamBayes Score 0.014522266
Marked as misclassified No
Message-id <>
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 

The original paper describing the algorithm is available here:
Date User Action Args
2008-08-04 20:38:24mark.dickinsonsetrecipients: + mark.dickinson, fredrikj
2008-08-04 20:38:24mark.dickinsonsetmessageid: <>
2008-08-04 20:38:23mark.dickinsonlinkissue3451 messages
2008-08-04 20:38:22mark.dickinsoncreate