2,108 research outputs found
Global regularity and probabilistic schemes for free boundary surfaces of multivariate American derivatives and their Greeks
In a rather general setting of multivariate stochastic volatility market
models we derive global iterative probabilistic schemes for computing the free
boundary and its Greeks for a generic class of American derivative models using
front-fixing methods. Convergence is closely linked to a proof of global
regularity of the free boundary surface
Multilevel Monte Carlo for Random Degenerate Scalar Convection Diffusion Equation
We consider the numerical solution of scalar, nonlinear degenerate
convection-diffusion problems with random diffusion coefficient and with random
flux functions. Building on recent results on the existence, uniqueness and
continuous dependence of weak solutions on data in the deterministic case, we
develop a definition of random entropy solution. We establish existence,
uniqueness, measurability and integrability results for these random entropy
solutions, generalizing \cite{Mishr478,MishSch10a} to possibly degenerate
hyperbolic-parabolic problems with random data. We next address the numerical
approximation of random entropy solutions, specifically the approximation of
the deterministic first and second order statistics. To this end, we consider
explicit and implicit time discretization and Finite Difference methods in
space, and single as well as Multi-Level Monte-Carlo methods to sample the
statistics. We establish convergence rate estimates with respect to the
discretization parameters, as well as with respect to the overall work,
indicating substantial gains in efficiency are afforded under realistic
regularity assumptions by the use of the Multi-Level Monte-Carlo method.
Numerical experiments are presented which confirm the theoretical convergence
estimates.Comment: 24 Page
A Probabilistic Numerical Method for Fully Nonlinear Parabolic PDEs
We consider the probabilistic numerical scheme for fully nonlinear PDEs
suggested in \cite{cstv}, and show that it can be introduced naturally as a
combination of Monte Carlo and finite differences scheme without appealing to
the theory of backward stochastic differential equations. Our first main result
provides the convergence of the discrete-time approximation and derives a bound
on the discretization error in terms of the time step. An explicit
implementable scheme requires to approximate the conditional expectation
operators involved in the discretization. This induces a further Monte Carlo
error. Our second main result is to prove the convergence of the latter
approximation scheme, and to derive an upper bound on the approximation error.
Numerical experiments are performed for the approximation of the solution of
the mean curvature flow equation in dimensions two and three, and for two and
five-dimensional (plus time) fully-nonlinear Hamilton-Jacobi-Bellman equations
arising in the theory of portfolio optimization in financial mathematics
Hybrid PDE solver for data-driven problems and modern branching
The numerical solution of large-scale PDEs, such as those occurring in
data-driven applications, unavoidably require powerful parallel computers and
tailored parallel algorithms to make the best possible use of them. In fact,
considerations about the parallelization and scalability of realistic problems
are often critical enough to warrant acknowledgement in the modelling phase.
The purpose of this paper is to spread awareness of the Probabilistic Domain
Decomposition (PDD) method, a fresh approach to the parallelization of PDEs
with excellent scalability properties. The idea exploits the stochastic
representation of the PDE and its approximation via Monte Carlo in combination
with deterministic high-performance PDE solvers. We describe the ingredients of
PDD and its applicability in the scope of data science. In particular, we
highlight recent advances in stochastic representations for nonlinear PDEs
using branching diffusions, which have significantly broadened the scope of
PDD.
We envision this work as a dictionary giving large-scale PDE practitioners
references on the very latest algorithms and techniques of a non-standard, yet
highly parallelizable, methodology at the interface of deterministic and
probabilistic numerical methods. We close this work with an invitation to the
fully nonlinear case and open research questions.Comment: 23 pages, 7 figures; Final SMUR version; To appear in the European
Journal of Applied Mathematics (EJAM
Branching diffusion representation of semilinear PDEs and Monte Carlo approximation
We provide a representation result of parabolic semi-linear PD-Es, with
polynomial nonlinearity, by branching diffusion processes. We extend the
classical representation for KPP equations, introduced by Skorokhod (1964),
Watanabe (1965) and McKean (1975), by allowing for polynomial nonlinearity in
the pair , where is the solution of the PDE with space gradient
. Similar to the previous literature, our result requires a non-explosion
condition which restrict to "small maturity" or "small nonlinearity" of the
PDE. Our main ingredient is the automatic differentiation technique as in Henry
Labordere, Tan and Touzi (2015), based on the Malliavin integration by parts,
which allows to account for the nonlinearities in the gradient. As a
consequence, the particles of our branching diffusion are marked by the nature
of the nonlinearity. This new representation has very important numerical
implications as it is suitable for Monte Carlo simulation. Indeed, this
provides the first numerical method for high dimensional nonlinear PDEs with
error estimate induced by the dimension-free Central limit theorem. The
complexity is also easily seen to be of the order of the squared dimension. The
final section of this paper illustrates the efficiency of the algorithm by some
high dimensional numerical experiments
Analytic Regularity and GPC Approximation for Control Problems Constrained by Linear Parametric Elliptic and Parabolic PDEs
This paper deals with linear-quadratic optimal control problems constrained by a parametric or stochastic elliptic or parabolic PDE. We address the (difficult) case that the state equation depends on a countable number of parameters i.e., on with , and that the PDE operator may depend non-affinely on the parameters. We consider tracking-type functionals and distributed as well as boundary controls. Building on recent results in [CDS1, CDS2], we show that the state and the control are analytic as functions depending on these parameters . We
establish sparsity of generalized polynomial chaos (gpc) expansions of both, state and control, in terms of the stochastic coordinate sequence of the random inputs, and prove convergence rates of best -term truncations of these expansions. Such truncations are the key for subsequent computations since they do {\em not} assume that the stochastic input data has a finite expansion. In the follow-up paper [KS2], we explain two methods how such best -term truncations can practically be computed, by greedy-type algorithms
as in [SG, Gi1], or by multilevel Monte-Carlo methods as in
[KSS]. The sparsity result allows in conjunction with adaptive wavelet Galerkin schemes for sparse, adaptive tensor discretizations of control problems constrained by linear elliptic and parabolic PDEs developed in [DK, GK, K], see [KS2]
On a randomized backward Euler method for nonlinear evolution equations with time-irregular coefficients
In this paper we introduce a randomized version of the backward Euler method,
that is applicable to stiff ordinary differential equations and nonlinear
evolution equations with time-irregular coefficients. In the finite-dimensional
case, we consider Carath\'eodory type functions satisfying a one-sided
Lipschitz condition. After investigating the well-posedness and the stability
properties of the randomized scheme, we prove the convergence to the exact
solution with a rate of in the root-mean-square norm assuming only that
the coefficient function is square integrable with respect to the temporal
parameter.
These results are then extended to the numerical solution of
infinite-dimensional evolution equations under monotonicity and Lipschitz
conditions. Here we consider a combination of the randomized backward Euler
scheme with a Galerkin finite element method. We obtain error estimates that
correspond to the regularity of the exact solution. The practicability of the
randomized scheme is also illustrated through several numerical experiments.Comment: 37 pages, 3 figure
Global regularity and probabilistic schemes for free boundary surfaces of multivariate American derivatives and their Greeks
In a rather general setting of multivariate stochastic volatility
market models we derive global iterative probabilistic schemes for computing
the free boundary and its Greeks for a generic class of American derivative
models using front-fixing methods. Establishment of convergence is closely
linked to a proof of global regularity of the free boundary surface
- …