Optimal bounds for numerical approximations of finite horizon problems based on dynamic programming approach

In this paper we provide optimal bounds for fully discrete approximations to finite horizon problems via dynamic programming. We adapt the error analysis in \cite{nos} for the infinite horizon case to the finite horizon case. We prove an a priori bound of size $O(h+k)$ for the method, $h$ being the time discretization step and $k$ the spatial mesh size. Arguing with piecewise constants controls we are able to obtain first order of convergence in time and space under standard regularity assumptions, avoiding the more restrictive regularity assumptions on the controls required in \cite{nos}. We show that the loss in the rate of convergence in time of the infinite case (obtained arguing with piece-wise controls) can be avoided in the finite horizon case

Source: arXiv:2602.16574v1 - http://arxiv.org/abs/2602.16574v1 PDF: https://arxiv.org/pdf/2602.16574v1 Original Link: http://arxiv.org/abs/2602.16574v1