NAMay 20, 2008
Higher order derivative estimates for finite-difference schemesIstván Gyöngy, Nicolai Krylov
We give sufficient conditions under which solutions of finite-difference schemes in the space variable for second order possibly degenerate parabolic and elliptic equations admit estimates of spatial derivatives up to any given order independent of the mesh size.
NAJan 28, 2015
Finite difference schemes for stochastic partial differential equations in Sobolev spacesMáté Gerencsér, István Gyöngy
We discuss $L_p$-estimates for finite difference schemes approximating parabolic, possibly degenerate, SPDEs, with initial conditions from $W^m_p$ and free terms taking values in $W^m_p.$ Consequences of these estimates include an asymptotic expansion of the error, allowing the acceleration of the approximation by Richardson's method.
NAApr 23, 2017
Localization errors in solving stochastic partial differential equations in the whole spaceMáté Gerencsér, István Gyöngy
Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius $R$. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretisation, and thus is fully implementable.
PRAug 13, 2015
Convergence of tamed Euler schemes for a class of stochastic evolution equationsIstván Gyöngy, Sotirios Sabanis, David Šiška
We prove stability and convergence of a full discretization for a class of stochastic evolution equations with super-linearly growing operators appearing in the drift term. This is done using the recently developed tamed Euler method, which uses a fully explicit time stepping, coupled with a Galerkin scheme for the spatial discretization.
OCDec 17, 2014
On finite-difference approximations for normalized Bellman equationsIstván Gyöngy, David Šiška
A class of stochastic optimal control problems involving optimal stopping is considered. Methods of Krylov are adapted to investigate the numerical solutions of the corresponding normalized Bellman equations and to estimate the rate of convergence of finite difference approximations for the optimal reward functions.