Question
Newton iteration formula for square root approximation
Original question: 1. Let the method of ADOMT? be given by for calculating . State the iteration formula.
[?]
Expert Verified Solution
Key concept: This is the classic Newton or Babylonian iteration for square roots. The goal is to write the recursive update rule clearly and interpret its purpose in numerical approximation.
Step by step
Recognize the iteration rule
The method shown is an iterative formula for approximating . The update rule is
This formula takes the current estimate and improves it by averaging two values:
- the estimate itself,
- the quotient
That average is what drives the next estimate closer to the true square root.
State the formula in standard form
If the question asks for the iteration formula, the answer is simply
This is often called the Babylonian method or Newton's method for square roots. It is one of the most important numerical algorithms because it converges quickly when the starting guess is reasonable and positive.
Why the formula works
If is too large, then is too small; if is too small, then is too large. Averaging those two quantities balances the error. For positive , the method repeatedly corrects the estimate until it stabilizes near .
Key properties to remember
The method assumes because division by zero is undefined. In practical computation, the starting value should also be positive if the target is a real square root. The iteration is especially efficient because each step roughly doubles the number of correct digits once it is close enough to the answer.
How to present it on homework or a test
If the prompt says "State the iteration formula," do not add extra derivation unless requested. Write the recurrence exactly and, if needed, name the method. A clear response is:
That is the full iteration statement.
Pitfall alert
A common mistake is to swap the roles of and and write , which is not the square-root iteration. Another error is forgetting the factor of , which is essential because the formula is an average. Some students also try to substitute a numerical value for when the question only asks for the iteration rule. If the prompt asks for the formula, keep it symbolic and exact.
Try different conditions
If the same method were written for a fixed number instead of , the iteration would become For example, to approximate , you would use If the task asked for an iteration to solve cube roots instead, the update rule would change completely and would not use this averaging formula. The square-root version is specific to quadratic convergence for problems.
Further reading
Babylonian method, Newton's method, iterative approximation
FAQ
What is the standard iteration formula used for square root approximation?
The standard update rule is x_{n+1} = 1/2 (x_n + a/x_n), where a is the number whose square root is being approximated.
Why does the Babylonian method improve a square root estimate quickly?
It averages an overestimate and an underestimate of the target square root, so the new value moves closer to the true answer and converges very fast when the starting guess is positive.