Abstract
Five algorithms for the simulation of random vectors with the bivariate Morgenstern distribution are described and realized. The run-time efficiencies of these algorithms are estimated so that the fastest one is determined. It uses the presentation of the Morgenstern distribution density as the sum of the bilinear finite elements.
MSC: 65C05
Received: 2013-12-11
Accepted: 2015-8-26
Published Online: 2015-10-1
Published in Print: 2015-12-1
© 2015 by De Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Frontmatter
- The parallel replica method for computing equilibrium averages of Markov chains
- Mathematical verification of the Monte Carlo maximum cross-section technique
- Infinite-dimensional Monte-Carlo integration
- Widening and clustering techniques allowing the use of monotone CFTP algorithm
- Constructing positivity preserving numerical schemes for the two-factor CIR model
- Simulation of random variates with the Morgenstern distribution
Schlagwörter für diesen Artikel
Morgenstern distribution;
simulation algorithms;
computer-aided experiments
Artikel in diesem Heft
- Frontmatter
- The parallel replica method for computing equilibrium averages of Markov chains
- Mathematical verification of the Monte Carlo maximum cross-section technique
- Infinite-dimensional Monte-Carlo integration
- Widening and clustering techniques allowing the use of monotone CFTP algorithm
- Constructing positivity preserving numerical schemes for the two-factor CIR model
- Simulation of random variates with the Morgenstern distribution