Massively parallel red-black algorithms for x-y-z response matrix equations

Conference · Wed Jan 01 04:00:00 EST 1992 · Transactions of the American Nuclear Society; (United States)

OSTI ID:6941699

Hanebutte, U R; Laurin-Kovitz, K; Lewis, E E ^[1]

---

1. Northwestern Univ., Evanston, IL (United States)

Recently, both discrete ordinates and spherical harmonic (S[sub n] and P[sub n]) methods have been cast in the form of response matrices. In x-y geometry, massively parallel algorithms have been developed to solve the resulting response matrix equations on the Connection Machine family of parallel computers, the CM-2, CM-200, and CM-5. These algorithms utilize two-cycle iteration on a red-black checkerboard. In this work we examine the use of massively parallel red-black algorithms to solve response matric equations in three dimensions. This longer term objective is to utilize massively parallel algorithms to solve S[sub n] and/or P[sub n] response matrix problems. In this exploratory examination, however, we consider the simple 6 [times] 6 response matrices that are derivable from fine-mesh diffusion approximations in three dimensions.

• OSTI ID: 6941699
• Report Number(s): CONF-921102--
• Conference Information: Journal Name: Transactions of the American Nuclear Society; (United States) Journal Volume: 66
• Country of Publication: United States
• Language: English

Related Subjects

663620* -- Physics of Radiations Other Than Neutrons-- (1992-)
73 NUCLEAR PHYSICS AND RADIATION PHYSICS
ALGORITHMS
CALCULATION METHODS
DISCRETE ORDINATE METHOD
EQUATIONS
MATHEMATICAL LOGIC
NUMERICAL SOLUTION
PARALLEL PROCESSING
PROGRAMMING
THREE-DIMENSIONAL CALCULATIONS