Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-10T07:56:12.543Z Has data issue: false hasContentIssue false

A fast algorithm for the two dimensionalHJB equation of stochastic control

Published online by Cambridge University Press:  15 August 2004

J. Frédéric Bonnans
Affiliation:
Projet Sydoco, Inria-Rocquencourt, Domaine de Voluceau, BP 105, 78153 Le Chesnay, France. Frederic.Bonnans@inria.fr.
Élisabeth Ottenwaelter
Affiliation:
IUT de Paris and Projet Sydoco, Inria-Rocquencourt, Domaine de Voluceau, BP 105, 78153 Le Chesnay, France. Elisabeth.Ottenwaelter@inria.fr.
Housnaa Zidani
Affiliation:
Projet Sydoco, Inria-Rocquencourt and Unité de Mathématiques Appliquées, ENSTA, 32 Boulevard Victor, 75739 Paris Cedex 15, France. zidani@ensta.fr.
Get access

Abstract

This paper analyses the implementation of the generalizedfinite differences method for the HJB equation of stochastic control, introduced by two of the authors in [Bonnans and Zidani,SIAM J. Numer. Anal.41 (2003) 1008–1021]. The computation of coefficients needs tosolve at each point of the grid (and for each control)a linear programming problem.We show here that, for two dimensional problems, this linear programming problem can be solved in O(p max) operations, where p max is the size of the stencil. The method is based on a walk on the Stern-Brocot tree,and on the related filling of the set of positive semidefinite matrices of size two.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2004

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