2016
DOI: 10.1137/16m106371x
|View full text |Cite
|
Sign up to set email alerts
|

Stratified Regression Monte-Carlo Scheme for Semilinear PDEs and BSDEs with Large Scale Parallelization on GPUs

Abstract: In this paper, we design a novel algorithm based on Least-Squares Monte Carlo (LSMC) in order to approximate the solution of discrete time Backward Stochastic Differential Equations (BSDEs). Our algorithm allows massive parallelization of the computations on multicore devices such as graphics processing units (GPUs). Our approach consists of a novel method of stratification which appears to be crucial for large scale parallelization.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
45
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 53 publications
(45 citation statements)
references
References 19 publications
0
45
0
Order By: Relevance
“…, sigma , beta , p , a , t0 , x0 , T , psi )46 BP = BranchingProcess ( mu , sigma , beta , p , t0 , x0 , T ); * ( a ( k )/ p ( k ) )^( BP {2}( k ) );55 elseif a ( k )~= 0 56 error ( 'a ( k ) zero but p ( k ) non -zero ' ); , sigma , beta , p , t0 , x0 , T ) 64 BP = cell (2 ,1); 65 BP {2} = p *0; 66 tau = exprnd (1/ beta ); 67 new_t0 = min ( tau + t0 , T ); 68 delta_t = new_t0 -t0 ; 69 m = size ( sigma ,2); 70 new_x0 = x0 + mu * delta_t + sigma * sqrt ( delta_t )* randn (m ,1); tmp , wh ic h_ no nl in ea ri ty ] = max ( mnrnd (1 , p )); 75 BP {2}( w hi ch _n on li ne ar it y ) = BP {2}( whi ch _n on li ne ar it y ) + 1; 76 for k =1: which_nonlinearity -1 77 tmp = BranchingProcess (... 78 mu , sigma , beta , p , new_t0 , new_x0 , T ); 79 BP {1} = [ BP {1} tmp {1} ]; 80 BP {2} = BP {2} + tmp {2}; 81 end Matlab code 2: A Matlab code for the Branching diffusion method used in Subsection 4.5. Python code for the deep 2BSDE method used in Subsection 4The following Python code is based on the Python code in E, Han, & Jentzen [33, Subsection 6.1].…”
mentioning
confidence: 99%
“…, sigma , beta , p , a , t0 , x0 , T , psi )46 BP = BranchingProcess ( mu , sigma , beta , p , t0 , x0 , T ); * ( a ( k )/ p ( k ) )^( BP {2}( k ) );55 elseif a ( k )~= 0 56 error ( 'a ( k ) zero but p ( k ) non -zero ' ); , sigma , beta , p , t0 , x0 , T ) 64 BP = cell (2 ,1); 65 BP {2} = p *0; 66 tau = exprnd (1/ beta ); 67 new_t0 = min ( tau + t0 , T ); 68 delta_t = new_t0 -t0 ; 69 m = size ( sigma ,2); 70 new_x0 = x0 + mu * delta_t + sigma * sqrt ( delta_t )* randn (m ,1); tmp , wh ic h_ no nl in ea ri ty ] = max ( mnrnd (1 , p )); 75 BP {2}( w hi ch _n on li ne ar it y ) = BP {2}( whi ch _n on li ne ar it y ) + 1; 76 for k =1: which_nonlinearity -1 77 tmp = BranchingProcess (... 78 mu , sigma , beta , p , new_t0 , new_x0 , T ); 79 BP {1} = [ BP {1} tmp {1} ]; 80 BP {2} = BP {2} + tmp {2}; 81 end Matlab code 2: A Matlab code for the Branching diffusion method used in Subsection 4.5. Python code for the deep 2BSDE method used in Subsection 4The following Python code is based on the Python code in E, Han, & Jentzen [33, Subsection 6.1].…”
mentioning
confidence: 99%
“…As pointed out in the introduction, many (time) discretization schemes and several (spacial) numerical approximation method of the solution of such as BSDE are proposed in the literature (we refer for example to [1,3,7,11,14,10,2,20]). Our aim in this section is to test the performances of our method to the numerical scheme proposed in [20].…”
Section: Approximation Of Bsdementioning
confidence: 99%
“…This is a considerable reduction of computational time, especially as the dimension q grows and correspondingly the dimension of the basis for approximating z i grows. Highlighting the computational time may be not the most important issues when solving BSDEs: in some situations (memory constraint in large dimension [19] or in parallel computing [17], calibration on small data [16]), the number of paths to be used is imposed and the objectives become to obtain the most efficient algorithm with a given Monte Carlo simulation effort. In that case, the use of ISMWDP type scheme for reducing statistical error is certainly advantageous.…”
Section: Concluding Remarks On the Numerical Experimentsmentioning
confidence: 99%