E-N.G. Grylonakis, C.K. Filelis-Papadopoulos, G.A. Gravvanis

Futures
Financial
Instruments
Derivatives
Forwards Swaps Options

Financial contracts that give the holder the right but not the obligation to buy (call option) or sell (put option) an underlying asset for a fixed price at a specific date.
How much money should one pay to buy a specific option contract
?
Accurate option pricing for three underlying assets, using the multiasset Black-Scholes equation.

Binomial Options
Pricing Model
Lattice Methods
Monte Carlo
Methods
Black-Scholes-
Merton Model

∂u
+ Lu = 0
∂t
Lu =
1
2 i, j n 
= 1 p ij s i s j
S i
S j
∂ 2 u
∂
S i
∂
S j
+ r i n 
= 1
S i
∂ u
∂
S i
ru
Time Dependent Convection-Diffusion-Reaction
Partial Differential Equation

Single-Asset
Option
1D BS PDE
Closed-Form
Solutions
Multi-Asset
Option
N-D BS PDE
Approximate
Solutions

Option
Contract
①
Number of underlying assets
②
Parameters (Strike Price, Expiration date, etc.)
③
Payoff Function (Initial Condition)
④
Boundary Conditions
Numerical solution of the corresponding BS Partial
Differential Equation

Payoff
Function
Max { w[I(T)-K], 0 }
I = n
 j = 1 w j
I j where w j is the total investment in asset j ( as a percentage) and I the price of j-th asset. j
(t) is

¶ 2 u(0, y,z, t)
¶ x
2
= ¶
2 u(S
1 max
¶ x
2
, y,z, t)
=
0, 0
£ y
£
S
2 max
,0
£ z
£
S
3 max
¶ 2 u(x,0,z, t)
¶ y
2
= ¶
2 u(x,S
2 max
¶ y
2
,z, t)
=
0, 0
£ x
£
S
1 max
,0
£ z
£
S
3 max
2 u(x, y,0, t)
z
2
2 u(x, y,S
3 max
z
2
, t)
0, 0
x
S
1 max
,0
y
S
2 max
Commonly used in practical pricing problems, providing stability when used with the Finite Difference Method

u'
» u i
-
2
-
8u i
-
1
+
8u i
+
1
u i
+
2
12h


1
12
2
0
3
2
3
1
12

 u''
» u i
-
2
+
16u i
-
1
-
30u i
12h
2
+
16u i
+
1
u i
+
2

 
1
12
4

3
5
2
4

3
1
12



computational domain boundary ghost values

First Derivatives:
Second Derivatives:

 
1
3

1
2
1

1
6


[
1
-
2 1
]

The imposition of linear boundary conditions forces the second derivatives to vanish on the boundary.
The first order derivatives were discretized by a fourth order one-sided approximation:


25
12

4 3

4
3
1
4



We denote by



 x k


1 the discretized first order derivative for coordinate x k
. Then, the stencil of the derivative with respect to coordinate k can be formed in a d-dimensional way:


 
 x k


 d
 d m

1 
 k
I d
 k
 m



 
 x k


 1
 k m

1 

1
I k
 m
The cross-derivative can be approximated by the following expression:


  2
 x k
 x



 d
 d m

1 
 
I d
   m



 
 x



 1

 m


1  k

1
I k
   m



 
 x k


 1
 k m

1 

1
I m

The coefficient matrix is then formed by the following tensor product: where:
X = [
X
1
,X
2
,...,X d
] X k
 d m
1

 k e x d  k  m
 x k
 k m
1

 1 e x k  m
The above schemes reduce the programming effort substantially while providing a compact method to discretize PDE’s in higher dimensions.

After the spatial discretization, a system of Ordinary Differential
Equations of the following form, occurs: du dt
+ Au = 0 u(x, y,z,T) = u
0
This system can be solved by the implicit fourth order backward difference scheme (BDF4):
25
I
12
  tA u
 n

1
 
4 u

3 u
 n

1
 
4
3 u
 n

2
 
1
4 u
 n

3


It can be observed that the BDF4 scheme requires the discrete solution in three previous time steps. These values can be obtained by the Implicit Runge-Kutta method (4rth order accurate): y n

1
 y n
  t i s 

1 b i k i
, k i
= f (x n
+
 t c i
, y n
+
 t s  j= 1 a ij k j
) ,
The coefficients of the 2-stage method are: a b
1
11
=
= b
1
4
, a
12
2
=
=
1
2
, c
1
3
-
=
2 3
12
, a
21
3
-
3
, c
2
6
=
=
3
+
2 3
, a
22
12
3
+
3
6
=
1
4
,

The arising large, sparse,linear system was solved by the
Preconditioned BiConjugate Gradient Stabilized (PBiCG-STAB) method, in conjunction with the Modified Generic Factored
Approximate Sparse Inverse (MGenFAspI) scheme.
MGenFAspI matrix: M=GH
The MGenFAspI matrix is computed by solving the following systems: lfill
LH droptol
=
I lfill
UG droptol
=
I
The modified approach minimizes the searches for elements and enhances the performance of the method.

When attempting to solve large sparse linear systems, reordering schemes can be used in order to minimize the fill-in during the factorization process.
The AMD algorithm produces a reordering such that the vertices with minimum degree are to be eliminated first.
The degree of each vertex is approximated through an upper bound created by the sum of the weights of the neighboring vertices, increasing the performance of the resulting ordering scheme.

In order to compute the three initial solutions with the Runge-Kutta method, the solution of four linear systems at every time step is required.
Recalling the vectors, required by the R-K method: k i
= f (x n
+
 t c i
, y n
+
 t s  j= 1 a ij k j
) ,
The 2-stage method requires the computation of vectors k which can be obtained by the following system:
1 and k
2
(I - D
4 t 2
A)k
1
- D t 2 (
1
4
-
-D t 2 (
1
4
+
6
3
)Ak
2
= D tAu
6
3
)Ak
1
+ (I - D
4 t 2
A)k
2
= D tAu

The above system can be expressed in the following block form:


A
1
C
1
B
1
D
1



 k k
1
2

 



 t Au t Au




A
0
1
B
1
S



 k k
2
1

 


 t Au

 t Au
C
1
A
1

1

 t Au

  where:
(
1
- C
1
A
1
-1
B
1
)

The computation of k
1 and k
2 is then performed by solving the following linear systems at every time step:
Sk
2
= D tAu
-
C
1
A
1
-
1
(
D tAu
)
A
1 k
1
= D tAu
-
B
1 k
2
The Schur complement is computed implicitly, since iterative methods do not require the coefficient matrix explicitly, because the product of a matrix by a vector is only needed. Thus:
Sx
=
(
D
1
-
C
1
A
1
-
1
B
1
) x
= (
D
1 x
-
C
1 y
)
, y
=
A
-1
1
A
1 y
= ( )

The estimated price of the basket option:

Performance (“seconds.hundreds”) of the PBiCG-STAB, based on the MGenFAspI in conjunction with AMD reordering scheme, for various values of N and droptol:

Convergence behavior of the PBiCG-STAB, based on the
MGenFAspI in conjunction with AMD reordering scheme, for various values of N and droptol:

The number of nonzero elements in the G and H factors of the
MGenFAspI for various values of N and droptol:

1. The Black-Scholes PDE can be used to price options with many underlying assets, without relying solely on Monte Carlo methods.
2. The high order schemes combined with a multi-dimensional PDE result in a large, sparse, linear system, thus, iterative methods are the best choice.
3. Preconditioners and reordering schemes can be used to enhance the performance of the chosen iterative method.
4. The MGenFAspI matrix has been proved to be an effective preconditioner and combined with various iterative methods has achieved better convergence behavior in comparison with other methods.
5. Moreover, the applicability of the MGenFAspI matrix in conjunction with the PBiCG-STAB method has been evaluated, for various model problems, derived from Computational Fluid Dynamics,
Computational Structural Analysis and Plasma Physics.

Achdou, Y., and Pironneau, O. 2005. Computational methods for option pricing. SIAM.
Amestoy, P., Davis, T.A., and Duff, I.S. 1996. An approximate minimum degree ordering algorithm.
SIAM Journal on Matrix Analysis and Applications 17(4), 886-905.
Chow, E. 2000. A priori sparsity patterns for parallel sparse approximate inverse preconditioners.
SIAM J. Sci. Comput. 21, 1804-1822.
Duffy, D.J. 2006. Finite difference methods in financial engineering: A partial differential equation
approach. John Wiley and Sons.
Filelis-Papadopoulos, C.K., and Gravvanis, G.A. A class of generic factored and multilevel recursive approximate inverse techniques for solving general sparse systems (submitted).
Grylonakis E-N.G. 2014. On the study and numerical solution of the Black-Scholes equation.
Dissertation Thesis, Department of Electrical and Computer Engineering, Democritus University of
Thrace.
Gustafsson, B. 2008. High order difference methods for time dependent PDE. Springer Series in
Computational Mathematics, Vol.38
Haug, E.G. 2007. The complete guide to option pricing formulas. McGraw-Hill.
Hull, J. 2009. Options, futures and other derivatives. Prentice-Hall.
Jeong, D., Kim, J., and Wee, I-S. 2009. An accurate and efficient numerical method for Black-
Scholes equations. Commun. Korean Math. Soc. 24(4), 617–628

Leentvaar, C.C.W, and Oosterlee, C.W. 2008. On coordinate transformation and grid stretching for sparse grid pricing of basket options. J. Comp. Appl. Math. 222, 193-209.
Persson, J., and von Sydow, L. 2007. Pricing European multi-asset options using a space-time adaptive FD-method. Comput. Vis. Sci. 10, 173–183.
Saad, Y., Schultz, M.H. 1986. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Comp. 7, 856-869.
Süli, E., and Mayers, D.F. 2003. An introduction to numerical analysis. Cambridge University Press.
Trottenberg, U., Osterlee, C.W., and Schuller, A. 2000. Multigrid. Academic Press.
Van der Vorst, H.A. 1992. Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. and Stat. Comput. 13(2), 631–644.
Wilmott, P., Dewynne, J., and Howison, S. 1994. Option pricing: Mathematical models and
computation. Oxford Financial Press.
Zhang, P.G. 1998. Exotic Options: A guide to second-generation options. World Scientific, 2 nd edition.