اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe probabilistic superiority of stochastic symplectic methods via large deviations principles
45
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
It is well known that symplectic methods have been rigorously shown to be superior to non-symplectic ones especially in long-time computation, when applied to deterministic Hamiltonian systems. In this paper, we attempt to study the probabilistic superiority of stochastic symplectic methods by means of the theory of large deviations. We propose the concept of asymptotical preservation of numerical methods for large deviations principles associated with the exact solutions of the general stochastic Hamiltonian systems. Concerning that the linear stochastic oscillator is one of the typical stochastic Hamiltonian systems, we take it as the test equation in this paper to obtain precise results about the rate functions of large deviations principles for both exact and numerical solutions. Based on the Gartner--Ellis theorem, we first study the large deviations principles of the mean position and the mean velocity for both the exact solution and its numerical approximations. Then, we prove that stochastic symplectic methods asymptotically preserve these two large deviations principles, but non-symplectic ones do not. This indicates that stochastic symplectic methods are able to approximate well the exponential decay speed of the hitting probability of the mean position and mean velocity of the stochastic oscillator. To the best of our knowledge, this is the first result about using large deviations principle to show the superiority of stochastic symplectic methods compared with non-symplectic ones in the existing literature.
قيم البحث
اقرأ أيضاً
Generalized Additive Runge-Kutta schemes have shown to be a suitable tool for solving ordinary differential equations with additively partitioned right-hand sides. This work generalizes these GARK schemes to symplectic GARK schemes for additively par
titioned Hamiltonian systems. In a general setting, we derive conditions for symplecticeness, as well as symmetry and time-reversibility. We show how symplectic and symmetric schemes can be constructed based on schemes which are only symplectic. Special attention is given to the special case of partitioned schemes for Hamiltonians split into multiple potential and kinetic energies. Finally we show how symplectic GARK schemes can use efficiently different time scales and evaluation costs for different potentials by using different order for these parts.
We investigate the stochastic modified equation which plays an important role in the stochastic backward error analysis for explaining the mathematical mechanism of a numerical method. The contribution of this paper is threefold. First, we construct
a new type of stochastic modified equation, which is a perturbation of the Wong--Zakai approximation of the rough differential equation. For a symplectic method applied to a rough Hamiltonian system, the associated stochastic modified equation is proved to have a Hamiltonian formulation. Second, the pathwise convergence order of the truncated modified equation to the numerical method is obtained by techniques in the rough path theory. Third, if increments of noises are simulated by truncated random variables, we show that the one-step error can be made exponentially small with respect to the time step size. Numerical experiments verify our theoretical results.
It is well-known that a numerical method which is at the same time geometric structure-preserving and physical property-preserving cannot exist in general for Hamiltonian partial differential equations. In this paper, we present a novel class of para
metric multi-symplectic Runge-Kutta methods for Hamiltonian wave equations, which can also conserve energy simultaneously in a weaker sense with a suitable parameter. The existence of such a parameter, which enforces the energy-preserving property, is proved under certain assumptions on the fixed step sizes and the fixed initial condition. We compare the proposed method with the classical multi-symplectic Runge-Kutta method in numerical experiments, which shows the remarkable energy-preserving property of the proposed method and illustrate the validity of theoretical results.
We develop in this work a numerical method for stochastic differential equations (SDEs) with weak second order accuracy based on Gaussian mixture. Unlike the conventional higher order schemes for SDEs based on It^o-Taylor expansion and iterated It^o
integrals, the proposed scheme approximates the probability measure $mu(X^{n+1}|X^n=x_n)$ by a mixture of Gaussians. The solution at next time step $X^{n+1}$ is then drawn from the Gaussian mixture with complexity linear in the dimension $d$. This provides a new general strategy to construct efficient high weak order numerical schemes for SDEs.
We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze th
eir collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nystrom method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
