Numerical methods
Newton’s method for a square root, part 3 of 3
AdvancedMultiple choice
Newton’s method for a square root · Part 3 of 3
You compute with Newton’s method on , which gives the iteration , starting from .
You reuse the solver on , whose root at 3 is a double root, starting from . How does it converge?
- AQuadratically, as for the square root
- BLinearly: the error halves on every step
- CIt diverges, because is zero at the root
- DIt lands on the root in one step, because Newton’s method is exact on any quadratic polynomial
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
More numerical methods questions
- Starting from the bracket [0,5], how many bisection steps are needed to locate…Applied · Free solution
- An at-the-money one-year call on a $100 stock trades at $8, with rates at zero.Applied · Free solution
- Newton’s method for x²−2 = 0 starts at x₀ = 1. What is x₂, to four decimals?Foundation · Premium
- Apply one Newton step to f(x) = x³−2x−5 starting from x₀ = 2. What is x₁?Foundation · Premium
- Newton’s method converges quadratically and you start with one correct digit.Applied · Premium
- Iterating xₖ₊₁ = cos xₖ converges to the fixed point x* ≈ 0.739.Applied · Premium