Monte Carlo and Quasi-Monte Carlo Algorithms for the Barker-Ferry Equation with Low Complexity

Authors:
T. V. Gurov;Paula A. Whitlock;Ivan Dimov
Affiliations:
-;-;-
Venue:
NMA '02 Revised Papers from the 5th International Conference on Numerical Methods and Applications
Year:
2002

Citing 6
Cited 0

Faster evaluation of multidimensional integrals

Computers in Physics
Statistical Algorithms for Simulation of Electron Quantum Kinetics in Semiconductors - Part I

LSSC '01 Proceedings of the Third International Conference on Large-Scale Scientific Computing-Revised Papers
Solving Systems of Linear Algebraic Equations Using Quasirandom Numbers

LSSC '01 Proceedings of the Third International Conference on Large-Scale Scientific Computing-Revised Papers
Generating and Testing the Modified Halton Sequences

NMA '02 Revised Papers from the 5th International Conference on Numerical Methods and Applications
A New Efficient Algorithm for Generating the Scrambled Sobol' Sequence

NMA '02 Revised Papers from the 5th International Conference on Numerical Methods and Applications
An efficient backward Monte Carlo estimator for solving of a quantum-kinetic equation with memory kernel

Mathematics and Computers in Simulation

Quantified Score

Hi-index	0.00

Visualization

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.