Spatial domain decomposition for neutron transport problems

Journal Article · Sat Apr 01 04:00:00 EST 1989 · Transport Theory and Statistical Physics; (USA)

DOI:https://doi.org/10.1080/00411458908204321· OSTI ID:5590314

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

---

1. Department of Nuclear Engineering, The University of Michigan, Ann Arbor, MI 48109 (US)

A spatial Domain Decomposition method is proposed for modifying the Source Iteration (SI) and Diffusion Synthetic Acceleration (DSA) algorithms for solving discrete ordinates problems. The method, which consists of subdividing the spatial domain of the problem and performing the transport sweeps independently on each subdomain, has the advantage of being parallelizable because the calculations in each subdomain can be performed on separate processors. In this paper we describe the details of this spatial decomposition and study, by numerical experimentation, the effect of this decomposition on the SI and DSA algorithms. Our results show that the spatial decomposition has little effect on the convergence rates until the subdomains become optically thin (less than about a mean free path in thickness).

• OSTI ID: 5590314
• Journal Information: Transport Theory and Statistical Physics; (USA), Journal Name: Transport Theory and Statistical Physics; (USA) Vol. 18:2; ISSN TTSPB; ISSN 0041-1450
• Country of Publication: United States
• Language: English

Related Subjects

654003* -- Radiation & Shielding Physics-- Neutron Interactions with Matter
73 NUCLEAR PHYSICS AND RADIATION PHYSICS
ALGORITHMS
COMPUTER CALCULATIONS
DISCRETE ORDINATE METHOD
ITERATIVE METHODS
MATHEMATICAL LOGIC
NEUTRON TRANSPORT THEORY
TRANSPORT THEORY