^{1}

^{*}

^{2}

This paper will focus on pricing options in marketing with two basic assets with risk and one basic asset without risk. In so doing, the Black-Scholes model and the European options which is applicable at the due date were used. By investigating the European option to find the proper price, it is necessary to solve an equation with partial derivatives which has two spatial variables. The finite differences will be used for such equations. Finite differences for one dimensional equations commonly ends in a three diagonal set which will be solved by calculation costs O(n) in which n is the number of discrete points. But here, since the problems are two dimensional, the Alternating Direction Implicit (ADI) and Locally One-Dimensional (LOD) are used to reduce the calculation costs. The open cost is at the level of discrete points and this is the advantage of these methods. Moreover, these methods enjoy acceptable stability. Though ADI and LOD are equal and easy in calculations, evaluating these methods in pricing the option indicates that the ADI method is sensitive to discontinuity or non-derivation which is the common property of income function; therefore, this thesis proposes the LOD method.

Imagine than an option contract for two underlying assets with the present prices of x and y and the future prices of X_{1} and X_{1} at the maturity time of T has been signed. If the volatility of the first and second assets are shown by σ 1 , σ 2 and the ρ is the correlation coefficient between the prices of the two underlying assets and r is interest rate, then u ( x , y , T ) is the this contract price in the following equation which is called the two dimensional Black-Scholes equation.

∂ u ∂ t = 1 2 σ 1 2 x 2 ∂ 2 u ∂ x 2 + 1 2 σ 1 2 y 2 ∂ 2 u ∂ y 2 + 1 2 ρ σ 1 σ 2 x y ∂ 2 u ∂ x ∂ y + r x ∂ u ∂ x + r y ∂ u ∂ y − r u . (1)

where ( x , y , t ) ∈ Ω × ( 0, T ] and u = u ( x , y , t ) is the three-variate u function. One of the variables is t and the other two variables are the spatial variables. By the two dimensional Black-Scholes equation we mean that there are two special variables in this equation. Although pricing options problems are defined in an infinite set such as:

Ω × ( 0 , T ] = { ( x , y , t ) | ( x , y ) ∈ Ω , t ∈ ( 0 , T ] }

To use numerical methods, a limited range will be considered. Therefore, Equation (1) will be considered on a finite range where M and L are selected so large that the error in the u price become negligible [

(1) linear boundary conditions

∂ 2 u ∂ x 2 ( 0 , y , t ) = 0 , 0 ≤ y ≤ M , t ≥ 0 ,

∂ 2 u ∂ x 2 ( L , y , t ) = 0 , 0 ≤ y ≤ M , t ≥ 0 ,

∂ 2 u ∂ y 2 ( x , 0 , t ) = 0 , 0 ≤ x ≤ L , t ≥ 0 ,

∂ 2 u ∂ y 2 ( x , M , t ) = 0 , 0 ≤ x ≤ L , t ≥ 0.

(2) Dirichlet boundary conditions

u ( x , 0 , t ) = Λ ( x , 0 ) , 0 ≤ x ≤ L , t ≥ 0 ,

u ( x , M , t ) = Λ ( x , M ) , 0 ≤ x ≤ L , t ≥ 0 ,

u ( 0 , y , t ) = Λ ( 0 , y ) , 0 ≤ y ≤ M , t ≥ 0 ,

u ( L , y , t ) = Λ ( L , y ) , 0 ≤ y ≤ M , t ≥ 0.

The third condition is Neumann boundary condition which is not used in the present thesis. A combination of the first and the second condition might also be used [

The two dimensional Black-Scholes equation can be discretized as the one dimensional Black-Scholes equation. To simplify the computations, the discrete operator L is defined as follows [

L u i j n = σ 1 2 2 ( i Δ x ) 2 u i + 1 , j n − 2 u i , j n + u i − 1 , j n ( Δ x ) 2 + σ 2 2 2 ( j Δ y ) 2 u i , j + 1 n − 2 u i , j n + u i , j − 1 n ( Δ y ) 2 , + ρ σ 1 σ 2 ( i Δ x ) ( j Δ y ) u i + 1 , j + 1 n − u i , j + 1 n + u i + 1 , j n + u i , j n Δ x Δ y + r ( i Δ x ) u i + 1 , j n − u i − 1 , j n 2 Δ x + r ( j Δ y ) u i , j + 1 n − u i , j − 1 n 2 Δ y − r u i , j n . (2)

The explicit method is as follows

u i j n + 1 − u i j n Δ t = L u i j n , (3)

And the implicit method is as follows

u i , j n + 1 − u i , j n Δ t = L u i , j n + 1 .

In general form, CrankNicolson method is as follows

u i , j n + 1 − u i , j n Δ t = ( 1 − θ ) L u i , j n + θ L u i , j n + 1

There is no need to solve the set in the explicit method since

u i j n + 1 = u i j n + Δ t L u i j n ,

However, the explicit method has conditional stability and its stability domain is much smaller than the one dimensional mode. In fact, as the number of dimensions increase, the stability domain of the explicit method become smaller. The implicit method is stable and need to solve the linear equation set.

u i , j n + 1 − u i , j n Δ t = L u i , j n + 1 .

The dimensions of this set equals the numbers of points in the net. Since in the two dimensional mode the number of points is twice the number of points in the one dimensional mode; therefore, we have a large set of N x , N y dimensions which is too expensive to solve. The same can be found in Crank Nicolson method for 0 ≤ θ ≤ 1 Therefore these methods are not recommended. ADI and LOD methods will be proposed in the next section. These methods are both unconditionally stable and have low computational costs. In these methods, by decomposing the L operator to two x and y operators at each step, a number of three diagonal sets with N x or N y dimension will be solved to be able to go to the next step [

To obtain the Alternating Direction Implicit (ADI), the time derivation will be estimated as,

∂ u ∂ t ≅ u i , j n + 1 − u i , j n Δ t = u i , j n + 1 − u i , j n + 1 2 + u i , j n + 1 2 − u i , j n Δ t = u i , j n + 1 − u i , j n + 1 2 Δ t + u i , j n + 1 2 − u i , j n Δ t . (4)

In fact, we added and subtracted one intermediate step t n + 1 2 and divided the

time derivation into two parts. Now, by the using the LOD of L, we try to find the following equation to solve the equation.

u i , j n + 1 − u i , j n + 1 2 Δ t + u i , j n + 1 2 − u i , j n Δ t = L x u i n + 1 2 + L y u i n + 1 . (5)

We will explain the way of obtaining the above mentioned equation in the following. To get from − n to − ( n + 1 ) in ADI method, we first solve

u i , j n + 1 2 − u i , j n Δ t = L x u i , j n + 1 2 (6)

For j = 1 , ⋯ , N y , and every one of them is a three diagonal set from the N x

dimension. By this action, the values of u will be obtained in n + 1 2 stage. Then,

to obtain u in ( n + 1 ) phase, we solve

u i , j n + 1 − u i , j n + 1 2 Δ t = L y u i , j n + 1 (7)

For i = 1 , ⋯ , N x every one of them is a set from the N y dimension. Referring to the above explanations and considering the fact that solving three diagonal sets has O ( N ) cost, we conclude that getting from − n to − ( n + 1 ) step equals the rank of the number of network points.

N y O ( N x ) + N x O ( N y ) = O ( N x N y )

This is the least possible calculation cost. Now, we explain how we can obtain L x and L y and equation sets. First, the time step of t n , t n + 1 is divided into the

two steps of [ t n , t n + 1 2 ] and [ t n + 1 2 , t n + 1 ] . in the first time step, the derivations

should be implicitly estimated in relation to x and the derivations will be explicitly estimated in relation to y variable. In other words, we write ( Δ x = Δ y = h )

u i , j n + 1 2 − u i , j n 1 2 Δ t = σ 1 2 2 x i 2 u i + 1 , j n + 1 2 − 2 u i , j n + 1 2 + u i − 1 , j n + 1 2 h 2 + σ 2 2 2 y j 2 u i , j + 1 n − 2 u i , j n + u i , j − 1 n h 2 + 1 2 ρ σ 1 σ 2 x i y j u i + 1 , j + 1 n + u i − 1 , j − 1 n − u i + 1 , j − 1 n − u i − 1 , j + 1 n 4 h 2 + r x i u i + 1 , j n + 1 2 − u i , j n + 1 2 h + r y j u i , j + 1 n − u i , j n h − r u i , j n + 1 2 . (8)

In the second time step, i.e. in [ t n + 1 2 , t n + 1 ] we will act in reverse. In other

words, we implicitly estimate the derivation in relation to y and explicitly in relation to x. Therefore, we have

u i , j n + 1 − u i , j n + 1 2 1 2 Δ t = σ 1 2 2 x i 2 u i + 1 , j n + 1 2 − 2 u i , j n + 1 2 + u i − 1 , j n + 1 2 h 2 + σ 2 2 2 y j 2 u i , j + 1 n + 1 − 2 u i , j n + 1 + u i , j − 1 n + 1 h 2 + 1 2 ρ σ 1 σ 2 x i y j u i + 1 , j + 1 n + 1 2 + u i − 1 , j − 1 n + 1 2 − u i + 1 , j − 1 n + 1 2 − u i − 1 , j + 1 n + 1 2 4 h 2 + r x i u i + 1 , j n + 1 2 − u i , j n + 1 2 h + r y j u i , j + 1 n − u i , j n + 1 h − r u i , j n + 1 . (9)

In the above equations, the derivation of ∂ 2 u ∂ x ∂ y is explicitly written and y in

the last sentence is implicitly written. Now, if we multiply the two sides of the

Equation (8) by 1 2 and defne the left side with L x u i , j n + 1 2 , also if we multiply the two sides of the Equation (9) by 1 2 define the left side with L y u i , j n + 1 , we get the

(8) and (9) equations. Now, if j is constant in (8)) equation and transfer the value

in n + 1 2 step to the left, the unknown values are.

u i , j n + 1 2 , u i − 1 , j n + 1 2 , u i + 1 , j n + 1 2

In the present equations, the coefficient u i − 1 , j n + 1 2 is

α i = − ( σ 1 2 4 Δ t h 2 x i 2 )

And cofficient u i , j n + 1 2 is

β i = ( 1 + σ 1 2 2 Δ t h 2 x i 2 − 1 2 Δ t h r x i + 1 2 r )

Coefficient u i + 1 , j n + 1 2 is

γ i = − ( σ 1 2 4 Δ t h 2 x i 2 + r 2 Δ t h x i )

if we transfer the values in the − n step to the right side and define

f i j : = u i , j n + Δ t 4 ( σ 2 y j ) 2 u i , j + 1 n − 2 u i , j n + u i , j − 1 n h 2 + Δ t 2 r y j u i , j + 1 n − u i , j n h + Δ t 2 ρ σ 1 σ 2 x i y j u i + 1 , j + 1 n + u i − 1 , j − 1 n − u i − 1 , j + 1 n − u i + 1 , j − 1 n 4 h 2 .

then, we get to the below equation

α i u i − 1 , j n + 1 2 + β i u i , j n + 1 2 + γ i u i + 1 , j n + 1 2 = f i , j .

For constant j and for i = 1 , 2 , ⋯ , N x in the above equation, the equation set is defined which is a three diagonal set.

A x = [ β 1 γ 1 0 ⋯ 0 0 α 2 β 2 γ 2 ⋯ 0 0 0 ⋱ ⋱ ⋱ ⋯ 0 ⋮ ⋮ ⋱ ⋱ ⋱ ⋮ 0 0 0 α N x − 1 β N x − 1 γ N x − 1 0 0 0 ⋯ α N x β N x ]

The sentence α 1 u 0, j n + 1 2 in the first line and the sentence γ N x u N x + 1 , j n + 1 2 in the last

line will be transferred to right and will be subtracted from f N x , j , f 1, j respectively. These sentences will be substituted from the boundary condition and the left side of the rectangular area of Ω = [ 0 , L ] × [ 0 , M ] . the new values will be

presented by f ^ i , j values will be obtained in n + 1 2 step [

this half-step is

for j = 1 : N y

for i = 1 : N x

set α i , β i , γ i and f i j .

end

solve A x u 1 : N x , j n + 1 2 = f ^ 1 : N x , j by using Thomas algorithm.

end

Considering the (9), we follow the same procedure for the second half-step. First, we define

α j = − ( σ 2 2 4 Δ t h 2 y j 2 )

ana

β j = ( 1 + σ 2 2 2 Δ t h 2 y j 2 − 1 2 Δ t h r y j + 1 2 r )

and

γ j = − ( σ 2 2 4 Δ t h 2 y j 2 + r 2 Δ t h y j )

A y = [ β 1 γ 1 0 ⋯ 0 0 α 2 β 2 γ 2 ⋯ 0 0 0 ⋱ ⋱ ⋱ ⋯ 0 ⋮ ⋮ ⋱ ⋱ ⋱ ⋮ 0 0 0 α N y − 1 β N y − 1 γ N y − 1 0 0 0 ⋯ α N y β N y ]

which is a three diagonal set. The sentence α 1 u i , 0 n + 1 In first line and the sentence γ N y u i , N y + 1 n + 1 in the last line will be transferred to the right of the set and their values will be substituted considering the border condition of the sides in top and bottom of [ 0 , L ] × [ 0 , M ] of the rectangle area. The new values are presented by g ^ i , j the set N x will be solved for i = 1 , 2 , ⋯ , N x and the u value will be obtained at n + 1 step.

g i j : = u i , j n + 1 2 + Δ t 4 ( σ 1 x i ) 2 u i + 1 , j n + 1 2 − 2 u i , j n + 1 2 + u i − 1 , j n + 1 2 h 2 + Δ t 2 r x i u i + 1 , j n + 1 2 − u i , j n + 1 2 h + Δ t 2 ρ σ 1 σ 2 x i y j u i + 1 , j + 1 n + 1 2 + u i − 1 , j − 1 n + 1 2 − u i − 1 , j + 1 n + 1 2 − u i + 1 , j − 1 n + 1 2 4 h 2 .

therefore, the following equation will be obtained.

α i u i , j − 1 n + 1 + β i u i , j n + 1 + γ i u i , j + 1 n + 1 = g i , j . (10)

The second phase algorithm is as follows.

for i = 1 : N x

for j = 1 : N y

set α j , β j , γ j and g i j .

end

solve A y ( u i , 1 : N y n + 1 ) T = ( g i , 1 : N y ) T by using Thomas algorithm.

end

As it can be seen, in the first half-step of N y , the three diagonal set will be solved from the dimension of N x and in the second half-step of N x , the three diagonal set will be solved from the dimension of Therefore, the calculation cost of the method to get from the n step to the n + 1 step is from the rank of N y N x , that is, the rank of the number of the network points.

The LOD method, similar to ADI method is divided into two steps in each time step. The first stage estimations are implicit and in relation to x and the second step is explicit and in relation to y. the Black-Scholes model is rewritten as [

1 2 ∂ u ∂ t + 1 2 ∂ u ∂ t = { ( σ 1 x ) 2 2 ∂ 2 u ∂ x 2 + r x ∂ u ∂ x + 1 2 σ 1 σ 2 ρ x y ∂ 2 u ∂ x ∂ y − r 2 u } + { ( σ 2 y ) 2 2 ∂ 2 u ∂ y 2 + r y ∂ u ∂ y + 1 2 σ 1 σ 2 ρ x y ∂ 2 u ∂ x ∂ y − r 2 u } . (11)

in which the derivations for x and y are written separatel y. The derivation

∂ 2 u ∂ x ∂ y and the u are divided between the two groups. Now, the time step of [ t n , t n + 1 ] will be divided into two steps of [ t n , t n + 1 2 ] and we will solve the first half-step, that is, [ t n , t n + 1 2 ] of the equation

1 2 ∂ u ∂ t = { ( σ 1 x ) 2 2 ∂ 2 u ∂ x 2 + r x ∂ u ∂ x + 1 2 σ 1 σ 2 ρ x y ∂ 2 u ∂ x ∂ y − r 2 u } . (12)

We will solve the half-step [ t n + 1 2 , t n + 1 ] of the equation.

1 2 ∂ u ∂ t = { ( σ 2 y ) 2 2 ∂ 2 u ∂ y 2 + r y ∂ u ∂ y + 1 2 σ 1 σ 2 ρ x y ∂ 2 u ∂ x ∂ y − r 2 u } . (13)

Both equation will be fragmented implicitly. In this way, the operators L x o , L y o defined as follows.

L x o u i j n + 1 2 : = ( σ 1 x i ) 2 2 u i − 1 , j n + 1 2 − 2 u i , j n + 1 2 + u i + 1 , j n + 1 2 h 2 + r x i u i + 1 , j n + 1 2 − u i , j n + 1 2 h − r 2 u i , j n + 1 2 , + 1 2 σ 1 σ 2 ρ x i y j u i + 1 , j + 1 n + u i − 1 , j − 1 n − u i − 1 , j + 1 n + u i + 1 , j − 1 n 4 h 2 (14)

and

L y o u i j n + 1 = ( σ 2 y j ) 2 2 u i , j − 1 n + 1 − 2 u i , j n + 1 + u i , j + 1 n + 1 h 2 + r y j u i , j + 1 n + 1 − u i , j n + 1 h − r 2 u i , j n + 1 + 1 2 σ 1 σ 2 ρ x i y j u i + 1 , j + 1 n + 1 2 + u i − 1 , j − 1 n + 1 2 − u i − 1 , j + 1 n + 1 2 + u i + 1 , j − 1 n + 1 2 4 h 2 . (15)

Now the two following sets are made.

u i , j n + 1 2 − u i , j n Δ t = L x o u i , j n + 1 2 , (16)

and

u i , j n + 1 − u i , j n + 1 2 Δ t = L y o u i , j n + 1 , (17)

which are called the first phase and the second phase sets respectively. Therefore, the algorithm of LOD method has two phases. In the first phase, the Equation (12) will be fragmented and summarized.

α i u i − 1 , j n + 1 2 + β i u i , j n + 1 2 + γ i u i + 1 , j n + 1 2 = f i , j

The coefficients of α i , β i , and γ i are defined as

α i = − σ 1 2 x i 2 Δ t 2 h 2 , β i = 1 − σ 1 2 x i 2 Δ t h 2 − r x i Δ t h + r 2 , γ i = − ( σ 1 2 x i 2 Δ t 2 h 2 − r x i Δ t h ) .

Also, the right side of f i , j is

f i j = Δ t 2 ρ σ 1 σ 2 x i y j u i + 1 , j + 1 n + u i − 1 , j − 1 n − u i − 1 , j + 1 n − u i + 1 , j − 1 n 4 h 2 .

The only difference between ADI and LOD is in the right hand side value of

f i , j . on the LOD, the discrete values of ∂ 2 u ∂ y 2 and ∂ u ∂ y do not exist. Therefore,

the algorithm of the first phase of the LOD method is similar to ADI method and the only difference is in the right side. In the second phase of the fragmentation of the Equation (13), we have

α j u i , j − 1 n + 1 + β j u i , j n + 1 + γ j u i , j + 1 n + 1 = g i , j

The coefficients of α j , β j , and γ j are defined as

α j = − σ 2 2 y j 2 Δ t 2 h 2 , β j = 1 − σ 2 2 y j 2 Δ t h 2 − r y j Δ t h + r 2 , γ j = − ( σ 2 2 y j 2 Δ t 2 h 2 − r y j Δ t h ) .

And the right side values are defined as

Δ t 2 ρ σ 1 σ 2 x i y j u i + 1 , j + 1 n + 1 2 + u i − 1 , j − 1 n + 1 2 − u i − 1 , j + 1 n + 1 2 − u i + 1 , j − 1 n + 1 2 4 h 2 .

This phase is similar to the second phase of the ADI method. The only differ-

ence is that the right side does not include the fragmented values of ∂ 2 u ∂ x 2 and ∂ u ∂ x .

If x is the exact value of a numerical quantity and x ^ is an approximate quantity. Absolute error is defined as

Δ x = | x − x ^ | (18)

But if the purpose is estimating a function such as u ( x , y , T ) , instead of one number of the function value u ( x , y , T ) in the points ( x i , y j ) which 1 ≤ i ≤ N x , 1 ≤ j ≤ N y should be investigated. Therefore, the definition of (18) is corrected. If the exact response value for t = T with the function.

u e ( x , y , T ) , x ∈ [ 0, L ] , y ∈ [ 0, M ]

And the approximate values in the points ( x i , y j ) with u ^ ( x i , y j , T ) . In this way, the error is

‖ e ‖ ∞ = max 1 ≤ i ≤ N x max 1 ≤ j ≤ N y | u i j e − u ^ i j |

Defined as the “extreme norm error” or “the maximum error”. The “norm error of two” or “mean square error” is defined as

‖ e ‖ 2 = 1 N x N y ∑ i = 1 N x ∑ j = 1 N y ( u e ( x i , y j , T ) − u ^ i j ) 2 . (19)

While applying the numerical results in a real market, all u i , j won’t be used since the basic assets cannot be numerical and if the two basic assets in problem are x , y respectively. Neighborhood around x 1 is considered as x. the error must be investigated in a limited area of the present prices. This area is called G [

G = { ( x , y ) | 0.9 X 1 ≤ x ≤ 1.1 X 1 , 0.9 X 2 ≤ x ≤ 1.1 X 2 }

The neighborhood gure is as follows.

In which every ( x i , y j ) is in G. Therefore, the following will be done.

0.9 X 1 ≤ x i ≤ 1.1 X 1 ⇒ [ 0.9 X 1 Δ x ] ≤ i ≤ − [ − 1.1 X 1 Δ x ] ,

similarly, we have

[ 0.9 X 2 Δ y ] ≤ j ≤ − [ − 1.1 X 2 Δ y ] .

The number of ( i , j ) which are in this neighborhood are defined as

N = ( − [ − 1.1 X 1 Δ X ] − [ 0.9 X 1 Δ X ] + 1 ) ( − [ − 1.1 X 2 Δ y ] − [ 0.9 X 2 Δ y ] + 1 ) . (20)

We also use the root mean square error (RMSE) on a specific region. The RMSE is defined as

R M S E = 1 N ∑ i , j N ( u i , j e − u ^ i j ) 2 = ‖ e ‖ 2 , G

where N is the number of points on the gray region show in

First, the option of two cash assets or none will be considered. We assume that by having two assets x, y the income of option is as follows [

Λ ( x , y ) = { cash x ≥ X 1 , y ≥ X 2 0 unless (21)

where X_{1}, X_{2} are the prices of x, y.

The function figure is as follows.

The following values will be used for the numerical simulation of the parameters.

σ 1 = σ 2 = 0.3 , r = 0.03 , ρ = 0.5 , cash = 1 , X 1 = X 2 = 100 ,

We consider the calculation domain as Ω = [ 0 , 300 ] × [ 0 , 300 ] for this example, in

V ( x , y ) = cash exp ( − r t ) Ψ ρ ( Y 1 ( x , y ) , Y 2 ( x , y ) )

Y 1 ( x , y ) = 1 σ 1 T ( log x X 1 + ( r − σ 1 2 2 ) T ) ,

Y 2 ( x , y ) = 1 σ 2 T ( l o g y X 2 + ( r − σ 2 2 2 ) T ) .

Note that Ψ ρ is a bivariate normal cumulative distribution function, i.e.,

Ψ ρ ( a , b ) : = 1 2 π ∫ − ∞ a ∫ − ∞ b exp ( − x 2 + y 2 2 1 − ρ 2 + ρ x y 2 1 − ρ 2 ) d x d y .

For this example, the errors of both ADI and LOD methods with different time and location step length are presented in

As shown in

tions, u 1 2 ana u 1 , and source terms, f and g, generated from the ADI and LOD

methods. We used time step size, Δ t = 0.5 , and space step size h = 5 . In

RMSE | h | Δt | ||
---|---|---|---|---|

2.6819 × 10^{−}^{20} | 3.5622 × 10^{−}^{4} | 4.4095 × 10^{−}^{5} | 5.0 | 0.05 |

1.184 × 10^{−}^{4} | 5.5920 × 10^{−}^{5} | 2.3593 × 10^{−}^{6} | 2.5 | 0.025 |

1.8877 × 10^{−}^{69} | 2.4637 × 10^{−}^{11} | 1.3877 × 10^{−}^{7} | 1.25 | 0.0125 |

N.A | N.A | N.A | 0.625 | 0.00625 |

RMSE | h | Δt | ||
---|---|---|---|---|

1.6230 × 10^{−}^{20} | 5.639 × 10^{−}^{4} | 2.2564 × 10^{−}^{4} | 5.0 | 0.05 |

2.9567 × 10^{−}^{42} | 2.2343 × 10^{−}^{4} | 9.9937 × 10^{−}^{5} | 2.5 | 0.025 |

1.0266 × 10^{−}^{72} | 1.1897 × 10^{−}^{4} | 4.2046 × 10^{−}^{5} | 1.25 | 0.0125 |

5.8791 × 10^{−}^{144} | 8.3722 × 10^{−}^{5} | 1.8680 × 10^{−}^{5} | 0.625 | 0.00625 |

The source term in the ADI method exhibits oscillation around y = X 2 which is from the y-derivatives in the source term. On the other hand, for the LOD method, we don’t have the y-derivatives in the source term and solution

u 1 2 is monotone around y = X 2 . Therefore, for the ADI we have an LOD

solution at the first step. After one complete time step, the result with the ADI shows nonsmooth numerical solution. However, the LOD method results in a smooth numerical solution [

Bagheri, N. and Haghighi, H.K. (2017) A Comparison Stu- dy of ADI and LOD Methods on Option Pricing Models. Journal of Mathematical Finance, 7, 275-290. https://doi.org/10.4236/jmf.2017.72014