2008
DOI: 10.1016/j.cam.2007.10.039
|View full text |Cite
|
Sign up to set email alerts
|

Multi-dimensional option pricing using radial basis functions and the generalized Fourier transform

Abstract: We show that the generalized Fourier transform can be used for reducing the computational cost and memory requirements of radial basis function methods for multi-dimensional option pricing. We derive a general algorithm, including a transformation of the Black-Scholes equation into the heat equation, that can be used in any number of dimensions. Numerical experiments in two and three dimensions show that the gain is substantial even for small problem sizes. Furthermore, the gain increases with the number of di… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 41 publications
(25 citation statements)
references
References 25 publications
(39 reference statements)
0
25
0
Order By: Relevance
“…Fausshauer et al, 2004a;Hon and Mao, 1999;Larsson et al, 2008;Pettersson et al, 2008) In these cases, L is a second order elliptic differential operator, and the computation of (LΦ) X is straightforward. For jump-diffusions, which are finite activity, this algorithm (and its companion version for American options below) has been implemented and studied in (Chan, 2010; with different choices of basis functions (inverse multi-quadric and cubic spline, respectively).…”
Section: Determine the Rbf-interpolantmentioning
confidence: 99%
See 1 more Smart Citation
“…Fausshauer et al, 2004a;Hon and Mao, 1999;Larsson et al, 2008;Pettersson et al, 2008) In these cases, L is a second order elliptic differential operator, and the computation of (LΦ) X is straightforward. For jump-diffusions, which are finite activity, this algorithm (and its companion version for American options below) has been implemented and studied in (Chan, 2010; with different choices of basis functions (inverse multi-quadric and cubic spline, respectively).…”
Section: Determine the Rbf-interpolantmentioning
confidence: 99%
“…(e.g. Fausshauer et al, 2004a;Hon and Mao, 1999;Larsson et al, 2008;Pettersson et al, 2008). (Chan, 2010) and (Chan, 2011) extended these studies to jump-diffusion models, which are finite activity.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore two different matrices need to be factorised. In order to avoid this we use the BDF-2 scheme as described in [11].…”
Section: The Penalty Methodsmentioning
confidence: 99%
“…, N t . In [11] it is shown how the time steps can be chosen in such a way that β n 0 ≡ β 0 . Then the coefficient matrix is the same in all time steps and only one matrix factorisation is needed.…”
Section: The Penalty Methodsmentioning
confidence: 99%
“…, N t . In [38] it is shown how the time steps can be chosen in such a way that β n 0 ≡ β 0 . Then the coefficient matrix is the same in all time steps and only one matrix factorization is needed.…”
Section: The Bdf-2 Time Stepping Schemementioning
confidence: 99%