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.
Division Spotlight
Reactor Physics
The division's objectives are to promote the advancement of knowledge and understanding of the fundamental physical phenomena characterizing nuclear reactors and other nuclear systems. The division encourages research and disseminates information through meetings and publications. Areas of technical interest include nuclear data, particle interactions and transport, reactor and nuclear systems analysis, methods, design, validation and operating experience and standards. The Wigner Award heads the awards program.
Meeting Spotlight
International Conference on Mathematics and Computational Methods Applied to Nuclear Science and Engineering (M&C 2025)
April 27–30, 2025
Denver, CO|The Westin Denver Downtown
Standards Program
The Standards Committee is responsible for the development and maintenance of voluntary consensus standards that address the design, analysis, and operation of components, systems, and facilities related to the application of nuclear science and technology. Find out What’s New, check out the Standards Store, or Get Involved today!
Latest Magazine Issues
Apr 2025
Jan 2025
Latest Journal Issues
Nuclear Science and Engineering
June 2025
Nuclear Technology
Fusion Science and Technology
May 2025
Latest News
Argonne’s METL gears up to test more sodium fast reactor components
Argonne National Laboratory has successfully swapped out an aging cold trap in the sodium test loop called METL (Mechanisms Engineering Test Loop), the Department of Energy announced April 23. The upgrade is the first of its kind in the United States in more than 30 years, according to the DOE, and will help test components and operations for the sodium-cooled fast reactors being developed now.
J. S. B. Gajjar
Nuclear Science and Engineering | Volume 100 | Number 4 | December 1988 | Pages 405-413
Technical Paper | doi.org/10.13182/NSE88-A23573
Articles are hosted by Taylor and Francis Online.
The recent trend toward increased parallelism in supercomputer architectures, together with the need to use existing supercomputer resources more efficiently, has motivated this study of parallel algorithms designed specifically for implementation on parallel machines. Users of parallel machines like the ICL Distributed Array Processor (DAP) are all too familiar with the problem of having to reformulate their algorithms to incorporate the inherent parallelism of the DAP architecture. The individual processing elements of the DAP are comparatively slow, and the full potential of such a machine is only realized if the algorithm used is highly parallel. The very fast processing capabilities of pipeline machines like the Cray-1 or the Cyber 205 tend to obscure this point somewhat, and in fact most users of these machines are content with using existing codes, vectorized where possible. Such a strategy, however, is not appropriate for the parallel processors like the ICL DAP, AMT DAP, the Goodyear MPP, GEC GRID, etc. The application of parallel algorithms to the solution of fluid dynamics problems is considered. Most of the work concerns the solution of the two- and three-dimensional incompressible Navier-Stokes equations, steady and unsteady. The results are relevant for the above-mentioned parallel machines, but the methods can be adapted for use on vector machines. Concerning parallel algorithms, the easiest and possibly those with the widest potential application are relaxation techniques based on red-black (R-B) ordering. The use of R-B successive overrelaxation, R-B LSOR, etc., on two- and three-dimensional cavity flows, unsteady channel, and boundary layer flows at high Reynolds numbers is considered. While these methods are extremely problem dependent, in the favorable cases they can be as competitive as more sophisticated serial “vectorized” algorithms. As far as parallel algorithms are concerned, the most important criteria are what is the cost per iteration, and how fast do they converge. For application on serial machines, the latter factor seems to dominate.