An iterative algorithm to determine the number of time steps in path generation methods (Q2814080): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/mma.3632 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2398409389 / rank | |||
Normal rank | |||
Revision as of 22:42, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative algorithm to determine the number of time steps in path generation methods |
scientific article |
Statements
An iterative algorithm to determine the number of time steps in path generation methods (English)
0 references
17 June 2016
0 references
Monte Carlo methods
0 references
applications to actuarial sciences and financial mathematics
0 references
quasi-Monte Carlo methods
0 references
Brownian bridge methods
0 references
option pricing
0 references
path generation methods
0 references
