Numerical methods
Why is Brent’s method a common default root-finder in numerical libraries?
AppliedMultiple choice
- 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.
Report an issue with this question
Learn the method
Of the kind reported at
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
- Iterating xₖ₊₁ = cos xₖ converges to the fixed point x* ≈ 0.739.Applied · Premium
- 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