fast inverse and division

Paul Zimmermann Paul.Zimmermann at
Fri Oct 14 09:31:00 CEST 2005

Here is a followup to the "optimizing 1/x" thread from last month.
I have written a document describing a first algorithm that computes
(an approximation of) 1/x in O(M(n)), more precisely in 3M(n) in the FFT range.
See <>.
(This is work in progress. More algorithms will be added later.)

Paul Zimmermann

More information about the gmp-discuss mailing list