اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMean-square convergence rates of implicit Milstein type methods for SDEs with non-Lipschitz coefficients: applications to financial models
132
0
0.0
(
0
)
تأليف
Xiaojie Wang
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A novel class of implicit Milstein type methods is devised and analyzed in the present work for stochastic differential equations (SDEs) with non-globally Lipschitz drift and diffusion coefficients. By incorporating a pair of method parameters $theta, eta in [0, 1]$ into both the drift and diffusion parts, the new schemes can be viewed as a kind of double implicit methods, which also work for non-commutative noise driven SDEs. Within a general framework, we offer upper mean-square error bounds for the proposed schemes, based on certain error terms only getting involved with the exact solution processes. Such error bounds help us to easily analyze mean-square convergence rates of the schemes, without relying on a priori high-order moment estimates of numerical approximations. Putting further globally polynomial growth condition, we successfully recover the expected mean-square convergence rate of order one for the considered schemes with $theta in [tfrac12, 1]$, solving general SDEs in various circumstances. As applications, some of the proposed schemes are also applied to solve two scalar SDE models arising in mathematical finance and evolving in the positive domain $(0, infty)$. More specifically, the particular drift-diffusion implicit Milstein method ($ theta = eta = 1 $) is utilized to approximate the Heston $tfrac32$-volatility model and the semi-implicit Milstein method ($theta =1, eta = 0$) is used to solve the Ait-Sahalia interest rate model. With the aid of the previously obtained error bounds, we reveal a mean-square convergence rate of order one of the positivity preserving schemes for the first time under more relaxed conditions, compared with existing relevant results for first order schemes in the literature. Numerical examples are finally reported to confirm the previous findings.
قيم البحث
اقرأ أيضاً
Parametric sensitivity analysis is a critical component in the study of mathematical models of physical systems. Due to its simplicity, finite difference methods are used extensively for this analysis in the study of stochastically modeled reaction n
etworks. Different coupling methods have been proposed to build finite difference estimators, with the split coupling, also termed the stacked coupling, yielding the lowest variance in the vast majority of cases. Analytical results related to this coupling are sparse, and include an analysis of the variance of the coupled processes under the assumption of globally Lipschitz intensity functions [Anderson, SIAM Numerical Analysis, Vol. 50, 2012]. Because of the global Lipschitz assumption utilized in [Anderson, SIAM Numerical Analysis, Vol. 50, 2012], the main result there is only applicable to a small percentage of the models found in the literature, and it was conjectured that similar results should hold for a much wider class of models. In this paper we demonstrate this conjecture to be true by proving the variance of the coupled processes scales in the desired manner for a large class of non-Lipschitz models. We further extend the analysis to allow for time dependence in the parameters. In particular, binary systems with or without time-dependent rate parameters, a class of models that accounts for the vast majority of systems considered in the literature, satisfy the assumptions of our theory.
In this article, we construct and analyse explicit numerical splitting methods for a class of semi-linear stochastic differential equations (SDEs) with additive noise, where the drift is allowed to grow polynomially and satisfies a global one-sided L
ipschitz condition. The methods are proved to be mean-square convergent of order 1 and to preserve important structural properties of the SDE. In particular, first, they are hypoelliptic in every iteration step. Second, they are geometrically ergodic and have asymptotically bounded second moments. Third, they preserve oscillatory dynamics, such as amplitudes, frequencies and phases of oscillations, even for large time steps. Our results are illustrated on the stochastic FitzHugh-Nagumo model and compared with known mean-square convergent tamed/truncated variants of the Euler-Maruyama method. The capability of the proposed splitting methods to preserve the aforementioned properties makes them applicable within different statistical inference procedures. In contrast, known Euler-Maruyama type methods commonly fail in preserving such properties, yielding ill-conditioned likelihood-based estimation tools or computationally infeasible simulation-based inference algorithms.
This paper studies fixed-step convergence of implicit-explicit general linear methods. We focus on a subclass of schemes that is internally consistent, has high stage order, and favorable stability properties. Classical, index-1 differential algebrai
c equation, and singular perturbation convergence analyses results are given. For all these problems IMEX GLMs from the class of interest converge with the full theoretical orders under general assumptions. The convergence results require the time steps to be sufficiently small, with upper bounds that are independent on the stiffness of the problem.
We develop a theoretical foundation for the application of Nesterovs accelerated gradient descent method (AGD) to the approximation of solutions of a wide class of partial differential equations (PDEs). This is achieved by proving the existence of an
invariant set and exponential convergence rates when its preconditioned version (PAGD) is applied to minimize locally Lipschitz smooth, strongly convex objective functionals. We introduce a second-order ordinary differential equation (ODE) with a preconditioner built-in and show that PAGD is an explicit time-discretization of this ODE, which requires a natural time step restriction for energy stability. At the continuous time level, we show an exponential convergence of the ODE solution to its steady state using a simple energy argument. At the discrete level, assuming the aforementioned step size restriction, the existence of an invariant set is proved and a matching exponential rate of convergence of the PAGD scheme is derived by mimicking the energy argument and the convergence at the continuous level. Applications of the PAGD method to numerical PDEs are demonstrated with certain nonlinear elliptic PDEs using pseudo-spectral methods for spatial discretization, and several numerical experiments are conducted. The results confirm the global geometric and mesh size-independent convergence of the PAGD method, with an accelerated rate that is improved over the preconditioned gradient descent (PGD) method.
The work concerns the stability for a type of multivalued McKean-Vlasov SDEs with non-Lipschitz coefficients. First, we prove the existence and uniqueness of strong solutions for multivalued McKean-Vlasov stochastic differential equations with non-Li
pschitz coefficients. Then, we extend the classical It^{o}s formula from SDEs to multivalued McKean-Vlasov SDEs. Next, the exponential stability of second moments, the exponentially 2-ultimate boundedness and the almost surely asymptotic stability for their solutions in terms of a Lyapunov function are shown.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
