By using the Newton-Raphson iterative formula, establish the formula x_{i+1} = (1/3)(2x_i + N/x_i²) to find the cube root of N.
Use this formula, if established, to find the cube root of 63 correct to four decimal places with the initial approximation 3·9.
10 marks · directive: Establish and compute
The core of a good answer
Applying Newton-Raphson to f(x) = x³ − N gives x_{i+1} = (1/3)(2x_i + N/x_i²); starting from 3.9 the iterates are 3.980671, 3.979058, 3.979057, so ∛63 = 3.9791 correct to four decimal places.
An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work
What the question asks
Two tasks: derive the cube root iteration as a special case of the Newton-Raphson formula, then run it from x₀ = 3.9 until two successive iterates agree to four decimal places. The examiner expects the derivation, a short table of iterates and a stopping argument.
Answer outline
Introduction
Newton-Raphson for a root of f(x) = 0 is x_{i+1} = x_i − f(x_i)/f′(x_i). The cube root of N is the positive root of f(x) = x³ − N. Given N = 63, x₀ = 3.9.
Step 1: Derive the formula
- f(x) = x³ − N, f′(x) = 3x²
- x_{i+1} = x_i − (x_i³ − N)/(3x_i²)
- = (3x_i³ − x_i³ + N)/(3x_i²) = (2x_i³ + N)/(3x_i²)
- = (1/3)(2x_i + N/x_i²), as required.
Step 2: First iteration (N = 63, x₀ = 3.9)
- x₀² = 15.21, 63/15.21 = 4.142012
- x₁ = (1/3)(7.8 + 4.142012) = 11.942012/3 = 3.980671
Step 3: Further iterations
- x₁² = 15.845739, 63/x₁² = 3.975832 (to 6 d.p.)
- x₂ = (1/3)(2 × 3.980671 + 3.975832) = 3.979058
- x₃ = (1/3)(2x₂ + 63/x₂²) = 3.979057
- x₄ = 3.979057 (no change to 6 d.p.)
Step 4: Stopping and checking
- x₂ and x₃ agree to five decimal places, so ∛63 = 3.9791 to four decimal places.
- Check: 3.9791³ = 63.0020 and 3.9790³ = 62.9973, so 63 lies between them, nearer 3.9791 (the root is 3.979057).
- Convergence is quadratic: the error falls from about 1.6 × 10⁻³ after x₁ to about 6.5 × 10⁻⁷ after x₂.
Conclusion
The cube root of 63 correct to four decimal places is 3.9791 (more precisely 3.979057). All iterates were recomputed in Python; the value agrees with 63^(1/3) = 3.97905720789.
Examples and data to cite
- The same idea gives the square root iteration x_{i+1} = (1/2)(x_i + N/x_i) from f(x) = x² − N (Heron's method).
- In general the k-th root iteration is x_{i+1} = (1/k)[(k − 1)x_i + N/x_i^(k − 1)].
Facts to remember
- Newton-Raphson formula: x_{i+1} = x_i − f(x_i)/f′(x_i), derived from the tangent line at x_i.
- Newton-Raphson converges quadratically to a simple root when the start is close enough: e_{i+1} ≈ [f″(α)/(2f′(α))] e_i².
- For f(x) = x³ − N with N > 0 the iteration converges to ∛N from any positive starting value.
- 4³ = 64, so a start of 3.9 (or 4) is natural for ∛63.