No abstract

Higher order numerical schemes for stochastic partial differential equations that do not possess commutative noise require the simulation of iterated stochastic integrals. In this work, we extend the algorithms derived by Kloeden, Platen, and Wright [4] and by Wiktorsson [8] for the approximation of two-times iterated stochastic integrals involved in numerical schemes for finite dimensional stochastic ordinary differential equations to an infinite dimensional setting. These methods clear the way for new types of approximation schemes for SPDEs without commutative noise. Precisely, we analyze two algorithms to approximate two-times iterated integrals with respect to an infinite dimensional Q-Wiener process in case of a trace class operator Q given the increments of the Q-Wiener process. Error estimates in the mean-square sense are derived and discussed for both methods. In contrast to the finite dimensional setting, which is contained as a special case, the optimal approximation algorithm cannot be uniquely determined but is dependent on the covariance operator Q. This difference arises as the stochastic process is of infinite dimension.

A general class of stochastic Runge-Kutta methods for the weak approximation of Itô and Stratonovich stochastic differential equations with a multi-dimensional Wiener process is introduced. Colored rooted trees are used to derive an expansion of the solution process and of the approximation process calculated with the stochastic Runge-Kutta method. A theorem on general order conditions for the coefficients and the random variables of the stochastic Runge-Kutta method is proved by rooted tree analysis. This theorem can be applied for the derivation of stochastic Runge-Kutta methods converging with an arbitrarily high order.

We consider a higher-order Milstein scheme for stochastic partial differential equations with trace class noise which fulfill a certain commutativity condition. A novel technique to generally improve the order of convergence of Taylor schemes for stochastic partial differential equations is introduced. The key tool is an efficient approximation of the Milstein term by particularly tailored nested derivative-free terms. For the resulting derivative-free Milstein scheme the computational cost is, in general, considerably reduced by some power. Further, a rigorous computational cost model is considered and the so called effective order of convergence is introduced which allows to directly compare various numerical schemes in terms of their efficiency. As the main result, we prove for a broad class of stochastic partial differential equations, including equations with operators that do not need to be pointwise multiplicative, that the effective order of convergence of the proposed derivative-free Milstein scheme is significantly higher than for the original Milstein scheme. In this case, the derivative-free Milstein scheme outperforms the Euler scheme as well as the original Milstein scheme due to the reduction of the computational cost. Finally, we present some numerical examples that confirm the theoretical results. * Recently, it was shown by A. Jentzen and P. E. Kloeden [21] that a higher order of convergence can be obtained when employing schemes which are developed on the basis of the mild solution of (1), that is,t 0 e A(t−s) F (X s ) ds + t 0

No abstract