Time discretization and Markovian iteration for coupled FBSDEs

dc.creatorBender, Christian
dc.creatorZhang, Jianfeng
dc.date2008-01-21
dc.date.accessioned2026-07-07T08:56:25Z
dc.date.available2026-07-07T08:56:25Z
dc.descriptionIn this paper we lay the foundation for a numerical algorithm to simulate high-dimensional coupled FBSDEs under weak coupling or monotonicity conditions. In particular, we prove convergence of a time discretization and a Markovian iteration. The iteration differs from standard Picard iterations for FBSDEs in that the dimension of the underlying Markovian process does not increase with the number of iterations. This feature seems to be indispensable for an efficient iterative scheme from a numerical point of view. We finally suggest a fully explicit numerical algorithm and present some numerical examples with up to 10-dimensional state space.
dc.descriptionPublished in at http://dx.doi.org/10.1214/07-AAP448 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
dc.identifierhttps://arxiv.org/abs/0801.3203
dc.identifierhttp://arxiv.org/abs/0801.3203
dc.identifierAnnals of Applied Probability 2008, Vol. 18, No. 1, 143-177
dc.identifierdoi:10.1214/07-AAP448
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146601
dc.subjectProbability
dc.subject65C30, 60H10 (Primary); 60H30, 65C05 (Secondary)
dc.titleTime discretization and Markovian iteration for coupled FBSDEs
dc.typetext

Files

Collections