A transport-based condensed history algorithm [electronic resource].
- Washington, D.C. : United States. Office of the Assistant Secretary for Nuclear Energy, 1999.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
- Physical Description:
- 485 Kilobytes pages : digital, PDF file
- Additional Creators:
- Lawrence Livermore National Laboratory, United States. Office of the Assistant Secretary for Nuclear Energy, and United States. Department of Energy. Office of Scientific and Technical Information
- Restrictions on Access:
- Free-to-read Unrestricted online access
- 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₀. 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 ≤ s ≤ s₀. For example, the PEnELOPE method splits each step into two substeps; one with length ξs₀ and one with length (1 −ξ)s₀, where ξ is a random number from 0 < ξ < 1. because s₀ 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.
- Report Numbers:
- E 1.99:ucrl-jc-132857
E 1.99: dp0102052
- Other Subject(s):
- Published through SciTech Connect.
American Nuclear Society 1999 Annual Meeting and Embedded Topical Meeting, Boston, MA (US), 06/06/1999--06/10/1999.
Tolar Jr, D R.
- Funding Information:
View MARC record | catkey: 14711997