Fourier analysis of parallel inexact Block-Jacobi splitting with transport synthetic acceleration in slab geometry

Conference · Sat Jul 01 04:00:00 EDT 2006

OSTI ID:22039686

Rosa, M ^[1]; Warsa, J S; Chang, J H ^[2]

---

1. Pennsylvania State Univ., 138 Reber Building, Univ. Park, PA 16802 (United States)
2. Los Alamos National Laboratory, MS D409, P.O. Box 1663, Los Alamos, NM 87545 (United States)

A Fourier analysis is conducted for the discrete-ordinates (SN) approximation of the neutron transport problem solved with Richardson iteration (Source Iteration) and Richardson iteration preconditioned with Transport Synthetic Acceleration (TSA), using the Parallel Block-Jacobi (PBJ) algorithm. Both 'traditional' TSA (TTSA) and a 'modified' TSA (MTSA), in which only the scattering in the low order equations is reduced by some non-negative factor {beta} and < 1, are considered. The results for the un-accelerated algorithm show that convergence of the PBJ algorithm can degrade. The PBJ algorithm with TTSA can be effective provided the {beta} parameter is properly tuned for a given scattering ratio c, but is potentially unstable. Compared to TTSA, MTSA is less sensitive to the choice of {beta}, more effective for the same computational effort (c'), and it is unconditionally stable. (authors)

• Research Organization: American Nuclear Society, 555 North Kensington Avenue, La Grange Park, IL 60526 (United States)
• OSTI ID: 22039686
• Country of Publication: United States
• Language: English

Related Subjects

22 GENERAL STUDIES OF NUCLEAR REACTORS
97 MATHEMATICS AND COMPUTING
ALGORITHMS
CONVERGENCE
DISCRETE ORDINATE METHOD
FOURIER ANALYSIS
NEUTRON TRANSPORT
SLABS