Content deleted Content added
→Original research: overlooked "Digit-by-digit calculation" |
|||
Line 189:
:I would not mind if someone took out the section [[Methods of computing square roots#High/low method]]. I refrain from taking it out myself for fear of inciting an edit-war (with its author) unnecessarily. Similarly for [[Methods of computing square roots#A two-variable iterative method]] and some of the others. However, I think we need to keep at least the sections: Rough estimation, Babylonian method, Digit-by-digit calculation, Iterative methods for reciprocal square roots, and Negative or complex square. [[User:JRSpriggs|JRSpriggs]] ([[User talk:JRSpriggs|talk]]) 06:01, 16 January 2012 (UTC)
::First, regarding the High/low method, I don't know who was the original author. However, I think it's safe to replace it with the bisection method, which has known convergence properties. With the high/low method, in principle you need to calculate ''nine'' intermediate points (e.g. 4.41, 4.42, 4.43, 4.44, 4.45, 4.46, 4.47, 4.48, 4.49) to determine which ones are too high/too low, and which ones are "close". With the bisection method, you just evaluate one intermediate point and there is a clear rule for discarding one interval. [[User:Isheden|Isheden]] ([[User talk:Isheden|talk]]) 11:29, 16 January 2012 (UTC)
| |||