8,496 research outputs found
Application of Operator Splitting Methods in Finance
Financial derivatives pricing aims to find the fair value of a financial
contract on an underlying asset. Here we consider option pricing in the partial
differential equations framework. The contemporary models lead to
one-dimensional or multidimensional parabolic problems of the
convection-diffusion type and generalizations thereof. An overview of various
operator splitting methods is presented for the efficient numerical solution of
these problems.
Splitting schemes of the Alternating Direction Implicit (ADI) type are
discussed for multidimensional problems, e.g. given by stochastic volatility
(SV) models. For jump models Implicit-Explicit (IMEX) methods are considered
which efficiently treat the nonlocal jump operator. For American options an
easy-to-implement operator splitting method is described for the resulting
linear complementarity problems.
Numerical experiments are presented to illustrate the actual stability and
convergence of the splitting schemes. Here European and American put options
are considered under four asset price models: the classical Black-Scholes
model, the Merton jump-diffusion model, the Heston SV model, and the Bates SV
model with jumps
Non-negativity preserving numerical algorithms for stochastic differential equations
Construction of splitting-step methods and properties of related
non-negativity and boundary preserving numerical algorithms for solving
stochastic differential equations (SDEs) of Ito-type are discussed. We present
convergence proofs for a newly designed splitting-step algorithm and simulation
studies for numerous numerical examples ranging from stochastic dynamics
occurring in asset pricing theory in mathematical finance (SDEs of CIR and CEV
models) to measure-valued diffusion and superBrownian motion (SPDEs) as met in
biology and physics.Comment: 23 pages, 7 figures. Figures 6.2 and 6.3 in low resolution due to
upload size restrictions. Original resolution at
http://gisc.uc3m.es/~moro/profesional.htm
Method of lines transpose: High order L-stable O(N) schemes for parabolic equations using successive convolution
We present a new solver for nonlinear parabolic problems that is L-stable and
achieves high order accuracy in space and time. The solver is built by first
constructing a single-dimensional heat equation solver that uses fast O(N)
convolution. This fundamental solver has arbitrary order of accuracy in space,
and is based on the use of the Green's function to invert a modified Helmholtz
equation. Higher orders of accuracy in time are then constructed through a
novel technique known as successive convolution (or resolvent expansions).
These resolvent expansions facilitate our proofs of stability and convergence,
and permit us to construct schemes that have provable stiff decay. The
multi-dimensional solver is built by repeated application of dimensionally
split independent fundamental solvers. Finally, we solve nonlinear parabolic
problems by using the integrating factor method, where we apply the basic
scheme to invert linear terms (that look like a heat equation), and make use of
Hermite-Birkhoff interpolants to integrate the remaining nonlinear terms. Our
solver is applied to several linear and nonlinear equations including heat,
Allen-Cahn, and the Fitzhugh-Nagumo system of equations in one and two
dimensions
Optimization of mesh hierarchies in Multilevel Monte Carlo samplers
We perform a general optimization of the parameters in the Multilevel Monte
Carlo (MLMC) discretization hierarchy based on uniform discretization methods
with general approximation orders and computational costs. We optimize
hierarchies with geometric and non-geometric sequences of mesh sizes and show
that geometric hierarchies, when optimized, are nearly optimal and have the
same asymptotic computational complexity as non-geometric optimal hierarchies.
We discuss how enforcing constraints on parameters of MLMC hierarchies affects
the optimality of these hierarchies. These constraints include an upper and a
lower bound on the mesh size or enforcing that the number of samples and the
number of discretization elements are integers. We also discuss the optimal
tolerance splitting between the bias and the statistical error contributions
and its asymptotic behavior. To provide numerical grounds for our theoretical
results, we apply these optimized hierarchies together with the Continuation
MLMC Algorithm. The first example considers a three-dimensional elliptic
partial differential equation with random inputs. Its space discretization is
based on continuous piecewise trilinear finite elements and the corresponding
linear system is solved by either a direct or an iterative solver. The second
example considers a one-dimensional It\^o stochastic differential equation
discretized by a Milstein scheme
- …