اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQualitative properties of numerical methods for the inhomogeneous geometric Brownian motion
165
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We provide a comparative analysis of qualitative features of different numerical methods for the inhomogeneous geometric Brownian motion (IGBM). The conditional and asymptotic mean and variance of the IGBM are known and the process can be characterised according to Fellers boundary classification. We compare the frequently used Euler-Maruyama and Milstein methods, two Lie-Trotter and two Strang splitting schemes and two methods based on the ordinary differential equation (ODE) approach, namely the classical Wong-Zakai approximation and the recently proposed log-ODE scheme. First, we prove that, in contrast to the Euler-Maruyama and Milstein schemes, the splitting and ODE schemes preserve the boundary properties of the process, independently of the choice of the time discretisation step. Second, we derive closed-form expressions for the conditional and asymptotic means and variances of all considered schemes and analyse the resulting biases. While the Euler-Maruyama and Milstein schemes are the only methods which may have an asymptotically unbiased mean, the splitting and ODE schemes perform better in terms of variance preservation. The Strang schemes outperform the Lie-Trotter splittings, and the log-ODE scheme the classical ODE method. The mean and variance biases of the log-ODE scheme are very small for many relevant parameter settings. However, in some situations the two derived Strang splittings may be a better alternative, one of them requiring considerably less computational effort than the log-ODE method. The proposed analysis may be carried out in a similar fashion on other numerical methods and stochastic differential equations with comparable features.
قيم البحث
اقرأ أيضاً
Sticky Brownian motion is the simplest example of a diffusion process that can spend finite time both in the interior of a domain and on its boundary. It arises in various applications such as in biology, materials science, and finance. This article
spotlights the unusual behavior of sticky Brownian motions from the perspective of applied mathematics, and provides tools to efficiently simulate them. We show that a sticky Brownian motion arises naturally for a particle diffusing on $mathbb{R}_+$ with a strong, short-ranged potential energy near the origin. This is a limit that accurately models mesoscale particles, those with diameters $approx 100$nm-$10mu$m, which form the building blocks for many common materials. We introduce a simple and intuitive sticky random walk to simulate sticky Brownian motion, that also gives insight into its unusual properties. In parameter regimes of practical interest, we show this sticky random walk is two to five orders of magnitude faster than alternative methods to simulate a sticky Brownian motion. We outline possible steps to extend this method towards simulating multi-dimensional sticky diffusions.
Partial differential equations (PDEs) are used, with huge success, to model phenomena arising across all scientific and engineering disciplines. However, across an equally wide swath, there exist situations in which PDE models fail to adequately mode
l observed phenomena or are not the best available model for that purpose. On the other hand, in many situations, nonlocal models that account for interaction occurring at a distance have been shown to more faithfully and effectively model observed phenomena that involve possible singularities and other anomalies. In this article, we consider a generic nonlocal model, beginning with a short review of its definition, the properties of its solution, its mathematical analysis, and specific concrete examples. We then provide extensive discussions about numerical methods, including finite element, finite difference, and spectral methods, for determining approximate solutions of the nonlocal models considered. In that discussion, we pay particular attention to a special class of nonlocal models that are the most widely studied in the literature, namely those involving fractional derivatives. The article ends with brief considerations of several modeling and algorithmic extensions which serve to show the wide applicability of nonlocal modeling.
The numerical solution of differential equations can be formulated as an inference problem to which formal statistical approaches can be applied. However, nonlinear partial differential equations (PDEs) pose substantial challenges from an inferential
perspective, most notably the absence of explicit conditioning formula. This paper extends earlier work on linear PDEs to a general class of initial value problems specified by nonlinear PDEs, motivated by problems for which evaluations of the right-hand-side, initial conditions, or boundary conditions of the PDE have a high computational cost. The proposed method can be viewed as exact Bayesian inference under an approximate likelihood, which is based on discretisation of the nonlinear differential operator. Proof-of-concept experimental results demonstrate that meaningful probabilistic uncertainty quantification for the unknown solution of the PDE can be performed, while controlling the number of times the right-hand-side, initial and boundary conditions are evaluated. A suitable prior model for the solution of the PDE is identified using novel theoretical analysis of the sample path properties of Mat{e}rn processes, which may be of independent interest.
Global spectral analysis (GSA) is used as a tool to test the accuracy of numerical methods with the help of canonical problems of convection and convection-diffusion equation which admit exact solutions. Similarly, events in turbulent flows computed
by direct numerical simulation (DNS) are often calibrated with theoretical results of homogeneous isotropic turbulence due to Kolmogorov, as given in Turbulence -U. Frisch, Cambridge Univ. Press, UK (1995). However, numerical methods for the simulation of this problem are not calibrated, as by using GSA of convection and/or convection-diffusion equation. This is with the exception in A critical assessment of simulations for transitional and turbulence flows-Sengupta, T.K., In Proc. of IUTAM Symp. on Advances in Computation, Modeling and Control of Transitional and Turbulent Flows, pp 491-532, World Sci. Publ. Co. Pte. Ltd., Singapore (2016), where such a calibration has been advocated with the help of convection equation. For turbulent flows, an extreme event is characterized by the presence of length scales smaller than the Kolmogorov length scale, a heuristic limit for the largest wavenumber present without being converted to heat. With growing computer power, recently many simulations have been reported using a pseudo-spectral method, with spatial discretization performed in Fourier spectral space and a two-stage, Runge-Kutta (RK2) method for time discretization. But no analyses are reported to ensure high accuracy of such simulations. Here, an analysis is reported for few multi-stage Runge-Kutta methods in the Fourier spectral framework for convection and convection-diffusion equations. We identify the major source of error for the RK2-Fourier spectral method using GSA and also show how to avoid this error and specify numerical parameters for achieving highest accuracy possible to capture extreme events in turbulent flows.
We develop a general framework for designing conservative numerical methods based on summation by parts operators and split forms in space, combined with relaxation Runge-Kutta methods in time. We apply this framework to create new classes of fully-d
iscrete conservative methods for several nonlinear dispersive wave equations: Benjamin-Bona-Mahony (BBM), Fornberg-Whitham, Camassa-Holm, Degasperis-Procesi, Holm-Hone, and the BBM-BBM system. These full discretizations conserve all linear invariants and one nonlinear invariant for each system. The spatial semidiscretizations include finite difference, spectral collocation, and both discontinuous and continuous finite element methods. The time discretization is essentially explicit, using relaxation Runge-Kutta methods. We implement some specific schemes from among the derived classes, and demonstrate their favorable properties through numerical tests.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
