BZPEER
More

Discover

About BZPEERSearchGraph

Research tools

HomeCollectionsResearchCollaborationPublish

Network

ExpertsCommunities

Opportunities

Listings

Account

Log inCreate account
Log inCreate account

Source author record

Christoph Reisinger

Explore this author’s publications, collaborators and research topics. This catalog record has not been claimed by its author.

ResearcherUnclaimed source record
math.NAq-fin.CPmath.PRNumerical AnalysisMachine Learningmath.OCq-fin.STmath.APq-fin.MFq-fin.RMComputational Engineering, Finance, and Sciencemath-phmath.FAmath.MPq-fin.PR

Catalog footprint

Research overview

36works
15topics
4close collaborators

Actions

Is this your work?

Log in to claim
Open graphBrowse papers

Published work

36 publications

preprint2026arXiv

A higher order sparse grid combination technique

We show that a generalised sparse grid combination technique which combines multi-variate extrapolation of finite difference solutions with the standard combination formula lifts a second order accurate scheme on regular meshes to a fourth order combined sparse grid solution. In the analysis, working in a general dimension, we characterise all terms in a multivariate error expansion of the scheme as solutions of a sequence of semi-discrete problems. This is first carried out formally under suitable assumptions on the truncation error of the scheme, stability and regularity of solutions. We then verify the assumptions on the example of the Poisson problem with smooth data, and illustrate the practical convergence in up to seven dimensions.

Open access
preprint2026arXiv

Uniform Scaling Limits in AdamW-Trained Transformers

We study the large-depth limit of transformers trained with AdamW, by modelling the hidden-state dynamics as an interacting particle system (IPS) coupled through the attention mechanism. Under appropriate scaling of the attention heads, we prove that the joint dynamics of the hidden states and backpropagated variables converge in L2L^2, uniformly over the initial condition, to the solution of a forward--backward system of ODEs at rate O(L−1+L−1/3H−1/2)\mathcal O(L^{-1}+L^{-1/3}H^{-1/2}). Here, LL and HH denote the depth and number of heads of the transformer, respectively. The limiting system of ODEs can be identified with a McKean--Vlasov ODE (MVODE) when the attention heads do not incorporate causal masking. By using the flow maps associated with this MVODE and applying concentration of measure techniques, we obtain bounds on the difference between the discrete and continuous models that are uniform over compact sets of initial conditions. As this is achieved without resorting to a covering argument, the constants in our bounds are independent of the number of tokens. Furthermore, under a suitable adaptation to AdamW, the bounds become independent of the token embedding dimension.

Open access
preprint2026arXiv

Weighted Conditional Flow Matching

Conditional flow matching (CFM) has emerged as a powerful framework for training continuous normalizing flows due to its computational efficiency and effectiveness. However, standard CFM often produces paths that deviate significantly from straight-line interpolations between prior and target distributions, making generation slower and less accurate due to the need for fine discretization at inference. Recent methods enhance CFM performance by inducing shorter and straighter trajectories but typically rely on computationally expensive mini-batch optimal transport (OT). Drawing insights from entropic optimal transport (EOT), we propose Weighted Conditional Flow Matching (W-CFM), a novel approach that modifies the classical CFM loss by weighting each training pair (x,y)(x, y) with a Gibbs kernel. We show that this weighting recovers the entropic OT coupling up to some bias in the marginals, and we provide the conditions under which the marginals remain nearly unchanged. Moreover, we establish an equivalence between W-CFM and the minibatch OT method in the large-batch limit, showing how our method overcomes computational and performance bottlenecks linked to batch size. Empirically, we test our method on unconditional generation on various synthetic and real datasets, confirming that W-CFM achieves comparable or superior sample quality, fidelity, and diversity to other alternative baselines while maintaining the computational efficiency of vanilla CFM.

Open access
preprint2022arXiv

Convergence of a time-stepping scheme to the free boundary in the supercooled Stefan problem

The supercooled Stefan problem and its variants describe the freezing of a supercooled liquid in physics, as well as the large system limits of systemic risk models in finance and of integrate-and-fire models in neuroscience. Adopting the physics terminology, the supercooled Stefan problem is known to feature a finite-time blow-up of the freezing rate for a wide range of initial temperature distributions in the liquid. Such a blow-up can result in a discontinuity of the liquid-solid boundary. In this paper, we prove that the natural Euler time-stepping scheme applied to a probabilistic formulation of the supercooled Stefan problem converges to the liquid-solid boundary of its physical solution globally in time, in the Skorokhod M1 topology. In the course of the proof, we give an explicit bound on the rate of local convergence for the time-stepping scheme. We also run numerical tests to compare our theoretical results to the practically observed convergence behavior.

Open access
preprint2022arXiv

Estimating risks of option books using neural-SDE market models

In this paper, we examine the capacity of an arbitrage-free neural-SDE market model to produce realistic scenarios for the joint dynamics of multiple European options on a single underlying. We subsequently demonstrate its use as a risk simulation engine for option portfolios. Through backtesting analysis, we show that our models are more computationally efficient and accurate for evaluating the Value-at-Risk (VaR) of option portfolios, with better coverage performance and less procyclicality than standard filtered historical simulation approaches.

Open access
preprint2022arXiv

Hedging option books using neural-SDE market models

We study the capability of arbitrage-free neural-SDE market models to yield effective strategies for hedging options. In particular, we derive sensitivity-based and minimum-variance-based hedging strategies using these models and examine their performance when applied to various option portfolios using real-world data. Through backtesting analysis over typical and stressed market periods, we show that neural-SDE market models achieve lower hedging errors than Black--Scholes delta and delta-vega hedging consistently over time, and are less sensitive to the tenor choice of hedging instruments. In addition, hedging using market models leads to similar performance to hedging using Heston models, while the former tends to be more robust during stressed market periods.

Open access
preprint2022arXiv

Implicit and fully discrete approximation of the supercooled Stefan problem in the presence of blow-ups

We consider two implicit approximation schemes of the one-dimensional supercooled Stefan problem and prove their convergence, even in the presence of finite time blow-ups. All proofs are based on a probabilistic reformulation recently considered in the literature. The first scheme is a version of the time-stepping scheme studied in V. Kaushansky, C. Reisinger, M. Shkolnikov, and Z. Q. Song, arXiv:2010.05281, 2020, but here the flux over the free boundary and its velocity are coupled implicitly. Moreover, we extend the analysis to more general driving processes than Brownian motion. The second scheme is a Donsker-type approximation, also interpretable as an implicit finite difference scheme, for which global convergence is shown under minor technical conditions. With stronger assumptions, which apply in cases without blow-ups, we obtain additionally a convergence rate arbitrarily close to 1/2. Our numerical results suggest that this rate also holds for less regular solutions, in contrast to explicit schemes, and allow a sharper resolution of the discontinuous free boundary in the blow-up regime.

Open access
preprint2020arXiv

A neural network based policy iteration algorithm with global H2H^2-superlinear convergence for stochastic games on domains

In this work, we propose a class of numerical schemes for solving semilinear Hamilton-Jacobi-Bellman-Isaacs (HJBI) boundary value problems which arise naturally from exit time problems of diffusion processes with controlled drift. We exploit policy iteration to reduce the semilinear problem into a sequence of linear Dirichlet problems, which are subsequently approximated by a multilayer feedforward neural network ansatz. We establish that the numerical solutions converge globally in the H2H^2-norm, and further demonstrate that this convergence is superlinear, by interpreting the algorithm as an inexact Newton iteration for the HJBI equation. Moreover, we construct the optimal feedback controls from the numerical value functions and deduce convergence. The numerical schemes and convergence results are then extended to HJBI boundary value problems corresponding to controlled diffusion processes with oblique boundary reflection. Numerical experiments on the stochastic Zermelo navigation problem are presented to illustrate the theoretical results and to demonstrate the effectiveness of the method.

Open access
preprint2020arXiv

Duality-based a posteriori error estimates for some approximation schemes for optimal investment problems

We consider a Markov chain approximation scheme for utility maximization problems in continuous time, which uses, in turn, a piecewise constant policy approximation, Euler-Maruyama time stepping, and a Gauss-Hermite approximation of the Gaussian increments. The error estimates previously derived in Picarelli and Reisinger (2019) are asymmetric between lower and upper bounds due to the control approximation and improve on known results in the literature in the lower case only. In the present paper, we use duality results to obtain a posteriori upper error bounds which are empirically of the same order as the lower bounds. The theoretical results are confirmed by our numerical tests.

Open access
preprint2020arXiv

Error estimates of penalty schemes for quasi-variational inequalities arising from impulse control problems

This paper proposes penalty schemes for a class of weakly coupled systems of Hamilton-Jacobi-Bellman quasi-variational inequalities (HJBQVIs) arising from stochastic hybrid control problems of regime-switching models with both continuous and impulse controls. We show that the solutions of the penalized equations converge monotonically to those of the HJBQVIs. We further establish that the schemes are half-order accurate for HJBQVIs with Lipschitz coefficients, and first-order accurate for equations with more regular coefficients. Moreover, we construct the action regions and optimal impulse controls based on the error estimates and the penalized solutions. The penalty schemes and convergence results are then extended to HJBQVIs with possibly negative impulse costs. We also demonstrate the convergence of monotone discretizations of the penalized equations, and establish that policy iteration applied to the discrete equation is monotonically convergent with an arbitrary initial guess in an infinite dimensional setting. Numerical examples for infinite-horizon optimal switching problems are presented to illustrate the effectiveness of the penalty schemes over the conventional direct control scheme.

Open access
preprint2020arXiv

Executive stock option exercise with full and partial information on a drift change point

We analyse the optimal exercise of an executive stock option (ESO) written on a stock whose drift parameter falls to a lower value at a change point, an exponentially distributed random time independent of the Brownian motion driving the stock. Two agents, who do not trade the stock, have differing information on the change point, and seek to optimally exercise the option by maximising its discounted payoff under the physical measure. The first agent has full information, and observes the change point. The second agent has partial information and filters the change point from price observations. This scenario is designed to mimic the positions of two employees of varying seniority, a fully informed executive and a partially informed less senior employee, each of whom receives an ESO. The partial information scenario yields a model under the observation filtration F^\widehat{\mathbb{F}} in which the stock drift becomes a diffusion driven by the innovations process, an F^\widehat{\mathbb{F}}-Brownian motion also driving the stock under F^\widehat{\mathbb{F}}, and the partial information optimal stopping value function has two spatial dimensions. We rigorously characterise the free boundary PDEs for both agents, establish shape and regularity properties of the associated optimal exercise boundaries, and prove the smooth pasting property in both information scenarios, exploiting some stochastic flow ideas to do so in the partial information case. We develop finite difference algorithms to numerically solve both agents' exercise and valuation problems and illustrate that the additional information of the fully informed agent can result in exercise patterns which exploit the information on the change point, lending credence to empirical studies which suggest that privileged information of bad news is a factor leading to early exercise of ESOs prior to poor stock price performance.

Open access
preprint2020arXiv

Probabilistic error analysis for some approximation schemes to optimal control problems

We introduce a class of numerical schemes for optimal control problems based on a novel Markov chain approximation, which uses, in turn, a piecewise constant policy approximation, Euler-Maruyama time stepping, and a Gauss-Hermite approximation of the Gaussian increments. We provide lower error bounds of order arbitrarily close to 1/2 in time and 1/3 in space for Lipschitz viscosity solutions, coupling probabilistic arguments with regularization techniques as introduced by Krylov. The corresponding order of the upper bounds is 1/4 in time and 1/5 in space. For sufficiently regular solutions, the order is 1 in both time and space for both bounds. Finally, we propose techniques for further improving the accuracy of the individual components of the approximation.

Open access
preprint2020arXiv

Rectified deep neural networks overcome the curse of dimensionality for nonsmooth value functions in zero-sum games of nonlinear stiff systems

In this paper, we establish that for a wide class of controlled stochastic differential equations (SDEs) with stiff coefficients, the value functions of corresponding zero-sum games can be represented by a deep artificial neural network (DNN), whose complexity grows at most polynomially in both the dimension of the state equation and the reciprocal of the required accuracy. Such nonlinear stiff systems may arise, for example, from Galerkin approximations of controlled stochastic partial differential equations (SPDEs), or controlled PDEs with uncertain initial conditions and source terms. This implies that DNNs can break the curse of dimensionality in numerical approximations and optimal control of PDEs and SPDEs. The main ingredient of our proof is to construct a suitable discrete-time system to effectively approximate the evolution of the underlying stochastic dynamics. Similar ideas can also be applied to obtain expression rates of DNNs for value functions induced by stiff systems with regime switching coefficients and driven by general Lévy noise.

Open access
preprint2020arXiv

Well-posedness and tamed schemes for McKean-Vlasov Equations with Common Noise

In this paper, we first establish well-posedness of McKean-Vlasov stochastic differential equations (McKean-Vlasov SDEs) with common noise, possibly with coefficients having super-linear growth in the state variable. Second, we present stable time-stepping schemes for this class of McKean-Vlasov SDEs. Specifically, we propose an explicit tamed Euler and tamed Milstein scheme for an interacting particle system associated with the McKean-Vlasov equation. We prove stability and strong convergence of order 1/21/2 and 11, respectively. To obtain our main results, we employ techniques from calculus on the Wasserstein space. The proof for the strong convergence of the tamed Milstein scheme only requires the coefficients to be once continuously differentiable in the state and measure component. To demonstrate our theoretical findings, we present several numerical examples, including mean-field versions of the stochastic 3/23/2 volatility model and the stochastic double well dynamics with multiplicative noise.

Open access
preprint2019arXiv

A numerical scheme for the quantile hedging problem

We consider the numerical approximation of the quantile hedging price in a non-linear market. In a Markovian framework, we propose a numerical method based on a Piecewise Constant Policy Timestepping (PCPT) scheme coupled with a monotone finite difference approximation. We prove the convergence of our algorithm combining BSDE arguments with the Barles & Jakobsen and Barles & Souganidis approaches for non-linear equations. In a numerical section, we illustrate the efficiency of our scheme by considering a financial example in a market with imperfections.

Open access
preprint2016arXiv

A Forward Equation for Barrier Options under the Brunick&Shreve Markovian Projection

We derive a forward equation for arbitrage-free barrier option prices, in terms of Markovian projections of the stochastic volatility process, in continuous semi-martingale models. This provides a Dupire-type formula for the coefficient derived by Brunick and Shreve for their mimicking diffusion and can be interpreted as the canonical extension of local volatility for barrier options. Alternatively, a forward partial-integro differential equation (PIDE) is introduced which provides up-and-out call prices, under a Brunick-Shreve model, for the complete set of strikes, barriers and maturities in one solution step. Similar to the vanilla forward PDE, the above-named forward PIDE can serve as a building block for an efficient calibration routine including barrier option quotes. We provide a discretisation scheme for the PIDE as well as a numerical validation.

Open access
preprint2016arXiv

A mixed Monte Carlo and PDE variance reduction method for foreign exchange options under the Heston-CIR model

In this paper, the valuation of European and path-dependent options in foreign exchange (FX) markets is considered when the currency exchange rate evolves according to the Heston model combined with the Cox-Ingersoll-Ross dynamics for the stochastic domestic and foreign short interest rates. The mixed Monte Carlo/PDE method requires that we simulate only the paths of the squared volatility and the two interest rates, while an "inner" Black-Scholes-type expectation is evaluated by means of a PDE. This can lead to a substantial variance reduction and complexity improvements under certain circumstances depending on the contract and the model parameters. In this work, we establish the uniform boundedness of moments of the exchange rate process and its approximation, and prove strong convergence in LpL^p (p≥1p\geq1) of the latter. Then, we carry out a variance reduction analysis and obtain accurate approximations for quantities of interest. All theoretical contributions can be extended to multi-factor short rates in a straightforward manner. Finally, we illustrate the efficiency of the method for the four-factor Heston-CIR model through a detailed quantitative assessment.

Open access
preprint2016arXiv

A partial Fourier transform method for a class of hypoelliptic Kolmogorov equations

We consider hypoelliptic Kolmogorov equations in n+1n+1 spatial dimensions, with n≥1n\geq 1, where the differential operator in the first nn spatial variables featuring in the equation is second-order elliptic, and with respect to the (n+1)(n+1)st spatial variable the equation contains a pure transport term only and is therefore first-order hyperbolic. If the two differential operators, in the first nn and in the (n+1)(n+1)st co-ordinate directions, do not commute, we benefit from hypoelliptic regularization in time, and the solution for t>0t>0 is smooth even for a Dirac initial datum prescribed at t=0t=0. We study specifically the case where the coefficients depend only on the first nn variables. In that case, a Fourier transform in the last variable and standard central finite difference approximation in the other variables can be applied for the numerical solution. We prove second-order convergence in the spatial mesh size for the model hypoelliptic equation ∂u∂t+x∂u∂y=∂2u∂x2\frac{\partial u}{\partial t} + x \frac{\partial u}{\partial y} = \frac{\partial^2 u}{\partial x^2} subject to the initial condition u(x,y,0)=δ(x)δ(y)u(x,y,0) = δ(x) δ(y), with (x,y)∈R×R(x,y) \in \mathbb{R} \times\mathbb{R} and t>0t>0, proposed by Kolmogorov, and for an extension with n=2n=2. We also demonstrate exponential convergence of an approximation of the inverse Fourier transform based on the trapezium rule. Lastly, we apply the method to a PDE arising in mathematical finance, which models the distribution of the hedging error under a mis-specified derivative pricing model.

Open access
preprint2016arXiv

Boundary Treatment and Multigrid Preconditioning for Semi-Lagrangian Schemes Applied to Hamilton-Jacobi-Bellman Equations

We analyse two practical aspects that arise in the numerical solution of Hamilton-Jacobi-Bellman (HJB) equations by a particular class of monotone approximation schemes known as semi-Lagrangian schemes. These schemes make use of a wide stencil to achieve convergence and result in discretization matrices that are less sparse and less local than those coming from standard finite difference schemes. This leads to computational difficulties not encountered there. In particular, we consider the overstepping of the domain boundary and analyse the accuracy and stability of stencil truncation. This truncation imposes a stricter CFL condition for explicit schemes in the vicinity of boundaries than in the interior, such that implicit schemes become attractive. We then study the use of geometric, algebraic and aggregation-based multigrid preconditioners to solve the resulting discretised systems from implicit time stepping schemes efficiently. Finally, we illustrate the performance of these techniques numerically for benchmark test cases from the literature.

Open access
preprint2016arXiv

Convergence of an Euler scheme for a hybrid stochastic-local volatility model with stochastic rates in foreign exchange markets

We study the Heston-Cox-Ingersoll-Ross++ stochastic-local volatility model in the context of foreign exchange markets and propose a Monte Carlo simulation scheme which combines the full truncation Euler scheme for the stochastic volatility component and the stochastic domestic and foreign short interest rates with the log-Euler scheme for the exchange rate. We establish the exponential integrability of full truncation Euler approximations for the Cox-Ingersoll-Ross process and find a lower bound on the explosion time of these exponential moments. Under a full correlation structure and a realistic set of assumptions on the so-called leverage function, we prove the strong convergence of the exchange rate approximations and deduce the convergence of Monte Carlo estimators for a number of vanilla and path-dependent options. Then, we perform a series of numerical experiments for an autocallable barrier dual currency note.

Open access
preprint2016arXiv

Error analysis of truncated expansion solutions to high-dimensional parabolic PDEs

We study an expansion method for high-dimensional parabolic PDEs which constructs accurate approximate solutions by decomposition into solutions to lower-dimensional PDEs, and which is particularly effective if there are a low number of dominant principal components. The focus of the present article is the derivation of sharp error bounds for the constant coefficient case and a first and second order approximation. We give a precise characterisation when these bounds hold for (non-smooth) option pricing applications and provide numerical results demonstrating that the practically observed convergence speed is in agreement with the theoretical predictions.

Open access
preprint2016arXiv

High-order filtered schemes for time-dependent second order HJB equations

In this paper, we present and analyse a class of "filtered" numerical schemes for second order Hamilton-Jacobi-Bellman equations. Our approach follows the ideas introduced in B.D. Froese and A.M. Oberman, Convergent filtered schemes for the Monge-Ampère partial differential equation, SIAM J. Numer. Anal., 51(1):423--444, 2013, and more recently applied by other authors to stationary or time-dependent first order Hamilton-Jacobi equations. For high order approximation schemes (where "high" stands for greater than one), the inevitable loss of monotonicity prevents the use of the classical theoretical results for convergence to viscosity solutions. The work introduces a suitable local modification of these schemes by "filtering" them with a monotone scheme, such that they can be proven convergent and still show an overall high order behaviour for smooth enough solutions. We give theoretical proofs of these claims and illustrate the behaviour with numerical tests from mathematical finance, focussing also on the use of backward difference formulae (BDF) for constructing the high order schemes.

Open access
preprint2016arXiv

Numerical analysis of an extended structural default model with mutual liabilities and jump risk

We consider a structural default model in an interconnected banking network as in Lipton [International Journal of Theoretical and Applied Finance, 19(6), 2016], with mutual obligations between each pair of banks. We analyse the model numerically for two banks with jumps in their asset value processes. Specifically, we develop a finite difference method for the resulting two-dimensional partial integro-differential equation, and study its stability and consistency. We then compute joint and marginal survival probabilities, as well as prices of credit default swaps (CDS), first-to-default swaps (FTD), credit and debt value adjustments (CVA and DVA). Finally, we calibrate the model to market data and assess the impact of jump risk.

Open access
preprint2016arXiv

Piecewise Constant Policy Approximations to Hamilton-Jacobi-Bellman Equations

An advantageous feature of piecewise constant policy timestepping for Hamilton-Jacobi-Bellman (HJB) equations is that different linear approximation schemes, and indeed different meshes, can be used for the resulting linear equations for different control parameters. Standard convergence analysis suggests that monotone (i.e., linear) interpolation must be used to transfer data between meshes. Using the equivalence to a switching system and an adaptation of the usual arguments based on consistency, stability and monotonicity, we show that if limited, potentially higher order interpolation is used for the mesh transfer, convergence is guaranteed. We provide numerical tests for the mean-variance optimal investment problem and the uncertain volatility option pricing model, and compare the results to published test cases.

Open access
preprint2016arXiv

The non-locality of Markov chain approximations to two-dimensional diffusions

In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We derive conditions on the diffusion coefficients which permit transition probabilities to match locally first and second moments. We derive a novel formula which expresses how the matching becomes more difficult for larger (absolute) correlations and strongly anisotropic processes, such that instantaneous moves to more distant neighbours on the lattice have to be allowed. Roughly speaking, for non-zero correlations, the distance covered in one timestep is proportional to the ratio of volatilities in the two directions. We discuss the implications to Markov decision processes and the convergence analysis of approximations to Hamilton-Jacobi-Bellman equations in the Barles-Souganidis framework.

Open access
preprint2015arXiv

Exponential integrability properties of Euler discretization schemes for the Cox-Ingersoll-Ross process

We analyze exponential integrability properties of the Cox-Ingersoll-Ross (CIR) process and its Euler discretizations with various types of truncation and reflection at 0. These properties play a key role in establishing the finiteness of moments and the strong convergence of numerical approximations for a class of stochastic differential equations arising in finance. We prove that both implicit and explicit Euler-Maruyama discretizations for the CIR process preserve the exponential integrability of the exact solution for a wide range of parameters, and find lower bounds on the explosion time.

Open access
preprint2014arXiv

Modelling of dependence in high-dimensional financial time series by cluster-derived canonical vines

We extend existing models in the financial literature by introducing a cluster-derived canonical vine (CDCV) copula model for capturing high dimensional dependence between financial time series. This model utilises a simplified market-sector vine copula framework similar to those introduced by Heinen and Valdesogo (2008) and Brechmann and Czado (2013), which can be applied by conditioning asset time series on a market-sector hierarchy of indexes. While this has been shown by the aforementioned authors to control the excessive parameterisation of vine copulas in high dimensions, their models have relied on the provision of externally sourced market and sector indexes, limiting their wider applicability due to the imposition of restrictions on the number and composition of such sectors. By implementing the CDCV model, we demonstrate that such reliance on external indexes is redundant as we can achieve equivalent or improved performance by deriving a hierarchy of indexes directly from a clustering of the asset time series, thus abstracting the modelling process from the underlying data.

Open access
preprint2013arXiv

Numerical Valuation of Derivatives in High-Dimensional Settings via PDE Expansions

In this article, we propose a new numerical approach to high-dimensional partial differential equations (PDEs) arising in the valuation of exotic derivative securities. The proposed method is extended from Reisinger and Wittum (2007) and uses principal component analysis (PCA) of the underlying process in combination with a Taylor expansion of the value function into solutions to low-dimensional PDEs. The approximation is related to anchored analysis of variance (ANOVA) decompositions and is expected to be accurate whenever the covariance matrix has one or few dominating eigenvalues. A main purpose of the present article is to give a careful analysis of the numerical accuracy and computational complexity compared to state-of-the-art Monte Carlo methods on the example of Bermudan swaptions and Ratchet floors, which are considered difficult benchmark problems. We are able to demonstrate that for problems with medium to high dimensionality and moderate time horizons the presented PDE method delivers results comparable in accuracy to the MC methods considered here in similar or (often significantly) faster runtime.

Open access
preprint2013arXiv

The Effect of Non-Smooth Payoffs on the Penalty Approximation of American Options

This article combines various methods of analysis to draw a comprehensive picture of penalty approximations to the value, hedge ratio, and optimal exercise strategy of American options. While convergence of the penalised solution for sufficiently smooth obstacles is well established in the literature, sharp rates of convergence and particularly the effect of gradient discontinuities (i.e., the omni-present `kinks' in option payoffs) on this rate have not been fully analysed so far. This effect becomes important not least when using penalisation as a numerical technique. We use matched asymptotic expansions to characterise the boundary layers between exercise and hold regions, and to compute first order corrections for representative payoffs on a single asset following a diffusion or jump-diffusion model. Furthermore, we demonstrate how the viscosity theory framework in [Jakobsen, 2006] can be applied to this setting to derive upper and lower bounds on the value. In a small extension to [Bensoussan & Lions, 1982], we derive weak convergence rates also for option sensitivities for convex payoffs under jump-diffusion models. Finally, we outline applications of the results, including accuracy improvements by extrapolation.

Open access
preprint2012arXiv

Mean-square stability and error analysis of implicit time-stepping schemes for linear parabolic SPDEs with multiplicative Wiener noise in the first derivative

In this article, we extend a Milstein finite difference scheme introduced in [Giles & Reisinger(2011)] for a certain linear stochastic partial differential equation (SPDE), to semi- and fully implicit timestepping as introduced by [Szpruch(2010)] for SDEs. We combine standard finite difference Fourier analysis for PDEs with the linear stability analysis in [Buckwar & Sickenberger(2011)] for SDEs, to analyse the stability and accuracy. The results show that Crank-Nicolson timestepping for the principal part of the drift with a partially implicit but negatively weighted double Itô integral gives unconditional stability over all parameter values, and converges with the expected order in the mean-square sense. This opens up the possibility of local mesh refinement in the spatial domain, and we show experimentally that this can be beneficial in the presence of reduced regularity at boundaries.

Open access
preprint2012arXiv

Stochastic finite differences and multilevel Monte Carlo for a class of SPDEs in finance

In this article, we propose a Milstein finite difference scheme for a stochastic partial differential equation (SPDE) describing a large particle system. We show, by means of Fourier analysis, that the discretisation on an unbounded domain is convergent of first order in the timestep and second order in the spatial grid size, and that the discretisation is stable with respect to boundary data. Numerical experiments clearly indicate that the same convergence order also holds for boundary-value problems. Multilevel path simulation, previously used for SDEs, is shown to give substantial complexity gains compared to a standard discretisation of the SPDE or direct simulation of the particle system. We derive complexity bounds and illustrate the results by an application to basket credit derivatives.

Open access
preprint2011arXiv

Analysis of Linear Difference Schemes in the Sparse Grid Combination Technique

Sparse grids are tailored to the approximation of smooth high-dimensional functions. On a dd-dimensional tensor product space, the number of grid points is N=O(h−1∣log⁡h∣d−1)N = \mathcal O(h^{-1} |\log h|^{d-1}), where hh is a mesh parameter. The so-called combination technique, based on hierarchical decomposition and extrapolation, requires specific multivariate error expansions of the discretisation error on Cartesian grids to hold. We derive such error expansions for linear difference schemes through an error correction technique of semi-discretisations. We obtain overall error formulae of the type ε=O(hp∣log⁡h∣d−1)ε= \mathcal{O} (h^p |\log h|^{d-1}) and analyse the convergence, with its dependence on dimension and smoothness, by examples of linear elliptic and parabolic problems, with numerical illustrations in up to eight dimensions.

Open access
preprint2011arXiv

On the Use of Policy Iteration as an Easy Way of Pricing American Options

In this paper, we demonstrate that policy iteration, introduced in the context of HJB equations in [Forsyth & Labahn, 2007], is an extremely simple generic algorithm for solving linear complementarity problems resulting from the finite difference and finite element approximation of American options. We show that, in general, O(N) is an upper and lower bound on the number of iterations needed to solve a discrete LCP of size N. If embedded in a class of standard discretisations with M time steps, the overall complexity of American option pricing is indeed only O(N(M+N)), and, therefore, for M N, identical to the pricing of European options, which is O(MN). We also discuss the numerical properties and robustness with respect to model parameters in relation to penalty and projected relaxation methods.

Open access
preprint2011arXiv

Penalty Methods for the Solution of Discrete HJB Equations -- Continuous Control and Obstacle Problems

In this paper, we present a novel penalty approach for the numerical solution of continuously controlled HJB equations and HJB obstacle problems. Our results include estimates of the penalisation error for a class of penalty terms, and we show that variations of Newton's method can be used to obtain globally convergent iterative solvers for the penalised equations. Furthermore, we discuss under what conditions local quadratic convergence of the iterative solvers can be expected. We include numerical results demonstrating the competitiveness of our methods.

Open access
preprint2011arXiv

Stochastic evolution equations in portfolio credit modelling with applications to exotic credit products

We consider a structural credit model for a large portfolio of credit risky assets where the correlation is due to a market factor. By considering the large portfolio limit of this system we show the existence of a density process for the asset values. This density evolves according to a stochastic partial differential equation and we establish existence and uniqueness for the solution taking values in a suitable function space. The loss function of the portfolio is then a function of the evolution of this density at the default boundary. We develop numerical methods for pricing and calibration of the model to credit indices and consider its performance pre and post credit crunch. Finally, we give further examples illustrating the valuation of exotic credit products, specifically forward starting CDOs.

Open access
preprint2010arXiv

A Penalty Method for the Numerical Solution of Hamilton-Jacobi-Bellman (HJB) Equations in Finance

We present a simple and easy to implement method for the numerical solution of a rather general class of Hamilton-Jacobi-Bellman (HJB) equations. In many cases, the considered problems have only a viscosity solution, to which, fortunately, many intuitive (e.g. finite difference based) discretisations can be shown to converge. However, especially when using fully implicit time stepping schemes with their desirable stability properties, one is still faced with the considerable task of solving the resulting nonlinear discrete system. In this paper, we introduce a penalty method which approximates the nonlinear discrete system to first order in the penalty parameter, and we show that an iterative scheme can be used to solve the penalised discrete problem in finitely many steps. We include a number of examples from mathematical finance for which the described approach yields a rigorous numerical scheme and present numerical results.

Open access

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.