![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
ABSTRACT
In this paper, we consider the COS method for pricing European and Bermudan options under the stochastic alpha beta rho (SABR) model. In the COS pricing method, we make use of the characteristic function of the discrete forward process. We observe second-order convergence by using a second-order Taylor scheme in the discretization, or by using Richardson extrapolation in combination with a Euler–Maruyama discretization on the forward process. We also consider backward stochastic differential equations under the SABR model, using the discretized forward process and Fourier-cosine expansion for the occurring expectations. For this purpose, we extend the so-called BCOS method from one to two dimensions.
1. Introduction
Efficient valuation of financial options is an important issue in financial mathematics. In the last few decades, many pricing methods have been introduced, for example, convenient formulas [Citation3,Citation17,Citation19], Monte Carlo methods [Citation5,Citation15,Citation20], finite difference methods [Citation10,Citation18,Citation22], quadrature methods [Citation7] and also Fourier methods [Citation6,Citation12,Citation25,Citation26,Citation28,Citation33]. A variety of option pricing methods is compared in [Citation37], including several Fourier methods. This type of methods, such as the COS method [Citation12,Citation33], is based on the characteristic function (ChF) of the underlying process to determine the option value. However, often no analytic expression for the ChF of the underlying process is available. The authors in [Citation35] use the ChF of the discrete process to price options and to solve backward stochastic differential equations (BSDEs). We extend this so-called BCOS method (BSDE COS method) from one to two dimensions, see also [Citation36], in order to solve BSDEs under the so-called stochastic alpha beta rho (SABR) SDE system. The BCOS method approximates the solutions of BSDEs by iterating backwards in time, so we do not need to simulate the forward process. The theory of BSDEs is described in detail in the literature [Citation4,Citation11,Citation29,Citation30] and relevant applications in mathematical finance are studied in for example [Citation23,Citation34,Citation38]. In this paper, we pay attention especially to the valuation of options with the BCOS method. The basis is formed by using the COS method under SABR dynamics, and we will also explain this. As we will observe, the BCOS method may suffer from the curse of dimensionality, as well as quadrature methods and finite difference methods. Nevertheless, these methods are widely used for two-dimensional models. Therefore, investigation of the two-dimensional BCOS method is of value to acquire a wider diversity in methods.
To obtain rapid convergence, we will employ Richardson extrapolation in combination with the Euler–Maruyama SDE discretization (see also [Citation21]). In particular, we price European and Bermudan options under a two-dimensional model, like the SABR model [Citation17]. Due to the closed-form expression of the implied volatility, the Hagan formula [Citation17], the SABR model is a widely used stochastic local volatility model in the financial world. Many pricing methods for SABR-like models have been presented in the literature, like [Citation2,Citation9,Citation16,Citation18,Citation27], however, many of those methods are mainly accurate for valuing European options with short maturities under the SABR model. In [Citation1] a pricing method is given, which is accurate for options with long maturities, but this method is not applicable for all parameter sets [Citation1]. When we work on the risk neutral measure, we can simply use the COS method, for European and Bermudan options. Under the real-world measure, we encounter a BSDE, where the terminal condition is given by the payoff function.
This paper is organized as follows. In Section 2, we introduce the two-dimensional COS method for pricing European and Bermudan options. We discuss the two-dimensional BCOS method in Section 3. Furthermore, we present several numerical experiments in Section 4. Finally, we conclude in Section 5.
2. The two-dimensional COS method
In this section, we explain the two-dimensional COS method for pricing European and Bermudan options. We assume that the underlying forward stochastic differential equations (FSDEs) can be written in the following general form:
(1)
(1) where
,
,
, the correlation
, and
and
are independent standard Brownian motions on a filtered probability space
. The functions
are assumed to be twice differentiable with respect to
and
. When the corresponding bivariate ChF cannot easily be derived, it is possible to approximate it by the bivariate ChF of the discretized FSDE process. For this discretization, we use the Euler–Maruyama scheme and also the 2.0-weak-Taylor scheme.
We are interested in pricing options under the SABR model [Citation17]. The FSDEs of the SABR model are of the same form as Formula (Equation1(1)
(1) ), that is,
(2)
(2) where
is the forward, for example, the forward swap rate, and
denotes the volatility. Furthermore,
and
are independent standard Brownian motions under the forward measure, exponent
, the volatility of the volatility
and the initial forward f and volatility α are non-negative. The authors in [Citation17] proposed a very convenient formula to calculate the Black implied volatility under the SABR model. This formula, also known as the Hagan formula, may however sometimes lead to arbitrage possibilities for low strikes, as one can observe by examining the corresponding PDF [Citation36]. The Hagan formula is not accurate for pricing options with long maturities [Citation1,Citation18,Citation36].
As no analytic expression for the bivariate ChF of the SABR model is available, it may be difficult to calculate accurate reference values for our purposes. That is why we also consider the Heston modelFootnote1 as a reference model for convergence purposes. The ChF of the Heston model is known, which ensures the availability of accurate reference prices for European and Bermudan options. The FSDEs can be written in the form of Formula (Equation1(1)
(1) ), that is,
(3)
(3) where
denotes the log-asset process and
is the variance. Furthermore,
and
are independent standard Brownian motions, the volatility of the volatility parameter ν and the initial variance a are both non-negative. FSDEs (Equation3
(3)
(3) ) do not obey the Feller condition, so we have to make sure that we choose the computational domain, see Appendix 2, such that the variance process can attain any non-negative value. The Heston model (Equation3
(3)
(3) ) is an affine model, so an analytic formula for its bivariate ChF is known [Citation36]:
(4)
(4) where
(5)
(5)
In Section 2.1, we give the Taylor schemes and the necessary formulas to price European options with the COS method. Also, we detail the procedure for valuing Bermudan options in this section. We provide an approach to price multiple European options under the SABR model in one computation in Section 2.2. We describe the use of Richardson extrapolation in Section 2.3. The computational complexity of the proposed method is discussed in Section 2.4.
2.1. Pricing options with the COS method
Just as in [Citation36], we define a time-grid for
, with fixed time steps
. We write
,
, j=1,2. The discrete forward process is denoted by
and
. To determine the values of
,
, and given
, we use the Euler–Maruyama and the 2.0-weak-Taylor schemes. We write the discrete schemes for Formula (Equation1
(1)
(1) ) in general form, as follows:
(6)
(6) where
and
are uncorrelated and normally distributed Wiener increments with mean zero and variance
, and
is an independent random variable with probability
.
For the Euler–Maruyama scheme,Footnote2 we have
(7)
(7)
The functions associated with the 2.0-weak-Taylor scheme are given in Appendix 1.
According to [Citation24], the definitions of the order of strong convergence and the order of weak convergence are:
Definition 2.1.
The discrete process converges in the strong sense with order
if there exists a finite constant C and a positive constant δ such that
(8)
(8) for any time discretization with maximum step size
.
Definition 2.2.
Discrete process converges in the weak sense with order
if for any polynomial h there exists a finite constant C and a positive constant δ such that
(9)
(9) for any time discretization with maximum step size
.
For the Euler scheme, the order of strong convergence is and the order of weak convergence is
, while for the 2.0-weak-Taylor scheme
and
. The strong order of convergence of the 2.0-weak-Taylor scheme equals 1 when Equation (Equation1
(1)
(1) ) satisfies the following commutativity conditions [Citation24]:
(10)
(10)
As observed in [Citation36], the convergence of the COS method for pricing European options only depends on the order of weak convergence of the discretization scheme, and not on its order of strong convergence, because European options are not path-dependent. In Example 4.2 we observe that even for Bermudan options the order of weak convergence is leading for the rate of convergence. That is why we can use a weak-Taylor scheme for the discretization. Also, this implies that for application of the COS method it does not matter whether the FSDEs in Equation (Equation1(1)
(1) ) satisfy the commutativity condition (Equation10
(10)
(10) ) or not.
Theorem 2.1.
The analytic expression for the bivariate ChF of as in Equation (Equation6
(6)
(6) ), is given by
(11)
(11) where
and
(12)
(12)
Proof.
The ChF of , given
based on Equation (Equation6
(6)
(6) ), is given by
(13)
(13) where we abbreviated
,
and
.
The ChF of the non-central chi-squared distribution with one degree of freedom and non-centrality parameter λ reads
(14)
(14)
We assume and
, which gives
(15)
(15) where
(16)
(16) We abbreviate
(17)
(17) So, the integral is given by
(18)
(18) where
. Rewriting gives us
(19)
(19) Substituting result (Equation19
(19)
(19) ) in Equation (Equation15
(15)
(15) ) gives the ChF of
, given
, that is,
(20)
(20) This results in ChF (Equation11
(11)
(11) ) when we substitute Equations (Equation16
(16)
(16) ) and (Equation17
(17)
(17) ) into
Equation (Equation20
(20)
(20) ) and rewrite it. In a similar way, we find that Equation (Equation11
(11)
(11) ) is valid for
and/or
as well.
2.1.1. Pricing European and Bermudan options
We wish to derive the value of a European call option with as underlying
and exercise date T, where the FSDEs of
are given by Equation (Equation1
(1)
(1) ). The payoff of the option at time T is given by
for some function g. The value of the option at time t is given by
(21)
(21) where r is the risk-free interest rate and the expectation is taken under the risk-free measure
. We will denote
by
and the discretized option value by
. For
, we find
(22)
(22) where
.
A European option can only be exercised at the expiration date T, while a Bermudan option can be exercised at several predetermined dates. There is a minor change of procedure for pricing Bermudan options. Let n be the number of early-exercise dates and let denotes the early-exercise dates for j=1,2,...,n, where
. We choose the number of time steps M such that each of the early-exercise dates corresponds to a point in our time-grid.Footnote3 We replace Formula (Equation22
(22)
(22) ) by
(23)
(23) where
(24)
(24) and
.
In a similar way, we can also price discretely monitored barrier options, see [Citation13,Citation36].
Formula (Equation22(22)
(22) ), or for a Bermudan option Formula (Equation24
(24)
(24) ), can be recovered recursively, backwards in time, on a two-dimensional grid by means of the COS methodFootnote4 [Citation33], that is,
(25)
(25) where
indicates that the first term in the series summation is weighted by one-half and
(26)
(26)
When the above double integral cannot be computed analytically, we compute the function on an -grid by using the two-dimensional discrete Fourier-cosine transform. For each example in this paper, we evaluate the function
on a regular grid with
grid-points on the domain
. In Appendix 2, we explain how to choose these domain boundaries. We proved first-order convergence for the Euler scheme and second-order convergence for the 2.0-weak-Taylor scheme in the error analysis given in [Citation36]. So, we cannot price a European option in only one time step anymore when we work with the ChF of the discrete process.
2.2. Multiple strikes for the SABR model
It is possible to price European options under the SABR model for multiple strikes at once, by using a unique scaling symmetry of the SABR model [Citation31]. The forward value of a European call option under the SABR model with strike value K>0 and time to maturity T is given by
(27)
(27) where
and
denote, respectively, the log forward
and the log volatility
. In Formula (Equation27
(27)
(27) ), we added the strike K to the notation
, because we use a general strike
in this analysis and it is important to have a clear distinction between those strike values. The corresponding FSDEs, written in the form of Formula (Equation1
(1)
(1) ), are given by
(28)
(28)
To observe the scaling symmetry, we use the following transformations:
(29)
(29) and for any
, it holds that:
(30)
(30) so this is the scaled price of a call option under the transformed dynamics. Also, it is easy to observe that
and
. This implies that
and
form a SABR process, with the same parameters
and ρ as
and
, but with different initial values. This observation, together with Equation (Equation30
(30)
(30) ), implies that:
(31)
(31) We are thus able to price European options under the SABR model for multiple strikes in one computation by using Formula (Equation31
(31)
(31) ), that is, we price the corresponding European option for one general strike
for different initial values. This hardly costs more CPU time, because evaluating
backwards in time on the
-grid is the time-consuming part of the pricing method as we will also mention in Section 2.4. Such a strike
can be, for example, the ATM strike value. For most models such a transformation does not exist.
2.3. Richardson extrapolation
The use of the 2.0-weak-Taylor SDE scheme in combination with the COS method results in second-order convergence, whereas the Euler scheme results in only first-order convergence [Citation36]. Using this second-order scheme is however computationally expensive in two dimensions as we will observe in Example 4.1. The number of terms to be computed grows significantly in the ChF of the 2.0-weak-Taylor scheme (Equation11(11)
(11) ). This disadvantage of the 2.0-weak-Taylor scheme led us to the use of Richardson extrapolation on the results of the Euler scheme, just as the authors in [Citation21] and many others did, to obtain second-order convergence.
Suppose is the exact option value and
and
denote the approximations by the COS method for the Euler scheme to this value, where the number of time steps is respectively given by
and
. We choose
and
such that
. The Euler scheme exhibits first-order convergence. When this convergence is smooth and monotone, we obtain the following approximations:
(32)
(32)
(33)
(33) Rearranging these equations gives
(34)
(34) Formula (Equation34
(33)
(33) ) implies that combining the Euler results for
and
results in a second-order method if and only if the convergence is smooth and monotoneFootnote5. In this paper, we will always use
.
Remark 2.1.
Theoretically, we can apply Richardson extrapolation on the Euler or 2.0-weak-Taylor results to achieve a rate of convergence of three or more. In practice, we have to make a trade-off between the order of convergence and the computational costs of the method. To apply Richardson extrapolation, the spatial discretization error should be relatively small with respect to the temporal discretization error. Because of the computational complexity of the method, as we will discuss in Section 2.4, performing more time steps with second-order convergence to achieve a certain accuracy may have lower computational costs than using more grid-points to try to achieve third-order convergence.
2.4. Computational complexity
In this section, we discuss the computational complexity of our algorithm. As explained in Section 2.1, we evaluate the function backwards in time on a regular grid with
grid-points on the domain
, for
. At each time step, we use the two-dimensional discrete Fourier-cosine transform to approximate the
terms in Formula (Equation26
(26)
(26) ), which is of order
. Evaluating the function
on one grid-point costs
operations, which is higher than for Lévy processes, because we do not have the benefits of the decomposition into a Hankel and Toeplitz matrix [Citation33].
is explicit for each grid-point, so it is possible to evaluate this function for each grid-point parallel at a certain time step. At m=0, we only have to evaluate
on the initial value
which is of order
. So, the total number of operations is of the order:
(35)
(35) Despite the fact that we can compute many strike values in one computation, these computational costs are a disadvantage of the method.
3. The two-dimensional BCOS method
In Section 2, we considered the COS method for pricing European and Bermudan options under the SABR model. In this section, we generalize a method to solve BSDEs under the SABR model with the COS method on the basis of the ChF of the discrete scheme, the two-dimensional BCOS method. This method is an extension of the one-dimensional BCOS method [Citation34,Citation35].
In Section 3.1, we introduce the 2D BCOS method and we discuss the computational complexity of this method in Section 3.2.
3.1. The method
We wish to derive the value with as underlying asset process
and exercise date T, where the FSDEs of
are given by (Equation1
(1)
(1) ). The payoff of the derivative at time T is given by
for some function g. We also assume that we are working in a complete market,Footnote6 that is, a replicating portfolio can be created and the market is frictionless. We make a self-financing portfolio
consisting of
assets of
,
assets of
and bonds with risk-free return rate r, such that
, and:
(36)
(36) for
. If we set
and
, then
solves the BSDE:
(37)
(37)
(38)
(38) where
.
is a self-financing portfolio, so the value of the derivative is given by
. The function
is assumed to be uniformly continuous with respect to
and
and satisfies a Lipschitz condition in
, with Lipschitz constant
and the function
is assumed to be uniformly continuous with respect to
and
. Details on conditions of the existence and uniqueness of solution
can be found in [Citation29,Citation30].
Just as in Section 2, we define a time-grid of M+1 time points. We also define ,
and
. Integrating Equation (Equation37
(36)
(36) ) gives us:
(39)
(39) At time
, this gives the recursion:
(40)
(40) We take conditional expectations at both sides of the equation and use numerical integration to approximate the integral, for some
, we find:
(41)
(41)
(42)
(42) Multiplying Equation (Equation40
(38)
(38) ) with
gives
(43)
(43) Again, we take conditional expectations at both sides of the equation and use numerical integration with
, giving:
(44)
(44)
Analogously, we find
(45)
(45)
We use one of the approximation schemes of Section 2 in Formulas (Equation42(42)
(42) ), (Equation44
(41)
(41) ) and (Equation45
(42)
(42) ), which results, for
, in the following formulas:
(46)
(46)
(47)
(47)
(48)
(48) where
.
is implicit for
and can be determined by performing P Picard iterations, starting with initial guess
. We give the approximations of the conditional expectations in Formulas (Equation46
(43)
(43) )–(Equation48
(48)
(48) ) with the COS method in Appendix 3. The value of the derivative can be approximated by
.
We expect to obtain first-order convergence for the Euler scheme, independent of the choice for and
. This means that we can avoid the use of Picard iterations for the Euler scheme by taking
. Second-order convergence can be achieved when we apply Richardson extrapolation on the results of the Euler scheme, in the way we explained in Section 2.3. This is not only possible for the Y -process, but also for both Z-processes. We obtain second-order convergence if and only if the Euler results are converging smoothly and monotonically and this holds when
[Citation21]. Also, we expect to obtain second-order convergence for the 2.0-weak-Taylor scheme, when we choose the second-order mid-point method as the numerical integration method in Formulas (Equation42
(42)
(42) ), (Equation44
(41)
(41) ) and (Equation45
(42)
(42) ), so
.
3.2. Computational complexity
In this section, we discuss the computational complexity of the BCOS method. This method is more expensive than the COS method of Section 2. These extra costs are caused by the two additional processes and
and also by the use of Picard iterations in the implicit formula (Equation46
(43)
(43) ). We evaluate the functions
,
and
backwards in time on a regular grid with
grid-points on the domain
, for
. At each time step, we use the two-dimensional discrete Fourier-cosine transform to approximate the
cosine coefficients of each process. Also, we do P Picard iterations at each time step. At m=0, the costs of these iterations are of order
, and for
these costs are of order
for each time step. So, the total number of operations is of the order:
(49)
(49)
4. Numerical examples
In this section, we present some numerical experiments. We price European and Bermudan options in the examples of Section 4.1 and several BSDE examples are given in Section 4.2. We used MATLAB R2015a for the coding and the computations are performed on Intel(R) Core(TM) i5-2400 3.10 GHz processor with 16 GB RAM.
4.1. European and Bermudan examples
In the first example, we price multiple European call options under the uncorrelated SABR model. We consider the correlated Heston model in the second example, where we value not only call options, but also a Bermudan put option.
Example 4.1.
For the SABR dynamics (Equation28(28)
(28) ), we consider initial log forward
, initial log volatility
, exponent
, volatility of volatility parameter
, correlation
, strikes K=2.55,2.7,2.85, time to expiration T=1 and number of grid-points and cosine coefficients in each dimension
. Figure shows the mean of the absolute error in the Black implied volatility in basis points (BPS) for the Euler scheme (with and without Richardson extrapolation) and the 2.0-weak-Taylor scheme with the COS method, where we use Formula (Equation31
(31)
(31) ).Footnote7 We determined our reference values by using the method given in [Citation1], which gives for each option a reference Black implied volatility with an error of order
in BPS, for
.
As expected, the 2.0-weak-Taylor scheme shows faster convergence than the Euler scheme, but not in terms of CPU time as we show in Table . This is the main disadvantage of using the 2.0-weak-Taylor scheme, and the reason why we use Richardson extrapolation on the Euler scheme which also results in a second-order method. With Richardson extrapolation, we only need two additional time steps to observe an accuracy of less than 1 BPS, compared to 2.0-weak-Taylor scheme, as is shown in Figure . The use of Richardson extrapolation leads to a significant reduction in CPU time.
Table 1. Number of time steps and CPU time needed to obtain an absolute error of 1 or 0.5 basis points in the Black implied volatility for the Euler (with and without Richardson extrapolation) and 2.0-weak-Taylor schemes.
Example 4.2.
In this example, we consider the Heston model with different values for the correlation ρ. We wish to derive the value of a European call option with initial log-asset price , initial variance a=0.2, vol–vol
, correlations
, strike K=1.9 and time to expiration T=0.1. The reference value is obtained by using the COS method, with the ChF of the continuous process, which is given in Formula (Equation4
(4)
(4) ), and with
cosine coefficients. The convergence of the COS method with the Euler scheme is shown in Figure (a) and we observe for all values ρ first-order convergence.
Figure 2. The Heston model with different correlations: (a) the Euler–Maruyama scheme and (b) Richardson extrapolation on the Euler results.
![Figure 2. The Heston model with different correlations: (a) the Euler–Maruyama scheme and (b) Richardson extrapolation on the Euler results.](/cms/asset/3cd18595-f809-4d7f-bb60-c50023082d70/gcom_a_1290438_f0002_c.jpg)
Also, we apply Richardson extrapolation on these Euler scheme results. The results are given in Figure (b) and we observe second-order convergence for all ρ values, confirming the accuracy of Richardson extrapolation.
We continue by considering early-exercise dates for this problem. We take correlation and we wish to derive the value of a Bermudan put option under the Heston model with strike price K=1.9 and 5 early-exercise dates:
. The convergence results are given in Figure . We observe, as expected, first-order convergence for the Euler scheme and second-order convergence with Richardson extrapolation on the Euler results. Pricing Bermudan options under the Heston model with the COS method is also considered in [Citation14,Citation33], and we used the method given in this last paper to obtain the reference values. The difference with our method is that we employed the ChF of the discretized process.
4.2. BSDE examples
In the first experiment, we approximate the value of a geometric basket call option and in the second example we consider a spread option. We price a European call option under the SABR model in the last experiment. All forward processes are under the -measure and we choose
and
for the Euler scheme in each example, because for these values we obtain smooth, monotonic convergence for the Euler scheme, which is a necessary condition for applying Richardson extrapolation, see also [Citation21]. For the 2.0-weak-Taylor scheme, we take
, because a second-order numerical integration method is required to achieve second-order convergence.
Example 4.3.
We determine the value of a geometric basket call option, where both assets follow a geometric Brownian motion (GBM):
(50)
(50) and the payoff function is
. For the experiment we consider the following parameter values:
We evaluate the BSDE for pricing and hedging this basket option, such as in Formula (Equation37(36)
(36) ), that is,
(51)
(51) The reference value for this option is given by the Black–Scholes price of a European call option with initial stock value
, constant dividend yield
, volatility
and the same risk-free interest rate, time of maturity and strike price. This gives the reference values
,
and
. We observe first-order convergence of the BCOS method with the Euler scheme in Figure .
Example 4.4.
In this example we consider a spread option. The payoff function of such an option is given by . We assume that the underlying assets both follow a constant elasticity of variance (CEV) process:
(52)
(52) For this example, we consider the following parameter values:
The BSDE for pricing and hedging this spread option is given by
(53)
(53) There is no analytic formula available for calculating the reference values. We expect to obtain similar satisfactory results for this example as for the example with GBMs in Figure . Therefore, we use the BCOS method with very large numbers for M and N to get the reference values
,
and
. To double-check our results, we used Monte Carlo to obtain, respectively, the following
-confidence intervals for these reference values:
,
and
. The convergence of the BCOS method is shown in Figure , as expected we obtain first-order convergence with the Euler scheme.
Figure 5. Spread option with the Euler scheme and CEV FSDEs (Equation52(47)
(47) ).
![Figure 5. Spread option with the Euler scheme and CEV FSDEs (Equation52(47) Zm1,Δ(x)=1Δtθ2Em[Ym+1Δ(Xm+1Δ)ΔWm+11]−1−θ2θ2Em[Zm+11,Δ(Xm+1Δ)+ρZm+12,Δ(Xm+1Δ)]+1−θ2θ2Em[f(tm+1,Λm+1Δ(Xm+1Δ))ΔWm+11]−ρZm2,Δ(x),(47) ).](/cms/asset/10a59364-b198-4651-882c-74aab787e1a0/gcom_a_1290438_f0005_c.jpg)
Example 4.5.
For the SABR model, we use very large numbers for M and N to get reference value ,
and
, like we did in Example 4.4. In this experiment we have the following SABR FSDEs for the log-asset price
and the log volatility
under the
-measure:
(54)
(54) We make a self-financing portfolio consisting of assets
, assets depending on
(for example a volatility swap), and bonds and bonds.Footnote8 By using Formula (Equation36
(35)
(35) ), we find
(55)
(55) For the experiment we take the following parameter values:
The convergence for ,
and
are shown in Figure , where we used the following reference values for the European call option:
,
and
. We observe first-order convergence for the Euler scheme and second-order convergence when we use Richardson extrapolation on the Euler results. We also achieve second-order convergence with the 2.0-weak-Taylor scheme, but just as in Example 4.1, the corresponding computational costs are high. By comparing the CPU times in Tables and , we observe that one time step with the BCOS method is around three times more expensive than one time step with the COS method. As explained in Section 3.2, these extra costs are caused by the two additional processes
and
. Moreover, the 2.0-weak-Taylor scheme is also more expensive because of the use of P=10 Picard iterations per time step in the implicit Formula (Equation46
(43)
(43) ) and the additional expectations in Formulas (Equation47
(47)
(47) ) and (Equation48
(48)
(48) ) caused by
.
Table 2. Number of time steps and CPU time needed to obtain a certain accuracy in option price for the Euler (with and without Richardson extrapolation) and 2.0-weak-Taylor schemes.
5. Conclusion
In this paper, we considered the COS method for pricing European and Bermudan options and the BCOS method for solving backwards stochastic differential equations. We made use of the bivariate ChF of the discretized FSDEs in this technique, where we use the Euler-Maruyama or the 2.0-weak-Taylor scheme for the discretization. The use of these schemes in combination with the COS method results, respectively, in first-order and second-order convergence. Second-order convergence can also be observed by using Richardson extrapolation in combination with a Euler–Maruyama discretization on the forward process, which provides a significant reduction in computational costs compared to the 2.0-weak-Taylor scheme.
Disclosure statement
No potential conflict of interest was reported by the authors.
Notes
1 We omit the mean reverting term for the Heston variance.
2 From now on, we will refer to this scheme as the Euler scheme.
3 If desired, it is possible to choose non-constant.
4 We left out the discount term for convenience.
5 For the COS method, we observe smooth, monotonic convergence for the Euler scheme, this behaviour is only observed when for the BCOS method
6 Sometimes additional assumptions are required to complete a market [Citation8,Citation32], such as the tradability of volatility swaps in Example 4.5.
7 In this paper, we assume a deterministic risk-free interest rate, which implies that the risk-free measure and the forward measure coincide.
8 Note that we transform and
, before applying the theory of Section 3.1.
References
- A. Antonov, M. Konikov, and M. Spector, SABR spreads its wings, Risk (2013), pp. 58–63.
- P. Balland and Q. Tran, SABR goes normal, Risk (2013), pp. 76–81.
- F. Black and M. Scholes, The pricing of options and corporate liabilities, J. Polit. Econ. 81(3) (1973), pp. 637–654.
- B. Bouchard and N. Touzi, Discrete-time approximation and Monte-Carlo simulation of backward stochastic differential equations, Stochastic Processes Appl. 11(2) (2004), pp. 175–206.
- P.P. Boyle, Options: A Monte Carlo approach, J. Financ. Econ. 4 (1977), pp. 323–338.
- P. Carr and D.B. Madan, Option valuation using the fast Fourier transform, J. Comput. Finance 2 (1999), pp. 61–73.
- D. Chen, H.J. Harkonen, and D.P. Newton, Advancing the universality of quadrature methods to any underlying process for option pricing, J. Finan. Econ. 114(3) (2014), pp. 600–612.
- M.H.A. Davis, Complete-market models of stochastic volatility, Proc. Roy. Soc. A 460(2041) (2004), pp. 11–26.
- P. Doust, No-arbitrage SABR, J. Comput. Finance 15(3) (2012), pp. 3–31.
- D.J. Duffy, Finite Difference Methods in Financial Engineering: A Partial Differential Equation Approach, Wiley, Chichester, 2006.
- N. El Karoui, S. Peng, and M.C. Quenez, Backward stochastic differential equations in finance, Math. Finance 7(1) (1997), pp. 1–71.
- F. Fang and C.W. Oosterlee, A novel pricing method for European option based on Fourier-cosine series expansions, SIAM J. Sci. Comput. 31(2) (2008), pp. 826–848.
- F. Fang and C.W. Oosterlee, Pricing early-exercise and discrete barrier options by Fourier-cosine series expansions, Numer. Math. 114(1) (2009), pp. 27–62.
- F. Fang and C.W. Oosterlee, A Fourier-based valuation method for Bermudan and barrier options under Heston's model, SIAM J. Finan. Math. 2 (2011), pp. 439–463.
- P. Glasserman, Monte Carlo Methods in Financial Engineering, Springer-Verlag, New York, 2003.
- L.A. Grzelak and C.W. Oosterlee, From arbitrage to arbitrage-free implied volatilities, J. Comput. Finance 20 (2016), pp. 1–19.
- P.S. Hagan, D. Kumar, A.S. Lesniewski, and D.E. Woodward, Managing smile risk, Wilmott Mag. (2002), pp. 84–108.
- P.S. Hagan, D. Kumar, A.S. Lesniewski, and D.E. Woodward, Arbitrage-free SABR, Wilmott Mag. (2014), pp. 60–75.
- S.L. Heston, A closed-form solution for options with stochastic volatility with applications to bond and currency options, Rev. Finan. Stud. 6(2) (1993), pp. 327–343.
- D.J. Higham, An introduction to multilevel Monte Carlo for option valuation, Int. J. Comput. Math. 92(12) (2015), pp. 2347–2360.
- T.P. Huijskens, M.J. Ruijter, and C.W. Oosterlee, Efficient numerical Fourier methods for coupled forward–backward SDEs, J. Comput. Appl. Math. 296 (2016), pp. 593–612.
- K.J. in 't Hout and S. Foulon, ADI finite difference schemes for option pricing in the Heston model with correlation, Int. J. Numer. Anal. Modeling 7(2) (2010), pp. 303–320.
- A. Khedher and M. Vanmaele, Discretisation of FBSDEs driven by cádlág martingales, J. Math. Anal. Appl. 435(1) (2016), pp. 508–531.
- P.E. Kloeden and E. Platen, Numerical Solution of Stochastic Differential Equations, Springer-Verlag, Berlin, 1992.
- A.L. Lewis, A simple option formula for general jump-diffusion and other exponential Lévy processes, SSRN Paper, 2001.
- A. Lipton, Mathematical Methods for Foreign Exchange: A Financial Engineer's Approach, World Scientific, Singapore, 2001.
- J. Obłój, Fine-Tune Your Smile: Correction to Hagan et al, Wilmott Mag. (2008), pp. 102–104.
- L. Ortiz-Gracia and C.W. Oosterlee, Robust pricing of European options with wavelets and the characteristic function, SIAM J. Sci. Comput. 35(5) (2013), pp. B1055–B1084.
- E. Pardoux and S.G. Peng, Adapted solution of a backward stochastic differential equation, Syst. Control Lett. 14(1) (1990), pp. 55–61.
- E. Pardoux and S.G. Peng, Backward stochastic differential equations and quasilinear parabolic partial differential equations, in Stochastic Partial Differential Equations and Their Applications, B.L. Rozovskii and R.B. Sowers, eds., Lecture Notes in Control and Information Sciences, Vol. 176, Springer, Berlin, 1992, pp. 200–217.
- H. Park, Efficient valuation method for the SABR model, SSRN Paper, 2013.
- C.W. Potter, Complete stochastic volatility models with variance swaps, Tech. Rep., 2004.
- M.J. Ruijter and C.W. Oosterlee, Two-dimensional Fourier cosine series expansion method for pricing financial options, SIAM J. Sci. Comput. 34(5) (2012), pp. B642–B671.
- M.J. Ruijter and C.W. Oosterlee, A Fourier-cosine method for an efficient computation of solutions to BSDEs, SIAM J. Sci. Comput. 37(2) (2015), pp. A859–A889.
- M.J. Ruijter and C.W. Oosterlee, Numerical Fourier method and second-order Taylor scheme for backward SDEs in finance, Appl. Numer. Math. 103 (2016), pp. 1–26.
- Z. van der Have, Arbitrage-free methods to price European options under the SABR model, Master's thesis, TU Delft, 2015.
- L. von Sydow, L.J. Höök, E. Larsson, E. Lindström, S. Milovanović, J. Persson, V. Shcherbakov, Y. Shpolyanskiy, S. Sirén, J. Toivanen, J. Waldén, M. Wiktorsson, M.B. Giles, J. Levesley, J. Li, C.W. Oosterlee, M.J. Ruijter, A. Toropov, and Y. Zhao, BENCHOP: The BENCHmarking project in Option Pricing, Int. J. Comput. Math. 92(12) (2015), pp. 2361–2379.
- W. Zhao, L. Chen, and S. Peng, A new kind of accurate numerical method for backward stochastic differential equations, SIAM J. Sci. Comput. 28(4) (2006), pp. 1563–1581.
Appendices
Appendix 1
In this appendix, we give the functions for Formula (Equation6(6)
(6) ) associated with the 2.0-weak-Taylor scheme.
(A.1a)
(A.1a)
(A.1b)
(A.1b)
(A.1c)
(A.1c)
(A.1d)
(A.1d)
(A.1e)
(A.1e)
(A.1f)
(A.1f)
(A.1g)
(A.1g)
(A.1h)
(A.1h)
(A.1i)
(A.1i)
(A.1j)
(A.1j)
(A.1k)
(A.1k)
Appendix 2
In this appendix, we provide some information on how to choose the computational domain . The FSDEs are given by Formula (Equation1
(1)
(1) ), that is,
(A.2)
(A.2) where
and
.
When the first, second and fourth cumulants of and
given
are known we advise to choose the domain
as presented in [Citation33], so for i=1,2:
(A.3)
(A.3) where L=10 and
denotes the j-th cumulant of
given
. When the first cumulant is relatively large, we suggest to use a time-dependent domain, that is,
(A.4)
(A.4) where
denotes the j-th cumulant of
given
. This time dependency is important, because otherwise, for example
may be outside the interval
. The (B)COS method only needs a minor adaptation regarding the time-dependent domain:
and
have to be replaced by
and
, respectively, in Formulas (Equation25
(25)
(25) ), (Equation26
(26)
(26) ) and in each formula in Appendix 3.
When the cumulants of and/or
given
are unknown, we choose the domain as in [Citation36]:
(A.5)
(A.5) where L=10,
and
. When desired, this domain can also be time dependent. The interval
can be adjusted such that it satisfies specific constraints of
, for example, non-negativity.
We used Equation (A.5) for all experiments for the SABR model, but not for problems in which a drift function is large compared to the associated volatility, for example,
(A.6)
(A.6) where W is a standard Brownian motion and the vol–vol parameter
.
If we follow Equation (A.5), we would obtain
(A.7)
(A.7) This is incorrect, because
is not deterministic.
A better domain in this case would be based on Formula (A.5), as follows:
(A.8)
(A.8)
so that we find
(A.9)
(A.9) and
(A.10)
(A.10)
Appendix 3
In this appendix, we give approximations of ,
and
with the COS method for a general sufficiently smooth function
. We denote
(A.11)
(A.11) Using the two-dimensional COS method, we find
(A.12)
(A.12) Also, we have
(A.13)
(A.13) and
(A.14)
(A.14) where we abbreviated:
(A.15)
(A.15) The approximations (A.13) and (A.14) have, besides the error introduced by the COS method, an error of order
[Citation36].