Monte Carlo and quasi-Monte Carlo algorithms for the Barker-Ferry equation with low complexity

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we study the possibility to use the Sobol' and Halton quasi-random number sequences (QRNs) in solving the Barker-Ferry (B-F) equation which accounts for the quantum character of the electron-phonon interaction in semiconductors. The quasi-Monte Carlo (QMC) solutions obtained by QRNs are compared with the Monte Carlo (MC) solutions in case when the scalable parallel random number generator (SPRNG) library is used for producing the pseudo-random number sequences (PRNs). In order to solve the B-F equation by a MC method, a transition density with a new sampling approach is suggested in the Markov chain. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Gurov, T. V., Whitlock, P. A., & Dimov, I. T. (2003). Monte Carlo and quasi-Monte Carlo algorithms for the Barker-Ferry equation with low complexity. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2542, 108–116. https://doi.org/10.1007/3-540-36487-0_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free