DocumentCode :
1650302
Title :
Efficient Divide-and-Conquer Multiprecision Integer Division
Author :
Hart, William Bruce
Author_Institution :
Dept. of Math., Tech. Univ. Kaiserslautern, Kaiserslautern, Germany
fYear :
2015
Firstpage :
90
Lastpage :
95
Abstract :
We present a new divide-and-conquer algorithm for mid-range multiprecision integer division which is typically 20-25% faster than the recent algorithms of Moller and Granlund implemented in the GNU Multi Precision (GMP) library.
Keywords :
divide and conquer methods; mathematics computing; precision engineering; software libraries; GMP library; GNU MultiPrecision library; divide-and-conquer multiprecision integer division; mid-range multiprecision integer division; Approximation algorithms; Benchmark testing; Complexity theory; Digital arithmetic; Libraries; Timing; bignum arithmetic; divide-and-conquer; division;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Arithmetic (ARITH), 2015 IEEE 22nd Symposium on
Conference_Location :
Lyon
ISSN :
1063-6889
Print_ISBN :
978-1-4799-8663-7
Type :
conf
DOI :
10.1109/ARITH.2015.19
Filename :
7203801
Link To Document :
بازگشت