ANS is committed to advancing, fostering, and promoting the development and application of nuclear sciences and technologies to benefit society.
Explore the many uses for nuclear science and its impact on energy, the environment, healthcare, food, and more.
Explore membership for yourself or for your organization.
Conference Spotlight
2026 Nuclear Energy Conference & Expo (NECX)
August 24–27, 2026
Dallas, TX|Hilton Anatole
Latest Magazine Issues
Jun 2026
Jan 2026
2026
Latest Journal Issues
Nuclear Science and Engineering
July 2026
Nuclear Technology
Fusion Science and Technology
May 2026
Latest News
Breaking ground on a new approach to construction
The drive to Kairos Power’s reactor demonstration site in Oak Ridge, Tenn., is not only scenic—it’s historic. Nearly 85 years ago, roughly 30,000 construction workers transformed orchards and farmland into a key Manhattan Project site. Depending on your route, you may pass by one of the three gatehouses that were once military checkpoints controlling access to Atomic Energy Commission production facilities.
Gilles L. Ramone, Marvin L. Adams, Paul F. Nowak
Nuclear Science and Engineering | Volume 125 | Number 3 | March 1997 | Pages 257-283
Technical Paper | doi.org/10.13182/NSE97-A24274
Articles are hosted by Taylor and Francis Online.
A family of transport synthetic acceleration (TSA) methods for iteratively solving within-group scattering problems is presented. A single iteration in these schemes consists of a transport sweep followed by a low-order calculation, which itself is a simplified transport problem. The method for isotropic-scattering problems in X- Y geometry is described. Our Fourier analysis of a model problem for equations with no spatial discretization shows that a previously proposed TSA method is unstable in two dimensions but that our modifications make it stable and rapidly convergent. The same procedure for discretized transport equations, using the step characteristic and two bilinear discontinuous methods, shows that discretization enhances TSA performance. A conjugate gradient algorithm for the low-order problem is described, a crude quadrature set for the low-order problem is proposed, and the number of low-order iterations per high-order sweep is limited to a relatively small value. These features lead to simple and efficient improvements to the method. TSA is tested on a series of problems, and a set of parameters is proposed for which the method behaves especially well. TSA achieves a substantial reduction in computational cost over source iteration, regardless of discretization parameters or material properties, and this reduction increases with the difficulty of the problem.