2014
DOI: 10.1137/120902951
|View full text |Cite
|
Sign up to set email alerts
|

Linear Multistep Schemes for BSDEs

Abstract: We study the convergence rate of a class of linear multi-step methods for BSDEs. We show that, under a sufficient condition on the coefficients, the schemes enjoy a fundamental stability property. Coupling this result to an analysis of the truncation error allows us to design approximation with arbitrary order of convergence. Contrary to the analysis performed in [22], we consider general diffusion model and BSDEs with driver depending on z. The class of methods we consider contains well known methods from the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
58
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 56 publications
(58 citation statements)
references
References 22 publications
0
58
0
Order By: Relevance
“…Higher-order schemes are developed in [5,4]. In our case a Fourier-based method results in a very efficient numerical scheme.…”
Section: Global Error -Time-discretization Scheme Fbsdementioning
confidence: 99%
“…Higher-order schemes are developed in [5,4]. In our case a Fourier-based method results in a very efficient numerical scheme.…”
Section: Global Error -Time-discretization Scheme Fbsdementioning
confidence: 99%
“…Similarly, we get Higher-order schemes are developed in [5,4]. In our case a Fourier-based method results in a very efficient numerical scheme.…”
Section: Global Error -Time-discretization Scheme Fbsdementioning
confidence: 93%
“…Since then, many extensions have been considered: high order schemes e.g. [8,10], schemes for reflected BSDEs [1,9], for fully coupled BSDEs [20,2], for quadratic BSDEs [12] or McKean-Vlasov BSDEs [13,11]. It is also important to mention that, quite recently, very promising probabilistic forward methods have been introduced to approximate (2) [5] or directly the non-linear parabolic PDE (3) [24].…”
Section: Introductionmentioning
confidence: 99%
“…Essentially, the algorithm estimates the value of the field u on the points on the support of the cubature approximating law, thus giving an approximation scheme for the solution of the BSDE (2). By its nature, this algorithm can be easily used to implement second order discretization schemes as in [8,17], and applied in the context of McKean-Vlasov BSDEs as in [13]. The cubature algorithm has been studied under a set of assumptions that guarantee sufficient regularity for the field (for example, smooth coefficients for the forward equation and the generator of the backward equation, Lipschitz regularity on the boundary condition plus a structural condition of the type UFG, see Section 1.1 below).…”
Section: Introductionmentioning
confidence: 99%