Next:
Classical division with remainder
Up:
Foundations of Computer Algebra: From
Previous:
Foundations of Computer Algebra: From
Division with remainder using Newton iteration
We combine in this section the results about the fast polynomial multiplication based on the FFT with Newton iteration in order to provide a fast polynomial division with remainder.
Subsections
Classical division with remainder
The quotient as a modular inverse
Modular inverses using Newton iteration
Division with remainder using Newton iteration
Fast Extended Euclidean Algorithm
Next:
Classical division with remainder
Up:
Foundations of Computer Algebra: From
Previous:
Foundations of Computer Algebra: From
Marc Moreno Maza
2008-01-07