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 ANS Annual Conference
May 31–June 3, 2026
Denver, CO|Sheraton Denver
Latest Magazine Issues
Apr 2026
Jan 2026
Latest Journal Issues
Nuclear Science and Engineering
June 2026
Nuclear Technology
March 2026
Fusion Science and Technology
May 2026
Latest News
DOE selects first companies for nuclear launch pad
The Department of Energy’s Office of Nuclear Energy and the National Reactor Innovation Center have announced their first selections for the Nuclear Energy Launch Pad: three companies developing microreactors and one developing fuel supply.
The four companies—Deployable Energy, General Matter, NuCube Energy, and Radiant Industries—were selected from the initial pool of Reactor Pilot Program and Fuel Line Pilot Program applicants, the two precursor programs to the launch pad.
David B. Reister
Nuclear Science and Engineering | Volume 51 | Number 3 | July 1973 | Pages 316-323
Technical Paper | doi.org/10.13182/NSE73-A26608
Articles are hosted by Taylor and Francis Online.
A method for determining narrow upper and lower bounds for the fundamental eigenvalue of a nuclear reactor in either multigroup diffusion theory or transport theory has been developed. This method is based on the Barta-Polya theorem. The Barta-Polya theorem has been extended to yield bounds for multigroup diffusion theory eigenvalue problems. The trial function is a linear sum of known modes and unknown amplitude parameters. Determination of the optimum values of the parameters is a max-min problem of the type that occurs in optimum control and economics. To facilitate numerical computation, a coarse mesh is introduced. A computational method has been developed which quickly yields narrow eigenvalue bounds. Classical methods cannot determine optimum bounds since the function which is to be optimized is not differentiable at the max-min point. The bounds are determined using an iterative method. On each iteration the function is linearized about the mesh points, and linear programming is used to find the optimum solution to the approximate problem. Bounds have been found for a two-region, one-group diffusion theory problem and for a one-group transport theory problem. The bounds are superior to previous results and approach the exact solution as the number of terms in the trial function increases.