Talk:Division algorithm
| This is the talk page for discussing improvements to the Division algorithm article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Archives: 1Auto-archiving period: 2 years  |
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||
Summary and Comparison
editIt would be nice if the article contained a concise comparison of the division methods: are some methods "better" than some others, in some respect? Currently there is very little that would help see how better and better division methods were developed, and what is the state of the art currently. At its present state the article is just a long list of different division algorithms. — Preceding unsigned comment added by 87.92.32.62 (talk) 11:32, 28 April 2019 (UTC)
- When working with fixed-length numbers (floating point as well as fixed-point arithmetic), the best algorithm strongly depends of the used hardware and software technology. It is thus difficult to give more details in an encyclopedic article. However, when working with arbitrary-length, the final answer has been given, and I have added it to the lead: division and multiplication have the same computational complexity (up to a constant factor), and a faster division algorithm relies on a faster multiplication algorithm. Some more details would be welcome, but we must wait that a competent editor will be willing to improve the article. D.Lazard (talk) 13:40, 28 April 2019 (UTC)
Galley division
editThe article must include details of galley division. —Jencie Nasino (talk) 02:20, 16 August 2019 (UTC)
- I put a link to that article in the "See also" section. There is no need to describe the method in detail again here. And since it is no longer used by anyone, it is notable only for historical reasons. JRSpriggs (talk) 04:58, 17 August 2019 (UTC)
"Anderson Earle Goldschmidt Powers algorithm" listed at Redirects for discussion
editAn editor has asked for a discussion to address the redirect Anderson Earle Goldschmidt Powers algorithm. Please participate in the redirect discussion if you wish to do so. D.Lazard (talk) 14:30, 24 October 2019 (UTC)
Recurrence relation at top of "Slow Division Methods"
editWhere is this relation coming from? I have seen R[i+1] = R[i] + q[i] * D * B^i, but not this one. — Preceding unsigned comment added by Mikecondron (talk • contribs) 19:07, 4 February 2020 (UTC)