DOCSLIB.ORG

Faster Integer Multiplication

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Faster Integer Multiplication Faster Integer Multiplication Martin F¨urer∗ Department of Computer Science and Engineering Pennsylvania State University [email protected] April 22, 2007 Abstract polynomials, multiplication of the values, fol- lowed by interpolation. The classical method For more than 35 years, the fastest known of Karatsuba and Ofman [KO62] can be viewed method for integer multiplication has been the as selecting the values of linear forms at (0, 1), Sch¨onhage-Strassen algorithm running in time (1, 0), and (1, 1) to achieve time T (n) = O(nlg 3). O(n log n log log n). Under certain restrictive Toom [Too63] evaluates at small consecutive in- conditions there is a corresponding Ω(n log n) teger values to improve the time to T (n) = lower bound. The prevailing conjecture has al- O(n1+). Finally Sch¨onhage and Strassen [SS71] ways been that the complexity of an optimal al- use the usual fast Fourier transform (FFT) gorithm is Θ(n log n). We present a major step (i.e., evaluation and interpolation at 2mth roots towards closing the gap from above by presenting of unity) to compute integer products in time O(log∗ n) an algorithm running in time n log n 2 . O(n log n log log n). They conjecture the opti- The main result is for boolean circuits as well mal upper bound (for a yet unknown algorithm) as for multitape Turing machines, but it has to be O(n log n), but their result has remained consequences to other models of computation as unchallenged. well. Sch¨onhage and Strassen [SS71] really propose two distinct methods. The first uses numeri- 1 Introduction cal approximation to complex arithmetic, and reduces multiplication of length n to that of All known methods for integer multiplication length O(log n). The complexity of this method (except the trivial school method) are based on is slightly higher. It is only proposed as a one some version of the Chinese remainder theo- level approach. Even with the next level of mul- rem. Sch¨onhage [Sch66] computes modulo num- tiplications done by a trivial algorithm, it is al- k bers of the form 2 + 1. Most methods can ready very fast. The second method employs be interpreted as schemes for the evaluation of arithmetic in rings of integers modulo numbers 2m ∗This work is supported in part by the Penn State of the form Fm = 2 + 1 (Fermat numbers), Grove Award and reduces the length of the factors from n to 1 √ O( n). This second method is used recursively graph (butterfly graph) can be composed of two with O(log log n) nested calls. In the ring ZFm of levels, one containing K copies of a J-point FFT integers modulo Fm, the integer 2 is a particu- graph, and the other containing J copies of a K- larly convenient root of unity for the FFT com- point FFT graph. Clearly N = JK could be putation, because all multiplications with this factored differently into N = J 0K0 and the same root of unity are just modified cyclic shifts. N-point FFT graph could be viewed as being On the other hand, the first method has composed of J 0-point and K0-point FFT graphs. the advantage of the significant length reduc- The astonishing fact is that this is just true for tion from n to O(log n). If this method is ap- the FFT graph and not for the FFT computa- plied recursively, it results in a running time of tion. Every way of (recursively) partitioning N ∗ order n log n log log n . 2O(log n), because dur- produces another FFT algorithm. Multiplica- ing the kth of the O(log∗ n) recursion lev- tions with other powers of ω appear when an- els, the amount of work increases by a factor other recursive decomposition is used. of O(log log ... log n) (with the log iterated k It seems that this fact has been mainly unno- times). Note that, for their second method, ticed except for its use some time ago [F¨ur89]in Sch¨onhage and Strassen have succeeded with the an earlier attempt to obtain a faster integer mul- difficult task of keeping the work of each level ba- tiplication algorithm. In that paper, the follow- sically constant, avoiding a factor of logO(1) n = ing result has been shown. If there is an integer 2O(log log n) instead of O(log log n). k > 0 such that for every m, there is a Fermat Our novel use of the FFT allows us to combine prime in the sequence Fm+1,Fm+2,...,F2m+k , the main advantages of both methods. The re- then multiplication of binary integers of length ∗ duction is from length n to length O(log n), and n can be done in time n log n 2O(log n). Hence, still most multiplications with roots of unity are the Fermat primes could be extremely sparse and just cyclic shifts. Unfortunately, we are not able would still be sufficient for a fast integer multi- to avoid the geometric increase over the log∗ n plication algorithm. Nevertheless, this paper is levels. not so exciting, because it is well known that Relative to the conjectured optimal time the number of Fermat primes is conjectured to of Θ(n log n), the first Sch¨onhage and be finite. Strassen method had an overhead factor of It has long become standard to view the FFT ∗ log log n . 2O(log n), representing a doubly as an iterative process (see e.g., [SS71, AHU74]). exponential decrease compared to previous Even though the description of the algorithm methods. Their second method with an gets more complicated, it results in less computa- overhead of O(log log n) constitutes another tional overhead. A vector of coefficients at level polynomial improvement. Our new method 0 is transformed level by level, until we reach ∗ reduces the overhead to 2O(log n), and thus the Fourier transformed vector at level lg N. represents a more than multiple exponential The operations at each level are additions, sub- improvement of the overhead factor. tractions, and multiplications with powers of ω. We use a new divide-and-conquer approach to They are done as if the N-point FFT were re- the N-point FFT, where N is a power of 2. It is cursively decomposed into N/2-point FFT’s fol- well known and obvious that the JK-point FFT lowed by 2-point FFT’s. The current author has 2 seen Sch¨onhage present the other natural recur- unconditional corresponding lower bound. Still, sive decomposition into 2-point FFT’s followed long ago there have been some remarkable at- by N/2-point FFT’s. It results in another dis- tempts. In the algebraic model, Morgenstern tribution of the powers of ω, even though each [Mor73] has shown that every N-point Fourier power of ω appears as a coefficient in both it- transform done by just using linear combinations erative methods with the same frequency. But αa + βb with |α| + |β| ≤ c for inputs or previ- other decompositions produce completely differ- ously computed values a and b requires at least ent frequencies. The standard fast algorithm (n lg n)/(2 lg c) operations. Under different as- design principle, divide-and-conquer, calls for a sumptions on the computation graph, Papadim- balanced partition, but in this case it is not at itriou [Pap79] and Pan [Pan86] have shown lower all obvious that this will provide any benefit. bounds of Ω(n log n) for the FFT. Both are for A balanced√ approach uses two stages of the interesting case of n being a power of 2. roughly N-point FFT’s. This allows an im- Cook and Anderaa [CA69] have developed a provement, because it turns out that “odd” pow- method for proving non-linear lower bounds for ers of ω are then very seldom. This key observa- on-line computations of integer products and re- tion alone is not sufficiently powerful, to obtain a lated functions. Based on this method, Pater- better asymptotic running time, because usually√ son, Fischer and Meyer [PFM74] have improved 1, −1, i, −i and to a lesser extent ±(1±i)/ 2 are the lower bound for on-line integer multiplica- the only powers of ω that are easier to handle. tion to Ω(n log n). Naturally, one would like to We will achieve the desired speed-up by work- see unconditional lower bounds, as the on-line ing over a ring with many “easy” powers of ω. requirement is a very severe restriction. On-line Hence, the new faster integer multiplication al- means that starting with the least significant bit, gorithm is based on two key ideas. the kth bit of the product is written before the k + 1st bit of the factors are read. • An unconventional FFT algorithm is used Besides showing that our algorithm is more with the property that most occurring roots efficient in terms of circuit complexity and Tur- of unity are of low order. ing machine time, one could reasonably ask how • The computation is done over a ring with well it performs in terms of more practical com- very simple multiplications with many low plexity measures. Well, first of all, it is worth- order roots of unity. while pointing out that all currently competitive algorithms are nicely structured, and for such The question remains whether the optimal run- algorithms, a Turing machine model with an al- ning time for integer multiplication is indeed of phabet size of 2w (where w is the computer word ∗ the form n log n 2O(log n).
Load more

Recommended publications
  • Computation of 2700 Billion Decimal Digits of Pi Using a Desktop Computer
    Computation of 2700 billion decimal digits of Pi using a Desktop Computer Fabrice Bellard Feb 11, 2010 (4th revision) This article describes some of the methods used to get the world record of the computation of the digits of π digits using an inexpensive desktop computer. 1 Notations We assume that numbers are represented in base B with B = 264. A digit in base B is called a limb. M(n) is the time needed to multiply n limb numbers. We assume that M(Cn) is approximately CM(n), which means M(n) is mostly linear, which is the case when handling very large numbers with the Sch¨onhage-Strassen multiplication [5]. log(n) means the natural logarithm of n. log2(n) is log(n)/ log(2). SI and binary prefixes are used (i.e. 1 TB = 1012 bytes, 1 GiB = 230 bytes). 2 Evaluation of the Chudnovsky series 2.1 Introduction The digits of π were computed using the Chudnovsky series [10] ∞ 1 X (−1)n(6n)!(A + Bn) = 12 π (n!)3(3n)!C3n+3/2 n=0 with A = 13591409 B = 545140134 C = 640320 . It was evaluated with the binary splitting algorithm. The asymptotic running time is O(M(n) log(n)2) for a n limb result. It is worst than the asymptotic running time of the Arithmetic-Geometric Mean algorithms of O(M(n) log(n)) but it has better locality and many improvements can reduce its constant factor. Let S be defined as n2 n X Y pk S(n1, n2) = an . qk n=n1+1 k=n1+1 1 We define the auxiliary integers n Y2 P (n1, n2) = pk k=n1+1 n Y2 Q(n1, n2) = qk k=n1+1 T (n1, n2) = S(n1, n2)Q(n1, n2).
    [Show full text]
  • Course Notes 1 1.1 Algorithms: Arithmetic
    CS 125 Course Notes 1 Fall 2016 Welcome to CS 125, a course on algorithms and computational complexity. First, what do these terms means? An algorithm is a recipe or a well-defined procedure for performing a calculation, or in general, for transform- ing some input into a desired output. In this course we will ask a number of basic questions about algorithms: • Does the algorithm halt? • Is it correct? That is, does the algorithm’s output always satisfy the input to output specification that we desire? • Is it efficient? Efficiency could be measured in more than one way. For example, what is the running time of the algorithm? What is its memory consumption? Meanwhile, computational complexity theory focuses on classification of problems according to the com- putational resources they require (time, memory, randomness, parallelism, etc.) in various computational models. Computational complexity theory asks questions such as • Is the class of problems that can be solved time-efficiently with a deterministic algorithm exactly the same as the class that can be solved time-efficiently with a randomized algorithm? • For a given class of problems, is there a “complete” problem for the class such that solving that one problem efficiently implies solving all problems in the class efficiently? • Can every problem with a time-efficient algorithmic solution also be solved with extremely little additional memory (beyond the memory required to store the problem input)? 1.1 Algorithms: arithmetic Some algorithms very familiar to us all are those those for adding and multiplying integers. We all know the grade school algorithm for addition from kindergarten: write the two numbers on top of each other, then add digits right 1-1 1-2 1 7 8 × 2 1 3 5 3 4 1 7 8 +3 5 6 3 7 914 Figure 1.1: Grade school multiplication.
    [Show full text]
  • A Scalable System-On-A-Chip Architecture for Prime Number Validation
    A SCALABLE SYSTEM-ON-A-CHIP ARCHITECTURE FOR PRIME NUMBER VALIDATION Ray C.C. Cheung and Ashley Brown Department of Computing, Imperial College London, United Kingdom Abstract This paper presents a scalable SoC architecture for prime number validation which targets reconfigurable hardware This paper presents a scalable SoC architecture for prime such as FPGAs. In particular, users are allowed to se- number validation which targets reconfigurable hardware. lect predefined scalable or non-scalable modular opera- The primality test is crucial for security systems, especially tors for their designs [4]. Our main contributions in- for most public-key schemes. The Rabin-Miller Strong clude: (1) Parallel designs for Montgomery modular arith- Pseudoprime Test has been mapped into hardware, which metic operations (Section 3). (2) A scalable design method makes use of a circuit for computing Montgomery modu- for mapping the Rabin-Miller Strong Pseudoprime Test lar exponentiation to further speed up the validation and to into hardware (Section 4). (3) An architecture of RAM- reduce the hardware cost. A design generator has been de- based Radix-2 Scalable Montgomery multiplier (Section veloped to generate a variety of scalable and non-scalable 4). (4) A design generator for producing hardware prime Montgomery multipliers based on user-defined parameters. number validators based on user-specified parameters (Sec- The performance and resource usage of our designs, im- tion 5). (5) Implementation of the proposed hardware ar- plemented in Xilinx reconfigurable devices, have been ex- chitectures in FPGAs, with an evaluation of its effective- plored using the embedded PowerPC processor and the soft ness compared with different size and speed tradeoffs (Sec- MicroBlaze processor.
    [Show full text]
  • Version 0.5.1 of 5 March 2010
    Modern Computer Arithmetic Richard P. Brent and Paul Zimmermann Version 0.5.1 of 5 March 2010 iii Copyright c 2003-2010 Richard P. Brent and Paul Zimmermann ° This electronic version is distributed under the terms and conditions of the Creative Commons license “Attribution-Noncommercial-No Derivative Works 3.0”. You are free to copy, distribute and transmit this book under the following conditions: Attribution. You must attribute the work in the manner specified by the • author or licensor (but not in any way that suggests that they endorse you or your use of the work). Noncommercial. You may not use this work for commercial purposes. • No Derivative Works. You may not alter, transform, or build upon this • work. For any reuse or distribution, you must make clear to others the license terms of this work. The best way to do this is with a link to the web page below. Any of the above conditions can be waived if you get permission from the copyright holder. Nothing in this license impairs or restricts the author’s moral rights. For more information about the license, visit http://creativecommons.org/licenses/by-nc-nd/3.0/ Contents Preface page ix Acknowledgements xi Notation xiii 1 Integer Arithmetic 1 1.1 Representation and Notations 1 1.2 Addition and Subtraction 2 1.3 Multiplication 3 1.3.1 Naive Multiplication 4 1.3.2 Karatsuba’s Algorithm 5 1.3.3 Toom-Cook Multiplication 6 1.3.4 Use of the Fast Fourier Transform (FFT) 8 1.3.5 Unbalanced Multiplication 8 1.3.6 Squaring 11 1.3.7 Multiplication by a Constant 13 1.4 Division 14 1.4.1 Naive
    [Show full text]
  • 1 Multiplication
    CS 140 Class Notes 1 1 Multiplication Consider two unsigned binary numb ers X and Y . Wewanttomultiply these numb ers. The basic algorithm is similar to the one used in multiplying the numb ers on p encil and pap er. The main op erations involved are shift and add. Recall that the `p encil-and-pap er' algorithm is inecient in that each pro duct term obtained bymultiplying each bit of the multiplier to the multiplicand has to b e saved till all such pro duct terms are obtained. In machine implementations, it is desirable to add all such pro duct terms to form the partial product. Also, instead of shifting the pro duct terms to the left, the partial pro duct is shifted to the right b efore the addition takes place. In other words, if P is the partial pro duct i after i steps and if Y is the multiplicand and X is the multiplier, then P P + x Y i i j and 1 P P 2 i+1 i and the pro cess rep eats. Note that the multiplication of signed magnitude numb ers require a straight forward extension of the unsigned case. The magnitude part of the pro duct can b e computed just as in the unsigned magnitude case. The sign p of the pro duct P is computed from the signs of X and Y as 0 p x y 0 0 0 1.1 Two's complement Multiplication - Rob ertson's Algorithm Consider the case that we want to multiply two 8 bit numb ers X = x x :::x and Y = y y :::y .
    [Show full text]
  • Divide-And-Conquer Algorithms
    Chapter 2 Divide-and-conquer algorithms The divide-and-conquer strategy solves a problem by: 1. Breaking it into subproblems that are themselves smaller instances of the same type of problem 2. Recursively solving these subproblems 3. Appropriately combining their answers The real work is done piecemeal, in three different places: in the partitioning of problems into subproblems; at the very tail end of the recursion, when the subproblems are so small that they are solved outright; and in the gluing together of partial answers. These are held together and coordinated by the algorithm's core recursive structure. As an introductory example, we'll see how this technique yields a new algorithm for multi- plying numbers, one that is much more efficient than the method we all learned in elementary school! 2.1 Multiplication The mathematician Carl Friedrich Gauss (1777–1855) once noticed that although the product of two complex numbers (a + bi)(c + di) = ac bd + (bc + ad)i − seems to involve four real-number multiplications, it can in fact be done with just three: ac, bd, and (a + b)(c + d), since bc + ad = (a + b)(c + d) ac bd: − − In our big-O way of thinking, reducing the number of multiplications from four to three seems wasted ingenuity. But this modest improvement becomes very significant when applied recur- sively. 55 56 Algorithms Let's move away from complex numbers and see how this helps with regular multiplica- tion. Suppose x and y are two n-bit integers, and assume for convenience that n is a power of 2 (the more general case is hardly any different).
    [Show full text]
  • Fast Integer Multiplication Using Modular Arithmetic ∗
    Fast Integer Multiplication Using Modular Arithmetic ∗ Anindya Dey Piyush P Kurur,z Computer Science Division Dept. of Computer Science and Engineering University of California at Berkeley Indian Institute of Technology Kanpur Berkeley, CA 94720, USA Kanpur, UP, India, 208016 [email protected] [email protected] Chandan Saha Ramprasad Saptharishix Dept. of Computer Science and Engineering Chennai Mathematical Institute Indian Institute of Technology Kanpur Plot H1, SIPCOT IT Park Kanpur, UP, India, 208016 Padur PO, Siruseri, India, 603103 [email protected] [email protected] Abstract ∗ We give an N · log N · 2O(log N) time algorithm to multiply two N-bit integers that uses modular arithmetic for intermediate computations instead of arithmetic over complex numbers as in F¨urer's algorithm, which also has the same and so far the best known complexity. The previous best algorithm using modular arithmetic (by Sch¨onhageand Strassen) has complexity O(N · log N · log log N). The advantage of using modular arithmetic as opposed to complex number arithmetic is that we can completely evade the task of bounding the truncation error due to finite approximations of complex numbers, which makes the analysis relatively simple. Our algorithm is based upon F¨urer'salgorithm, but uses FFT over multivariate polynomials along with an estimate of the least prime in an arithmetic progression to achieve this improvement in the modular setting. It can also be viewed as a p-adic version of F¨urer'salgorithm. 1 Introduction Computing the product of two N-bit integers is nearly a ubiquitous operation in algorithm design.
    [Show full text]
  • Chap03: Arithmetic for Computers
    CHAPTER 3 Arithmetic for Computers 3.1 Introduction 178 3.2 Addition and Subtraction 178 3.3 Multiplication 183 3.4 Division 189 3.5 Floating Point 196 3.6 Parallelism and Computer Arithmetic: Subword Parallelism 222 3.7 Real Stuff: x86 Streaming SIMD Extensions and Advanced Vector Extensions 224 3.8 Going Faster: Subword Parallelism and Matrix Multiply 225 3.9 Fallacies and Pitfalls 229 3.10 Concluding Remarks 232 3.11 Historical Perspective and Further Reading 236 3.12 Exercises 237 CMPS290 Class Notes (Chap03) Page 1 / 20 by Kuo-pao Yang 3.1 Introduction 178 Operations on integers o Addition and subtraction o Multiplication and division o Dealing with overflow Floating-point real numbers o Representation and operations x 3.2 Addition and Subtraction 178 Example: 7 + 6 Binary Addition o Figure 3.1 shows the sums and carries. The carries are shown in parentheses, with the arrows showing how they are passed. FIGURE 3.1 Binary addition, showing carries from right to left. The rightmost bit adds 1 to 0, resulting in the sum of this bit being 1 and the carry out from this bit being 0. Hence, the operation for the second digit to the right is 0 1 1 1 1. This generates a 0 for this sum bit and a carry out of 1. The third digit is the sum of 1 1 1 1 1, resulting in a carry out of 1 and a sum bit of 1. The fourth bit is 1 1 0 1 0, yielding a 1 sum and no carry.
    [Show full text]
  • Multi-Digit Multiplication Using the Standard Algorithm 5.NBT.B.5 Fluency Mini-Assessment by Student Achievement Partners
    Multi-Digit Multiplication Using the Standard Algorithm 5.NBT.B.5 Fluency Mini-Assessment by Student Achievement Partners OVERVIEW This mini-assessment is designed to illustrate the standard 5.NBT.B.5, which sets an expectation for fluently multiplying multi-digit whole numbers using the standard algorithm. This mini-assessment is designed for teachers to use either in the classroom, for self-learning, or in professional development settings to: • Evaluate students’ progress toward the skills described by 5.NBT.B.5 in order to prepare to teach this material or to check for fluency near the end of the grade; • Gain a better understanding of assessing fluency with multiplying multi-digit whole numbers; • Illustrate CCR-aligned assessment problems; • Illustrate best practices for writing tasks that allow access for all learners; and • Support mathematical language acquisition by offering specific guidance. MAKING THE SHIFTS This mini-assessment attends to focus as it addresses multi-digit multiplication, which is at the heart of the grade 5 standards and a key component of the Major Work of the Grade.1 It addresses coherence across grades because multiplying multi-digit whole numbers sets the stage for multi-digit division and multi-digit decimal operations. Standard 5.NBT.B.5 and this mini-assessment target procedural skill and fluency, one of the three elements of rigor. A CLOSER LOOK Standard 5.NBT.B.5 is a prime example of how “[t]he Standards are not written at uniform grain size” (K–8 Publishers’ Criteria, 5.NBT.B.5. Fluently multiply Spring 2013, p. 18). One cannot address this standard in a single multi-digit whole numbers day, lesson, or unit.
    [Show full text]
  • On-Line Algorithms for Division and Multiplication
    IEEE TRANSACTIONS ON COMPUTERS, VOL. C-26, NO. 7, JULY 1977 681 On-Line Algorithms for Division and Multiplication KISHOR S. TRIVEDI AND MILO0 D. ERCEGOVAC Abstract-In this paper, on-line algorithms for division and subtraction operations always satisfy this property. multiplication are developed. It is assumed that the operands as well Atrubin [3] has developed a right-to-left on-line algorithm as the result flow through the arithmetic unit in a digit-by-digit, most significant digit first fashion. The use of a redundant digit set, for multiplication. In this paper, we will retain our earlier at least for the digits of the result, is required. definition of the on-line property where all of the operands as well as the result digits flow through the arithmetic unit Index Terms-Computer arithmetic, division, multiplication, in a left-to-right digit-by-digit fashion. on-line algorithms, pipelining, radix, redundancy. Consider an mr-digit radix r number N = 1=l nir-i. In the conventional representation, each digit ni can take any I. INTRODUCTION value from the digit set 0,1, - - ,r - 1}. Such representa- IN THIS PAPER we consider problems of divi- tions, which allow only r values in the digit set, are non- sion and multiplication in a computational environ- redundant since there is a unique representation for each ment in which all basic arithmetic algorithms satisfy the (representable) number. By contrast, number systems that "on-line" property. This implies that to generate the jth allow more than r values in the digit set are redundant.
    [Show full text]
  • A Rigorous Extension of the Schönhage-Strassen Integer
    A Rigorous Extension of the Sch¨onhage-Strassen Integer Multiplication Algorithm Using Complex Interval Arithmetic∗ Raazesh Sainudiin Laboratory for Mathematical Statistical Experiments & Department of Mathematics and Statistics University of Canterbury, Private Bag 4800 Christchurch 8041, New Zealand [email protected] Thomas Steinke Harvard School of Engineering and Applied Sciences Maxwell Dworkin, Room 138, 33 Oxford Street Cambridge, MA 02138, USA [email protected] Abstract Multiplication of n-digit integers by long multiplication requires O(n2) operations and can be time-consuming. A. Sch¨onhage and V. Strassen published an algorithm in 1970 that is capable of performing the task with only O(n log(n)) arithmetic operations over C; naturally, finite-precision approximations to C are used and rounding errors need to be accounted for. Overall, using variable-precision fixed-point numbers, this results in an O(n(log(n))2+ε)-time algorithm. However, to make this algorithm more efficient and practical we need to make use of hardware-based floating- point numbers. How do we deal with rounding errors? and how do we determine the limits of the fixed-precision hardware? Our solution is to use interval arithmetic to guarantee the correctness of results and deter- mine the hardware’s limits. We examine the feasibility of this approach and are able to report that 75,000-digit base-256 integers can be han- dled using double-precision containment sets. This demonstrates that our approach has practical potential; however, at this stage, our implemen- tation does not yet compete with commercial ones, but we are able to demonstrate the feasibility of this technique.
    [Show full text]
  • Fast Division of Large Integers --- a Comparison of Algorithms
    NADA Numerisk analys och datalogi Department of Numerical Analysis Kungl Tekniska Högskolan and Computer Science 100 44 STOCKHOLM Royal Institute of Technology SE-100 44 Stockholm, SWEDEN Fast Division of Large Integers A Comparison of Algorithms Karl Hasselström [email protected] TRITA-InsertNumberHere Master’s Thesis in Computer Science (20 credits) at the School of Computer Science and Engineering, Royal Institute of Technology, February 2003 Supervisor at Nada was Stefan Nilsson Examiner was Johan Håstad Abstract I have investigated, theoretically and experimentally, under what circumstances Newton division (inversion of the divisor with Newton’s method, followed by di- vision with Barrett’s method) is the fastest algorithm for integer division. The competition mainly consists of a recursive algorithm by Burnikel and Ziegler. For divisions where the dividend has twice as many bits as the divisor, Newton division is asymptotically fastest if multiplication of two n-bit integers can be done in time O(nc) for c<1.297, which is the case in both theory and practice. My implementation of Newton division (using subroutines from GMP, the GNU Mul- tiple Precision Arithmetic Library) is faster than Burnikel and Ziegler’s recursive algorithm (a part of GMP) for divisors larger than about five million bits (one and a half million decimal digits), on a standard PC. Snabb division av stora heltal En jämförelse av algoritmer Sammanfattning Jag har undersökt, ur både teoretiskt och praktiskt perspektiv, under vilka omstän- digheter Newtondivision (invertering av nämnaren med Newtons metod, följd av division med Barretts metod) är den snabbaste algoritmen för heltalsdivision. Den främsta konkurrenten är en rekursiv algoritm av Burnikel och Ziegler.
    [Show full text]