AppliedMultiple choice
Why is Brent’s method a common default root-finder in numerical libraries?
- AIt needs derivatives, which makes it the fastest method when they are cheap
- BIt keeps a bracket like bisection but takes fast secant steps
- CIt converges quadratically from any starting point
- DIt finds all roots of a function at once
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.
Learn the method
Reported in interviews at
More numerical methods questions
- Newton’s method for x²−2 = 0 starts at x₀ = 1. What is x₂, to four decimals?Foundation
- Apply one Newton step to f(x) = x³−2x−5 starting from x₀ = 2. What is x₁?Foundation
- Newton’s method for a square root, part 1 of 3Foundation
- Starting from the bracket [0,5], how many bisection steps are needed to locate…Applied
- An at-the-money one-year call on a $100 stock trades at $8, with rates at zero.Applied
- Newton’s method converges quadratically and you start with one correct digit.Applied