Iterative methods for solving x-y geometry S[sub N] problems on parallel architecture computers

Journal Article · Tue Sep 01 04:00:00 EDT 1992 · Nuclear Science and Engineering; (United States)

OSTI ID:6897457

Yavuz, M; Larsen, E W ^[1]

---

1. Univ. of Michigan, Dept. of Nuclear Engineering, Ann Arbor, MI (United States)

In this paper, geometric domain decomposition methods are described for solving x-y geometry discrete ordinates (S[sub N]) problems on parallel architecture computers. First, a parallel source iteration scheme is developed; here, one subdivides the spatial domain of the problem, performs transport sweeps independently in each subdomain, and iterates on the scattering source and the interface fluxes between each subdomain. Second, a parallel diffusion synthetic acceleration (DSA) scheme is developed to speed up the convergence of the parallel source iteration. These schemes have been implemented on the IBM RP3, a shared/distributed memory parallel computer. The numerical results show that the parallel source iteration and DSA methods both exhibit significant speedups over their scalar counterparts, but that a degradation in parallel efficiency occurs due to the geometric domain decomposition (iteration on interface fluxes) and the overhead time required for the communication of data between processors.

• OSTI ID: 6897457
• Journal Information: Nuclear Science and Engineering; (United States), Journal Name: Nuclear Science and Engineering; (United States) Vol. 112:1; ISSN NSENAO; ISSN 0029-5639
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
CALCULATION METHODS
COMPUTER ARCHITECTURE
COMPUTERS
DATA
DATA PROCESSING
EFFICIENCY
INFORMATION
ITERATIVE METHODS
NUMERICAL DATA
PARALLEL PROCESSING
PROCESSING
PROGRAMMING