A transport-based condensed history algorithm
- Lawrence Livermore National Lab., CA (United States)
- Univ. of Michigan, Ann Arbor, MI (United States)
Condensed history algorithms are approximate electron transport Monte Carlo methods in which the cumulative effects of multiple collisions are modeled in a single step of path length s{sub 0}. This path length is the distance each Monte Carlo electron travels between collisions. Current condensed history techniques utilize a splitting routine over the range 0 {le} s {le} s{sub 0}. For example, the PENELOPE method splits each step into two substeps: one with length {xi}s{sub 0} and one with length (1 {minus} {xi})s{sub 0}, where {xi} is a random number from 0 < {xi} < 1. Because s{sub 0} is fixed (not sampled from an exponential distribution), conventional condensed history schemes are not transport processes. Here the authors describe a new condensed history algorithm that is a transport process. The method simulates a transport equation that approximates the exact Boltzmann equation. The new transport equation has a larger mean free path (mfp) than, and preserves two angular moments of, the Boltzmann equation. Thus, the new process is solved more efficiently by Monte Carlo, and it conserves both particles and scattering power.
- OSTI ID:
- 678131
- Report Number(s):
- CONF-990605-; ISSN 0003-018X; TRN: 99:009116
- Journal Information:
- Transactions of the American Nuclear Society, Vol. 80; Conference: 1999 annual meeting of the American Nuclear Society (ANS), Boston, MA (United States), 6-10 Jun 1999; Other Information: PBD: 1999
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Moment-Based Condensed History Algorithm
Application of the GBFP Method to Electron Partial-Wave Expansion Elastic Scattering Differential Cross Sections Within the Geant4 Toolkit - Paper 69