Parallel S/sub n/ transport algorithms

Journal Article · Wed Jan 01 04:00:00 EST 1986 · Transp. Theory Stat. Phys.; (United States)

DOI:https://doi.org/10.1080/00411458608210444· OSTI ID:5970427

Wienke, B R; Hiromoto, R E

Parallelization of standard multigroup methods used to solve the linear (Boltzmann) transport equation in the discrete ordinates (S/sub n/) representation and coupled chaotic iteraction schemes are the focus of this analysis. On the Denelcor HEP, we extend two serial iteration schemes, categorize speedup, and contrast ordered and chaotic methods. Ordered and chaotic iteration strategies, with and without acceleration, support relatively unrestricted parallelism and appear to be robust parallel techniques. Parallel modifications and recording efforts to serial iteration algorithms are straightforward, actual speedup and efficiency are high, and payoff appears substantial, largely due to the coarse computational granularity of the multigroup technique. Chaotic schemes also converge faster than ordered strategies.

• Research Organization: Applied Theoretical Physics Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545
• OSTI ID: 5970427
• Journal Information: Transp. Theory Stat. Phys.; (United States), Journal Name: Transp. Theory Stat. Phys.; (United States) Vol. 15:1; ISSN TTSPB
• Country of Publication: United States
• Language: English

Related Subjects

654001* -- Radiation & Shielding Physics-- Radiation Physics
Shielding Calculations & Experiments
73 NUCLEAR PHYSICS AND RADIATION PHYSICS
ALGORITHMS
BOLTZMANN EQUATION
DIFFERENTIAL EQUATIONS
DISCRETE ORDINATE METHOD
EQUATIONS
ITERATIVE METHODS
MATHEMATICAL LOGIC
MULTIGROUP THEORY
NEUTRON TRANSPORT THEORY
PARTIAL DIFFERENTIAL EQUATIONS
TRANSPORT THEORY