General order conditions for stochastic partitioned Runge–Kutta methods
نویسندگان
چکیده
منابع مشابه
Effective order strong stability preserving RungeKutta methods
We apply the concept of effective order to strong stability preserving (SSP) explicit Runge–Kutta methods. Relative to classical Runge–Kutta methods, effective order methods are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. The relaxed order conditions allow for greater freedom in the design of ef...
متن کاملOrder conditions for general linear methods
We describe the derivation of order conditions, without restrictions on stage order, for general linear methods for ordinary differential equations. This derivation is based on the extension of Albrecht approach proposed in the context of Runge-Kutta and composite and linear cyclic methods. This approach was generalized by Jackiewicz and Tracogna to two-step Runge-Kutta methods, by Jackiewicz a...
متن کاملGeneral Order Conditions for Stochastic Runge-kutta Methods for Both Commuting and Non-commuting Stochastic Ordinary Diierential Equation Systems
In many modelling situations in which parameter values can only be estimated or are subject to noise, the appropriate mathematical representation is a stochastic ordinary diierential equation (SODE). However, unlike the de-terministic case in which there are suites of sophisticated numerical methods, numerical methods for SODEs are much less sophisticated. Until a recent paper by Burrage and Bu...
متن کاملNumerical Methods for Second-order Stochastic Equations
We seek numerical methods for second-order stochastic differential equations that accurately reproduce the stationary distribution for all values of damping. A complete analysis is possible for linear second-order equations (damped harmonic oscillators with noise), where the statistics are Gaussian and can be calculated exactly in the continuous-time and discrete-time cases. A matrix equation i...
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT Numerical Mathematics
سال: 2017
ISSN: 0006-3835,1572-9125
DOI: 10.1007/s10543-017-0693-6