Searcharxiv⌕ Search

arXiv subjects

Dana Černá

Publications and source records attributed to Dana Černá.

2 recordsLinked to original sources

Option Pricing under Multifactor Black-Scholes Model Using Orthogonal Spline Wavelets

The paper focuses on pricing European-style options on several underlying assets under the Black-Scholes model represented by a nonstationary partial differential equation. The proposed method combines the Galerkin method with $L^2$-orthogonal sparse grid spline wavelets and the Crank-Nicolson scheme with Rannacher time-stepping. To this end, we construct an orthogonal cubic spline wavelet basis on the interval satisfying homogeneous Dirichlet boundary conditions and design a wavelet basis on the unit cube using the sparse tensor product. The method brings the following advantages. First, the number of basis functions is significantly smaller than for the full grid, which makes it possible to overcome the so-called curse of dimensionality. Second, some matrices involved in the computation are identity matrices, which significantly simplifies and streamlines the algorithm, especially in higher dimensions. Further, we prove that discretization matrices have uniformly bounded condition numbers, even without preconditioning, and that the condition numbers do not depend on the dimension of the problem. Due to the use of cubic spline wavelets, the method is higher-order convergent. Numerical experiments are presented for options on the geometric average.

math.NA↗

Quadratic Spline Wavelets with Short Support Satisfying Homogeneous Boundary Conditions

In the paper, we construct a new quadratic spline-wavelet basis on the interval and a unit square satisfying homogeneous Dirichlet boundary conditions of the first order. Wavelets have one vanishing moment and the shortest support among known quadratic spline wavelets adapted to the same type of boundary conditions. Stiffness matrices arising from a discretization of the second-order elliptic problems using the constructed wavelet basis have uniformly bounded condition numbers and the condition numbers are small. We present quantitative properties of the constructed basis. We provide numerical examples to show that the Galerkin method and the adaptive wavelet method using our wavelet basis requires smaller number of iterations than these methods with other quadratic spline wavelet bases. Moreover, due to the short support of the wavelets one iteration requires smaller number of floating point operations.

math.NA↗