Skip to content
QuantMax
QuantMax
  • Overview
  • Curriculum
    • FLUMental maths and numerical fluency
    • MKTMarkets and products
    • CSData structures and algorithms
    • PYPython and data for quants
    • NUMNumerical methods
      • 1Root finding

        • Root finding, with implied volatility as the worked case
      • 2Interpolation

        • Interpolation: splines, Runge and building a curve
      • 3Numerical integration

        • Numerical integration: trapezoid, Simpson and Gauss
      • 4Linear algebra numerics

        • Linear algebra in practice: factorisations and conditioning
      • 5ODE and PDE solvers

        • ODE and PDE solvers: finite differences and stability
      • 6Floating point

        • Floating point: IEEE 754, cancellation and why prices are integers
    • SYSSystems and low latency

Practise

  • Question bank
  • Mental arithmetic
  • Market simulator
  • Arbitrage trees
  • Horse racing
  • Bid book
  • Screening tests
  • Mock papers

Reference

  • Formula reference
  • Search

Your record

  • Review queue
  • Progress
  • Leaderboard
  • Profile
  • Invite friends
AccountSend feedback
  1. Curriculum
  2. /Quantitative development
  3. /Numerical methods
  4. /Root finding

Root finding, with implied volatility as the worked case

NUM · Chapter 1·12 min read·Asked at Optiver, IMC, Citadel Securities, Akuna

After this lesson you should be able to

  • Compare bisection, Newton and the secant method on convergence and robustness.
  • Invert Black–Scholes for a volatility and say why vega makes it easy.
  • Name the cases where Newton fails and what production code does instead.

Every options system solves the same root-finding problem millions of times a day: given a price, find the volatility. It is the canonical numerical-methods interview question at a market-making firm, because the answer has to be both fast and impossible to break.

AspectBisectionNewton–RaphsonSecant
NeedsA bracket where the sign changesThe derivativeTwo starting points
ConvergenceLinear — one bit per stepQuadraticAbout 1.6 (superlinear)
Can it fail?Never, given a valid bracketYes — can diverge or cycleYes, but less dramatically
Cost per stepOne function evaluationFunction and derivativeOne function evaluation
Table 1.1 · The three methods. Bisection halves the interval every step, so it needs about 50 iterations for double precision from a unit bracket. Newton typically needs four.

Equation 1.2

Newton–Raphson

Step to where the tangent line crosses zero. Near a simple root the error squares each iteration, which is why the digit count roughly doubles per step.

xn+1=xn−f(xn)f′(xn)x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}xn+1​=xn​−f′(xn​)f(xn​)​
f′(xn)f'(x_n)f′(xn​)
The derivative — for implied volatility this is vega, which you already compute.

Derivation 1.3

Inverting Black–Scholes

The problem is to find the σ\sigmaσ that reproduces an observed price.

  1. f(σ)=CBS(σ)−Cmarketf(\sigma) = C_{\text{BS}}(\sigma) - C_{\text{market}}f(σ)=CBS​(σ)−Cmarket​

    Define the residual whose root we want.

  2. f′(σ)=V=S0T φ(d1)>0f'(\sigma) = \mathcal{V} = S_0\sqrt{T}\,\varphi(d_1) > 0f′(σ)=V=S0​T​φ(d1​)>0

    The derivative is vega, which is strictly positive for a live option.

  3. σn+1=σn−CBS(σn)−CmarketV(σn)\sigma_{n+1} = \sigma_n - \frac{C_{\text{BS}}(\sigma_n) - C_{\text{market}}}{\mathcal{V}(\sigma_n)}σn+1​=σn​−V(σn​)CBS​(σn​)−Cmarket​​
a unique root, since CBS is strictly increasing in σ\text{a unique root, since } C_{\text{BS}} \text{ is strictly increasing in } \sigmaa unique root, since CBS​ is strictly increasing in σ
03600.250.5BisectionNewtonIterationError
Figure 1.4 · Quadratic against linear convergence. Newton squares the error each step, so the number of correct digits doubles: five iterations take you from one digit to sixteen. Bisection halves it, gaining a third of a digit a step — reliable, never fast, and the right fallback when the derivative misbehaves.

Why this particular inversion is well behaved. Price is strictly increasing in volatility, so the root is unique and bracketing is trivial: zero volatility gives the intrinsic value, and a large volatility gives nearly the spot. Vega is available for free from the same computation that produced the price. And near the money the relationship is close to linear, so the first Newton step from a sensible guess is usually within a fraction of a volatility point.

The rest of this lesson is in Premium

You have read the opening. 11 more sections follow, including 4 worked examples and 3 quick checks.

Start the free 7-day trialSign in

Nothing is charged for 7 days, and you can cancel before then. Or read Complexity: reading it off, and deriving it in full, free.

Interpolation: splines, Runge and building a curve →
On this page
  • The three methods
  • Newton–Raphson
  • Inverting Black–Scholes
  • Quadratic against linear convergence

QuantMax · 141 lessons · 1342 questions · c5c0caa

  • Premium
  • Arbitrage trees
  • Horse racing
  • Invite friends
  • Account
  • About QuantMax

Firm names identify publicly reported question patterns and nothing more. QuantMax is not affiliated with, endorsed by, or recruiting for any firm named in the curriculum. Everything you do in lessons and the question bank is kept to your account.