NEW EXTENDED ALGORITHM USING LEAST ABSOLUTE REMAINDER
Abstract
In this note we obtain new extended algorithm, which is based on ideaof least absolute remainder [1], [15]. Numerical experiments demonstrate its superiorspeed in comparison to Knuth classical algorithm for the same task for regular numbers.By this research we enrich, diversify and extend the theory and practice of so-calledEuclidean algorithms [24]. Our results can be used also for a new algorithm for findingmodular multiplicative inverse [22].
Refbacks
- There are currently no refbacks.