اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAlgebraic structure of stochastic expansions and efficient simulation
39
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We investigate the algebraic structure underlying the stochastic Taylor solution expansion for stochastic differential systems.Our motivation is to construct efficient integrators. These are approximations that generate strong numerical integration schemes that are more accurate than the corresponding stochastic Taylor approximation, independent of the governing vector fields and to all orders. The sinhlog integrator introduced by Malham & Wiese (2009) is one example. Herein we: show that the natural context to study stochastic integrators and their properties is the convolution shuffle algebra of endomorphisms; establish a new whole class of efficient integrators; and then prove that, within this class, the sinhlog integrator generates the optimal efficient stochastic integrator at all orders.
قيم البحث
اقرأ أيضاً
We study discrete-time simulation schemes for stochastic Volterra equations, namely the Euler and Milstein schemes, and the corresponding Multi-Level Monte-Carlo method. By using and adapting some results from Zhang [22], together with the Garsia-Rod
emich-Rumsey lemma, we obtain the convergence rates of the Euler scheme and Milstein scheme under the supremum norm. We then apply these schemes to approximate the expectation of functionals of such Volterra equations by the (Multi-Level) Monte-Carlo method, and compute their complexity.
We consider a stochastic volatility model with Levy jumps for a log-return process $Z=(Z_{t})_{tgeq 0}$ of the form $Z=U+X$, where $U=(U_{t})_{tgeq 0}$ is a classical stochastic volatility process and $X=(X_{t})_{tgeq 0}$ is an independent Levy proce
ss with absolutely continuous Levy measure $ u$. Small-time expansions, of arbitrary polynomial order, in time-$t$, are obtained for the tails $bbp(Z_{t}geq z)$, $z>0$, and for the call-option prices $bbe(e^{z+Z_{t}}-1)_{+}$, $z eq 0$, assuming smoothness conditions on the {PaleGrey density of $ u$} away from the origin and a small-time large deviation principle on $U$. Our approach allows for a unified treatment of general payoff functions of the form $phi(x){bf 1}_{xgeq{}z}$ for smooth functions $phi$ and $z>0$. As a consequence of our tail expansions, the polynomial expansions in $t$ of the transition densities $f_{t}$ are also {Green obtained} under mild conditions.
In this paper we present the theoretical framework needed to justify the use of a kernel-based collocation method (meshfree approximation method) to estimate the solution of high-dimensional stochastic partial differential equations (SPDEs). Using an
implicit time stepping scheme, we transform stochastic parabolic equations into stochastic elliptic equations. Our main attention is concentrated on the numerical solution of the elliptic equations at each time step. The estimator of the solution of the elliptic equations is given as a linear combination of reproducing kernels derived from the differential and boundary operators of the SPDE centered at collocation points to be chosen by the user. The random expansion coefficients are computed by solving a random system of linear equations. Numerical experiments demonstrate the feasibility of the method.
We investigate the problem of computing a nested expectation of the form $mathbb{P}[mathbb{E}[X|Y] !geq!0]!=!mathbb{E}[textrm{H}(mathbb{E}[X|Y])]$ where $textrm{H}$ is the Heaviside function. This nested expectation appears, for example, when estimat
ing the probability of a large loss from a financial portfolio. We present a method that combines the idea of using Multilevel Monte Carlo (MLMC) for nested expectations with the idea of adaptively selecting the number of samples in the approximation of the inner expectation, as proposed by (Broadie et al., 2011). We propose and analyse an algorithm that adaptively selects the number of inner samples on each MLMC level and prove that the resulting MLMC method with adaptive sampling has an $mathcal{O}left( varepsilon^{-2}|logvarepsilon|^2 right)$ complexity to achieve a root mean-squared error $varepsilon$. The theoretical analysis is verified by numerical experiments on a simple model problem. We also present a stochastic root-finding algorithm that, combined with our adaptive methods, can be used to compute other risk measures such as Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR), with the latter being achieved with $mathcal{O}left(varepsilon^{-2}right)$ complexity.
Solutions to the stochastic wave equation on the unit sphere are approximated by spectral methods. Strong, weak, and almost sure convergence rates for the proposed numerical schemes are provided and shown to depend only on the smoothness of the drivi
ng noise and the initial conditions. Numerical experiments confirm the theoretical rates. The developed numerical method is extended to stochastic wave equations on higher-dimensional spheres and to the free stochastic Schrodinger equation on the unit sphere.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
