A transport-based condensed history algorithm
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 (user-specified) 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 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.
- Research Organization:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE Office of Nuclear Energy, Science and Technology (NE) (US)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 9791
- Report Number(s):
- UCRL-JC-132857; DP0102052; DP0102052; TRN: US0103196
- Resource Relation:
- Conference: American Nuclear Society 1999 Annual Meeting and Embedded Topical Meeting, Boston, MA (US), 06/06/1999--06/10/1999; Other Information: PBD: 6 Jan 1999
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Moment-Based Condensed History Algorithm
The excess mean free path transport condensed history algorithm