Calibrating a model with jumps or stochastic volatility needs call prices at many strikes, and in such models the density of the log price often has no closed form while its characteristic function does. A call price can still be computed from that function, but only after the payoff is damped, and only when the stock has enough finite moments. This lesson derives the Fourier transform of the damped call from the payoff, states the moment condition that makes it valid, inverts it to a price, and separates the errors that come from cutting off and sampling the frequency integral.
Key terms
Characteristic function
Definition Let be the log of the terminal price under a pricing measure . Its characteristic function is
In this lesson denotes this function, not the normal density, which does not appear. It exists for every real because , it is uniformly continuous, and
It determines the distribution of . If , then has a bounded continuous density, given by
This condition is sufficient, not necessary, and without it need not have a density at all. Pricing with complex arguments of needs more, namely finite moments of , which the next card describes.
In plain words The characteristic function records the whole distribution as an average of points on the unit circle, one average for each frequency . Many models of the stock give it in closed form even when the density has no simple formula, and that is why prices are computed from it.
Example In the constructed Black-Scholes benchmark of this lesson , , and . Under the log price is normal with mean and variance , so
Its modulus has integral , and the inversion formula at returns the peak of the normal density. A stock that ends at one of two fixed prices behaves differently. The modulus of its characteristic function oscillates without decaying, so it is not integrable and there is no density, yet call prices on that stock are finite and the method of the next cards still applies.
Moment strip
Definition For the terminal price under let
By Hölder’s inequality is an interval. It contains , and it contains when , which holds when the discounted price is a -martingale. For complex one has , so the expectation converges absolutely exactly on the horizontal strip of complex with , and it is analytic in the interior of that strip. The interval , or this strip, is called the moment strip. The Fourier transform of the damped call in the next card evaluates at , where , so it needs . In GBM the interval is all of , because
for every real . With jumps or stochastic volatility can be bounded, and in models such as Heston its upper end depends on the parameters and on the maturity, an analysis that is model specific and not covered here. A closed-form expression for often continues analytically beyond the strip, where it no longer equals the expectation.
In plain words Giving the frequency an imaginary part multiplies the rotating factor by a power of the stock price, so the expectation exists only if that power of the stock has a finite mean. Heavy right tails make high powers infinite, and the moment strip records which powers are safe.
Example For the benchmark, damping with needs , which is finite. For contrast, take a constructed model with , where under the variable has the Laplace density with . Then
for , and the expectation is infinite otherwise, so and the admissible damping parameters are . The closed form of the characteristic function of has poles at , on the edges of the strip, and it stays finite beyond them although the expectation does not.
Damping parameter
Definition Let be the log strike and the time 0 price of a European call, with a constant rate and any dividend yield already contained in the law of . The undamped price is not integrable in , because as . A damping parameter defines the damped call and its Fourier transform, for real ,
If , then
and the denominator equals . To derive it, fix a value of . The payoff vanishes for , so
where the terms at vanish because . Taking and using gives the formula. Exchanging the expectation and the integral is justified by Fubini’s theorem, because the absolute value of the integrand has integral
which at is , with finite expectation by assumption. The same computation shows that is integrable, with .
In plain words The call price tends to a positive constant as the strike falls to 0, so its integral over all log strikes diverges. Multiplying by pushes the low-strike side to zero, and the cost of this is the requirement that the stock have a finite moment of order .
Example For the benchmark with , the value at zero frequency is , the integral of over all log strikes. Two values that catch convention errors in an implementation are and , here 100. Evaluating at instead of brings in the moment of order in place of , and with the grid of the next card the inversion then returns about for an at-the-money call worth about 7.965567.
Fourier inversion
Definition With the convention , the Fourier inversion theorem states that if and are both integrable, then
at every where is continuous. It applies to the damped call when and . The function is integrable by the previous card and continuous because . Its Fourier transform is integrable because and the denominator has modulus at least . Since is real, , the two half-lines combine, and for every strike with
Every admissible gives the same price, and the choice changes only how well the integral behaves numerically.
In plain words Once the damped call has an integrable Fourier transform, inverting it gives back the damped call, and dividing by gives the price. Only the positive frequencies are needed, because the Fourier transform of a real function takes conjugate values at opposite frequencies.
Example For the benchmark at and , the trapezoid rule on with step , which is 4096 intervals, returns 7.965567455. The Black-Scholes formula with and gives , and the two agree to about . The agreement confirms the signs and the damping convention at this strike and on this grid.
Fast Fourier transform
Definition The discrete Fourier transform of complex numbers is
Evaluated term by term, the sums take about operations. A fast Fourier transform, or FFT, is an algorithm that computes all of them, exactly up to rounding, in a number of operations proportional to , for example when is a power of 2. To use it for the inversion integral, sample frequencies and log strikes with
Then , so with quadrature weights the approximations
are times the real parts of the discrete Fourier transform of , and one FFT returns all prices. It is a fast way to evaluate the sum and nothing more. It removes neither the error of cutting the integral off at nor the error of sampling it with step . For a fixed , a finer frequency step forces a coarser strike step, and the strike grid spans a log strike window of width . Implementation choices such as Simpson weights and the placement of the strike grid are beyond this lesson.
In plain words The FFT is a fast way to evaluate a whole grid of Fourier sums. It pays for its speed with a rigid grid, on which the frequency step and the strike step are tied together.
Example With and , as in the benchmark quadrature, the matching log strike step is
so neighboring strikes differ by the factor , about 6.3 percent, inside a log strike window of width . That is very coarse in strike and far wider than any useful strike range, so an FFT grid for strikes near the money would use a coarser frequency step, as in the first question below. The benchmark price itself came from direct quadrature at one strike.
Truncation error and aliasing
Definition A computed price replaces the integral over by a finite sum with step up to a cutoff , and each replacement has its own error. The truncation error is the omitted tail
and the bounds of the inversion card give the simple estimate
which ignores any decay of and is often far from sharp. Aliasing is the error of sampling the frequencies. Let . When the shifted copies for have a uniformly convergent sum, the Poisson summation formula, together with the absolute summability of the samples of that follows from the bounds of the inversion card, shows that the trapezoid approximation of the price, summed over all of with half weight at , equals . So the sampled price is plus the images
which are prices at strikes a factor away, wrapped back onto . On an FFT grid the period equals the width of the strike window. The images with are deep in-the-money calls, each about , so a small or a coarse step makes them large. The images with carry the factor and depend on how fast call prices fall at high strikes. Rounding adds a third error far from the money, where a tiny price comes out of an integrand of much larger size. Agreement at one strike is a check at that strike only, and varying the cutoff, the step and the strike window separately shows which error dominates.
In plain words Cutting the integral off loses the high frequencies, and sampling it on a grid makes the computed damped price repeat in log strike with period , so prices at faraway strikes leak in. A larger cutoff and a finer step fix different errors, and a faster algorithm fixes neither.
Example In the benchmark, with step 0.001, cutting off at gives 7.986597, an error of about 0.021030, while and leave errors of about and . The simple bound at is about 3.431, far above the actual error, because it ignores the factor in . For aliasing keep and but take , so that . The trapezoid sum returns 7.973623, an error of about 0.008056. The image is times the price of a call with strike , which is about 99.813, so it contributes
and the other images add less than . With the benchmark step the period is about 251.3 and the images are far below rounding. Rounding shows at far strikes instead. On the benchmark grid the call with strike 400, worth about , comes out with an absolute error of only about but a relative error of about , because its damped price is about times the value of the integrand at zero frequency.
Check yourself
- A pricing grid for the benchmark uses points with frequency step and , with the log strikes centered at . Find the log strike step, the frequency cutoff, the range of strikes covered, the spacing of neighboring strikes near 100, and the size of the leading aliasing image.
Show the answer
The grid relation gives , and the frequencies run up to . The window has width , so centered at it covers strikes from about to about . Near the strike 100, neighboring strikes differ by the factor , about 0.615 in currency units. The period is , so the image is about
below rounding for a price near 8. On this grid the FFT reproduces the benchmark price 7.965567 at the strike 100 to rounding.
- In the benchmark with and cutoff 400, a colleague lowers the damping to because the integrand becomes smaller, and the trapezoid sum now returns about 12.474067 instead of 7.965567. Explain the error of about 4.5085 and how to remove it.
Show the answer
The period is , and the images with are now damped only by . They are deep in-the-money calls worth almost exactly , so together they contribute
which accounts for the whole error, since the images with are calls with strikes above 50,000 and are negligible. Lowering made aliasing worse. With and the same step the error is about 0.008056, and with and step 0.5 it is about 0.187093. Removing it needs a smaller step, a larger inside the moment strip, or both, and the result should be checked against a benchmark at several strikes.
- The Laplace model of the moment strip card with , and is priced with by evaluating the closed form at , where makes . The inversion integral returns 0 up to rounding. What went wrong, and which damping parameters are admissible?
Show the answer
The method needs , and here lies outside the moment strip , so that moment is infinite. The heavy right tail makes proportional to for , so grows like , is not integrable and has no Fourier transform. The closed form is finite beyond its pole at , but there it is not an expectation, and moving the line of integration across the pole changes the integral by a residue term. The output, 0 at the strike 100 and about at the strike 60, is not a call price. Admissible parameters satisfy . With the inversion returns 25.041345, which matches the direct integral of the payoff against the Laplace density. With , that integral is