Tighter ‘uniform bounds for Black–Scholes implied volatility’ and the applications to root-finding

Abstract

Using the option delta systematically, we derive tighter lower and upper bounds of the Black–Scholes implied volatility than those in Tehranchi (2016) [11]. As an application, we propose a Newton–Raphson algorithm on the log price that converges rapidly for all price ranges when using a new lower bound as an initial guess. Our new algorithm is a better alternative to the widely used naive Newton–Raphson algorithm, whose convergence is slow for extreme option prices.