Parallel computing of a quasi-Monte Carlo algorithm for valuing derivatives

Research output: Contribution to journalArticle

21 Scopus citations

Abstract

The performance the standard Monte Carlo method is compared with the performance obtained through the use of (t,m,s)-nets in base b in the approximation of several high dimensional integral problems in valuing derivatives and other securities. The (t,m,s)-nets are generated by a parallel algorithm, where particular considerations are given to scalability of dynamic adaptive routing and load balancing in the design and implementation of the algorithm. From the numerical evidence it appears that such nets can be powerful tools for valuing such securities.

Original languageEnglish (US)
Pages (from-to)641-653
Number of pages13
JournalParallel Computing
Volume26
Issue number5
DOIs
StatePublished - Jan 1 2000

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Parallel computing of a quasi-Monte Carlo algorithm for valuing derivatives'. Together they form a unique fingerprint.

  • Cite this