A comparison of vectorizable discrete sampling methods in Monte Carlo applications

Simple item page
dc.contributor.authorSarno, Riyanarto
dc.contributor.authorBhavsar, Virendra, C.
dc.contributor.authorHussein, Esam, M., A.
dc.date.accessioned2023-03-01T18:28:21Z
dc.date.available2023-03-01T18:28:21Z
dc.date.issued1995
dc.description.abstractThe performance of various vectorizable discrete random-sampling methods, along with the commonly used inverse sampling method, is assessed on a vector machine. Monte Carlo applications involving, one-dimensional, two-dimensional and multi-dimensional probability tables are used in the investigation. Various forms of the weighted sampling method and methods that transform the original probability table are examined. It is found that some form of weighted sampling is efficient, when the original probability distribution is not far from uniform or can be approximated analytically. Table transformation methods, though require additional memory storage, are best suited in applications where multi-dimensional tables are involved. Keywords: Discrete sampling, Weighted sampling, Monte Carlo simulations, Vector processing.
dc.description.copyrightCopyright @ Riyanarto Sarno, Virendra C. Bhavsar, and Esam M. A. Hussein, 1995.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14839
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleA comparison of vectorizable discrete sampling methods in Monte Carlo applications
dc.typetechnical report

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
item.pdf
Size:
487.95 KB
Format:
Adobe Portable Document Format
Download

Collections

Research Reports