Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T19:41:29.174Z Has data issue: false hasContentIssue false

On the convergence rate of approximation schemes forHamilton-Jacobi-Bellman Equations

Published online by Cambridge University Press:  15 April 2002

Guy Barles
Affiliation:
Laboratoire de Mathématiques et Physique Théorique, University of Tours, Parc de Grandmont, 37200 Tours, France. barles@univ-tours.fr.
Espen Robstad Jakobsen
Affiliation:
Department of Mathematical Sciences, Norwegian University of Science and Technology, 7491 Trondheim, Norway.
Get access

Abstract

Using systematically a tricky idea of N.V. Krylov, we obtain general results on the rate of convergence of a certain class of monotone approximation schemes for stationary Hamilton-Jacobi-Bellman equations with variable coefficients. This result applies in particular to control schemes based on the dynamic programming principle and to finite difference schemes despite, here, we are not able to treat the most general case. General results have been obtained earlier by Krylov for finite difference schemes in the stationary case with constant coefficients and in the time-dependent case with variable coefficients by using control theory and probabilistic methods. In this paper we are able to handle variable coefficients by a purely analytical method. In our opinion this way is far simpler and, for the cases we can treat, it yields a better rate of convergence than Krylov obtains in the variable coefficients case.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable