Quiz: Numerical Differentiation and Bump-Reval

Quick Quiz

1. Central differences have truncation error O(h2)O(h^2) while forward differences have O(h)O(h). For the same bump size h=0.01σh = 0.01\sigma, approximately how many times more accurate are central differences for vega computation?

2. The optimal step size for central differences balances truncation and round-off error. For a function ff with f/f1|f'''|/|f| \approx 1 and machine epsilon εmach1016\varepsilon_{\text{mach}} \approx 10^{-16}, the optimal step size hh^* is approximately:

3. The complex-step method estimates f(x)Im[f(x+ih)]/hf'(x) \approx \text{Im}[f(x+ih)]/h for small real hh. Why can hh be taken as small as 1010010^{-100} without loss of accuracy?

4. The complex-step method works for Monte Carlo pricers that use indicator functions of the form 1ST>K\mathbf{1}_{S_T > K}.

5. Adjoint Algorithmic Differentiation (AAD) computes the gradient of a pricing function with respect to nn inputs. What is its computational cost relative to a single function evaluation?

6. For a vega ladder over a 5×75 \times 7 implied vol surface (5 maturities, 7 strikes), how many full repricings are needed using central differences?