SearcharxivSearch

arXiv subjects

Nicolai Krylov

Publications and source records attributed to Nicolai Krylov.

6 recordsLinked to original sources

A simple proof of a result of A. Novikov

We give simple proofs that for a continuous local martingale M_t: 1) \liminf_{ε->0} ε\log Ee^{(1-ε) _\infty /2} < \infty ==> E\exp(M_\infty - _\infty /2) = 1, 2) \liminf_{ε->0} ε\log\sup_{t>=0} Ee^{(1-ε)M_t/2} < \infty ==> E\exp(M_\infty - _\infty /2) = 1 .

math.PR

Large deviations for occupation times of Markov processes with $L_{\mathbf{2}}$ semigroups

Our aim is to unify and extend the large deviation upper and lower bounds for the occupation times of a Markov process with $L_2$ semigroups under minimal conditions on the state space and the process trajectories; for example, no strong Markov property is needed. The methods used here apply in both continuous and discrete time. We present the proofs for continuous time only because of the inherent technical difficulties in that situation; the proofs can be adapted for discrete time in a straightforward manner.

math.PR

Higher order derivative estimates for finite-difference schemes

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.

math.NA

An accelerated splitting-up method for parabolic equations

We approximate the solution $u$ of the Cauchy problem $$ \frac{\partial}{\partial t} u(t,x)=Lu(t,x)+f(t,x), \quad (t,x)\in(0,T]\times\bR^d, $$ $$ u(0,x)=u_0(x),\quad x\in\bR^d $$ by splitting the equation into the system $$ \frac{\partial}{\partial t} v_r(t,x)=L_rv_r(t,x)+f_r(t,x), \qquad r=1,2,...,d_1, $$ where $L,L_r$ are second order differential operators, $f$, $f_r$ are functions of $t,x$, such that $L=\sum_r L_r$, $f=\sum_r f_r$. Under natural conditions on solvability in the Sobolev spaces $W^m_p$, we show that for any $k>1$ one can approximate the solution $u$ with an error of order $δ^k$, by an appropriate combination of the solutions $v_r$ along a sequence of time discretization, where $δ$ is proportional to the step size of the grid. This result is obtained by using the time change introduced in [7], together with Richardson's method and a power series expansion of the error of splitting-up approximations in terms of $δ$.

math.AP