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
Aug 2026
Jan 2026
2026
Latest Journal Issues
Nuclear Science and Engineering
October 2026
Nuclear Technology
September 2026
Fusion Science and Technology
August 2026
Latest News
Front-end nuclear fuel supply cooperation: Turning allied interdependence into strategic advantage
The global nuclear revival, which is fueled by unprecedented demand for firm, affordable, dispatchable power for artificial intelligence and data center build-out, energy security imperatives, and climate commitments, has exposed a structural reality of the Western fuel cycle: No single allied nation currently possesses the full suite of front-end capabilities. From mining through conversion, enrichment, fabrication, and the emerging deconversion and metallization steps required for reactor fuels, capability is distributed across Canada, France, Japan, the United Kingdom, and the United States (collectively, the “Sapporo Five”), as well as a small group of close partners.
Yong Hee Kim, Nam Zin Cho
Nuclear Science and Engineering | Volume 114 | Number 3 | July 1993 | Pages 252-270
Technical Paper | doi.org/10.13182/NSE93-A24038
Articles are hosted by Taylor and Francis Online.
The neutron diffusion equation in reactor physics is solved on a multiple-instruction, multiple-data parallel computer network composed of five transputers. A parallel variant of the Schwarz alternating procedure for overlapping subdomains is used for domain decomposition. The parallel Schwarz algorithm with the concept of underrelaxation in pseudo-boundary conditions is applied to two types of reactor benchmark problems: fixed-source problems and eigenvalue problems. Results of parallel computation for these problems are reported and compared with results of sequential computation. The results show that a very high speedup can be achieved in fixed-source problems in spite of the small problem size and that a relatively high speedup, although lower than that of fixed-source problems, can be obtained in eigenvalue problems.