A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder, the result of division. Some are applied by hand, while others are employed by digital circuit designs and software.
Division algorithms fall into two main categories: slow division and fast division. Slow division algorithms produce one digit of the final quotient per iteration. Examples of slow division include restoring, non-performing restoring, non-restoring, and SRT division. Fast division methods start with a close approximation to the final quotient and produce twice as many digits of the final quotient on each iteration. Newton-Raphson and Goldschmidt fall into this category.
Discussion will refer to the form where
- Q = Quotient
- N = Numerator (dividend)
- D = Denominator (divisor).
Read more about Division Algorithm: Division By Repeated Subtraction, Long Division, Integer Division (unsigned) With Remainder, Slow Division Methods, Large Integer Methods, Division By A Constant, Rounding Error
Other articles related to "algorithm, division algorithm":
... He was the first Chinese mathematician to calculate π=3.1416 with his π algorithm ... He used Liu Hui's pi-algorithm applied to a 12288-gon and obtained a value of pi to 7 accurate decimal places (between 3.1415926 and 3.1415927), which would remain the most accurate ... formulas and methods for linear, matrix algebra, algorithm for calculating the value of π, formula for the volume of the sphere ...
... Round-off error can be introduced by division operations due to limited precision ... Further information Floating point ...
... so it is not possible to construct a true division algorithm but an approximate multivariate division algorithm can be constructed ... fm by the following algorithm ...
Famous quotes containing the word division:
“The glory of the farmer is that, in the division of labors, it is his part to create. All trade rests at last on his primitive activity.”
—Ralph Waldo Emerson (18031882)