Numerical methods
Starting from the bracket [0,5], how many bisection steps are needed to locate…
Starting from the bracket , how many bisection steps are needed to locate a root to within ?
Answer with a number. Fractions, powers and expressions like 23/6 or C(52,5) are read correctly in practice.
Try it
Next free question: An at-the-money one-year call on a $100 stock trades at $8, with rates at zero.
Show the answer and worked solution
Answer
Bisection halves the bracket every step, so after steps the interval is and you need , that is , so 23 steps. The method gains exactly one bit of accuracy per iteration regardless of the function, which is its great virtue: guaranteed convergence at a known, unimpressive rate. Newton gains roughly double the digits per step but can diverge, which is why production solvers run Newton inside a maintained bracket and fall back to bisection when a step leaves it.
Worked solution
- Formula
- Substitute
- Solve
- Answer
Sanity check. Newton would take four or five from a decent guess, which is why bisection is the fallback rather than the algorithm.
Takeaway: Bisection gains one bit per step.
Report an issue with this question
Learn the method
Of the kind reported at
More numerical methods questions
- 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 a square root, part 2 of 3Applied · Premium
- Your implied-volatility solver uses pure Newton–Raphson. Which input breaks it?Advanced · Premium
- What is the order of convergence of the secant method, to three decimal places?Advanced · Premium
- Newton’s method for a square root, part 3 of 3Advanced · Premium
- Newton’s method for x²−2 = 0 starts at x₀ = 1. What is x₂, to four decimals?Foundation · Premium