Content deleted Content added
Lim Wei Quan (talk | contribs) |
|||
Line 222:
::<math>X_{i+1} = X_i(2-DX_i) \,</math>
:and conclude that the complexity of extracting a square-root is only slightly greater than the complexity of division. But division is significantly harder than multiplication since it requires repeated multiplication of the order of the logarithm of the number of digits times. [[User:JRSpriggs|JRSpriggs]] ([[User talk:JRSpriggs|talk]]) 07:16, 12 November 2012 (UTC)
::Not true, because when performing Newton-Raphson approximation, we do not have to use the final desired precision. Instead we can use just enough precision at each iteration, and since the precision roughly doubles on each iteration, the total time complexity is asymptotically bounded by that of the final iteration. Therefore all arithmetic operations that can be reduced by Newton-Raphson approximation to addition and multiplication will have the same time complexity as multiplication. [[User:Lim Wei Quan|Lim Wei Quan]] ([[User talk:Lim Wei Quan|talk]]) 06:50, 13 April 2013 (UTC)
== Vedic Mathematics Claims Need Much Better Sources ==
| |||