- Journal Home
- Volume 22 - 2025
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
In this paper we develop two novel numerical methods for the partial integral differential equation arising from the valuation of an option whose underlying asset is governed by a jump diffusion process. These methods are based on a fitted finite volume method for the spatial discretization, an implicit-explicit time stepping scheme and the Crank-Nicolson time stepping method. We show that the discretization methods are unconditionally stable in time and the system matrices of the resulting linear systems are M-matrices. The resulting linear systems involve products of a dense matrix and vectors and an Fast Fourier Transformation (FFT) technique is used for the evaluation of these products. Furthermore, a splitting technique is proposed for the solution of the discretized system arising from the Crank-Nicolson scheme. Numerical results are presented to show the rates of convergence and the robustness of the numerical method.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/758.html} }In this paper we develop two novel numerical methods for the partial integral differential equation arising from the valuation of an option whose underlying asset is governed by a jump diffusion process. These methods are based on a fitted finite volume method for the spatial discretization, an implicit-explicit time stepping scheme and the Crank-Nicolson time stepping method. We show that the discretization methods are unconditionally stable in time and the system matrices of the resulting linear systems are M-matrices. The resulting linear systems involve products of a dense matrix and vectors and an Fast Fourier Transformation (FFT) technique is used for the evaluation of these products. Furthermore, a splitting technique is proposed for the solution of the discretized system arising from the Crank-Nicolson scheme. Numerical results are presented to show the rates of convergence and the robustness of the numerical method.