SEARCH · Engineering Papers

Results for “Iteration method”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2022

TTDFT: A GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations

We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtered subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. In conclusion, the computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

A Robust Numerical Treatment of Solid-Phase Diffusion in Pseudo Two-Dimensional Lithium-Ion Battery Models

Solid-phase diffusion in active materials of lithium-ion batteries significantly affects charging and safety-related behavior of lithium-ion batteries. Therefore, it is essential to develop an efficient and robust numerical algorithm for solving solid-phase diffusion equations in physics-based battery models. In this work, we discuss the origins of numerical instabilities that can occur when solving the solid-phase diffusion equations using iterative methods. Then, in order to resolve such issues, we propose a simple numerical treatment to the surface flux term of discretized solid-phase diffusion equations. To demonstrate its numerical robustness, the proposed method is implemented into a pseudo two-dimensional (P2D) physics-based battery model and simulations are conducted at wide ranges of operating conditions. Even with extremely poor initial guesses for the Li+ concentrations of the active materials, computations using the proposed method do not diverge and the their computational speeds are comparable to those with conventional initial guesses. Comprehensive tests of the proposed method are also performed with a dynamic current profile based on US06 driving profile and a multi-stage charging profile with very high initial C-rate (12C).

battery modeling↗

DOE OSTI2025

Predicting Flow in Fracture Networks With Quantum Algorithms

Uncertainty quantification plays a crucial role in the modeling of subsurface flow. For instance, uncertainties in the properties of geologic fracture networks significantly impact flow, requiring numerous simulations to accurately estimate quantities of interest. However, each simulation is computationally expensive because it requires solving a large linear system to capture features that involve both small and large fractures. An example is in percolation, where the interaction of many small fractures (which cumulatively can have a large surface area) with the rock matrix must be modeled precisely. Quantum computing is an emerging tool with the potential to address this issue. Quantum algorithms offer a significant speedup in solving linear systems, achieving efficiencies that are challenging to match with classical approaches. These classical approaches include direct solvers, such as LU decomposition, and iterative methods, notably preconditioned conjugate gradient, commonly used in subsurface modeling to solve large sparse systems. However, applying quantum algorithms to geologic fracture flow requires careful attention to algorithmic and problem-specific constraints to fully realize this quantum advantage. In this work we describe a quantum algorithm for generalized Monte Carlo applications with a quadratic speedup over the classical approaches which can be combined with the quantum speedup, currently under investigation, for solving quantum linear systems for subsurface flow. We show that for quantum algorithms the computational cost of estimating a quantity of interest for a statistical ensemble of networks is roughly the same as that of a single realization, essentially implying that one can get uncertainty quantification for free.

58 GEOSCIENCES↗

DOE OSTI2026

Learning neural representations for X-ray ptychography reconstruction with unknown probes

X-ray ptychography provides exceptional nanoscale resolution and is widely applied in materials science, biology, and nanotechnology. However, its full potential is constrained by the critical challenge of accurately reconstructing images when the illuminating probe is unknown. Conventional iterative methods and deep learning approaches are often suboptimal, particularly under the low-signal conditions inherent to low-dose and high-speed experiments. These limitations compromise reconstruction fidelity and restrict the broader adoption of the technique. In this work, we introduce the Ptychographic Implicit Neural Representation (PtyINR), a self-supervised framework that simultaneously addresses the object- and probe-recovery problem. By parameterizing both as continuous neural representations, PtyINR performs end-to-end reconstruction directly from raw diffraction patterns without requiring any pre-characterization of the probe. Extensive evaluations demonstrate that PtyINR achieves superior reconstruction quality on both simulated and experimental data, with remarkable robustness under challenging low-signal conditions. Furthermore, PtyINR offers a generalizable, physics-informed framework for addressing probe-dependent inverse problems, making it applicable to a wide range of computational microscopy problems.

36 MATERIALS SCIENCE↗

DOE OSTI2023

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in many neuroscience laboratories interested in neuron tracing. Here, we report generated gold standard manual annotations for a subset of the available imaging datasets and quantified tracing quality for 35 automatic tracing algorithms. The goal of generating such a hand-curated diverse dataset is to advance the development of tracing algorithms and enable generalizable benchmarking. Together with image quality features, we pooled the data in an interactive web application that enables users and developers to perform principal component analysis, t-distributed stochastic neighbor embedding, correlation and clustering, visualization of imaging and tracing data, and benchmarking of automatic tracing algorithms in user-defined data subsets. The image quality metrics explain most of the variance in the data, followed by neuromorphological features related to neuron size. Furthermore, we observed that diverse algorithms can provide complementary information to obtain accurate results and developed a method to iteratively combine methods and generate consensus reconstructions. The consensus trees obtained provide estimates of the neuron structure ground truth that typically outperform single algorithms in noisy datasets. However, specific algorithms may outperform the consensus tree strategy in specific imaging conditions. Finally, to aid users in predicting the most accurate automatic tracing results without manual annotations for comparison, we used support vector machine regression to predict reconstruction quality given an image volume and a set of automatic tracings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Development of a continuous synthesis process for carbamazepine using validated in-line Raman spectroscopy and kinetic modelling for disturbance simulation

Mitigation of failure modes in the continuous synthesis (CS) of a drug substance (DS) has the potential to widen the adoption of continuous manufacturing (CM) technologies by the pharmaceutical industry. Here, this work demonstrates the development of a robust continuous process for the synthesis of carbamazepine (CBZ), an essential medicine as per the World Health Organization (WHO), facilitated by kinetic modelling and monitored by in-line Raman spectroscopy. Accurate kinetic modelling and the use of validated process analytical technology (PAT) models for quantitative measurement were found to play an important role in developing CS of drug substances. Kinetic data for the formation of CBZ from iminostilbene (ISB) were collected by batch reaction sampling and high-performance liquid chromatography (HPLC) analysis. A non-linear solver and iterative method was applied to determine two sets of Arrhenius parameters simultaneously for the reaction system by minimizing the standard error of the model fit. The start-up and dynamic equilibrium stages for the CS of CBZ using a continuous stirred tank reactor (CSTR) were modelled based on the batch kinetic data and employed to optimize conversion and simulate process disturbances. An in-line Raman spectroscopy method was successfully developed, validated, and integrated to determine the concentrations of CBZ and ISB within the operating range for the CS. The CS kinetic model was evaluated experimentally from startup to dynamic equilibrium over 10 residence times with monitoring by HPLC and in-line Raman spectroscopy. The developed kinetic model in tandem with in-line Raman spectroscopy successfully predicted disturbances due to changes in process variables and can serve as a useful tool in the future design of advanced process control strategies for the continuous synthesis of CBZ.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Lagrangian displacement field estimators in cosmology

The late-time nonlinear Lagrangian displacement field is highly correlated with the initial field, so reconstructing it could enable us to extract primordial cosmological information. Our previous work carefully studied the displacement field reconstructed from the late-time density field using the iterative method proposed and found that it does not fully converge to the true, underlying displacement field (e.g., ~8 % offset at k ~ 0.2 h Mpc –1 at z = 0.6 ). We also constructed the Lagrangian perturbation theory model for the reconstructed field, but the model could not explain the discrepancy between the true and the reconstructed fields in the previous work. Here, the main sources of the discrepancy were speculated to be a numerical artifact in the displacement estimator due to the discreteness of the sample. In this paper, we develop two new estimators of the displacement fields to reduce such a numerical discreteness effect, the normalized momentum estimator and the rescaled resumed estimator. We show that the discrepancy reported is not due to the numerical artifacts. We conclude that the method cannot fully reconstruct the shape of the nonlinear displacement field at the redshift we studied, while it is still an efficient baryon acoustic oscillation reconstruction method. In parallel, by properly accounting for the UV-sensitive term in a reconstruction procedure with an effective field theory approach, we improve the theoretical model for the reconstructed displacement field, by almost 5 times, from ~15% to the level of a few percent at k ~ 0.2 h Mpc –1 at the redshift z = 0.6.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

Decision-Dependent Uncertainty-Aware Distribution System Planning Under Wildfire Risk

The interaction between power systems and wildfires can be dangerous and costly. Distribution grids can be liable for the outbreak of wildfires during extreme weather. In wildfire-prone areas, investment planning should consider the impact of operational actions on wildfire-related uncertainties affecting line failure likelihood. Here, in this case, endogenous-based uncertainty modeling should comprise the backbone of the investment planning model viz-a-viz the inability of standard exogenous-based uncertainty modeling. Therefore, we propose a decision-dependent uncertainty (DDU) aware methodology to optimize investment portfolios for distribution systems, considering that high power-flow levels in high-threat areas can ignite wildfires and increase line failure probability. The methodology identifies the best combination of upgrades (new lines, hardening existing lines, and placing switching devices). Methodologically, we propose a two-stage distributionally robust planning optimization problem with DDU that considers the distribution system's multiperiod operation. The first stage determines optimal switching actions and line investments, and the second stage evaluates the worst-case expected operational cost under a DDU framework designed to account for the endogenous impact of power-flow levels and hardening investment decisions in the line failure probabilities. An iterative method is tailored to handle the problem and numerical experiments demonstrate a more prepared grid to deal with wildfire risk.

Power systems investment planning↗

DOE OSTI2025

G-Mapper: Learning a Cover in the Mapper Construction

The Mapper algorithm is a visualization technique in topological data analysis (TDA) that outputs a graph reflecting the structure of a given dataset. However, the Mapper algorithm requires tuning several parameters in order to generate a “nice” Mapper graph. This paper focuses on selecting the cover parameter. We present an algorithm that optimizes the cover of a Mapper graph by splitting a cover repeatedly according to a statistical test for normality. Our algorithm is based on G-means clustering, which searches for the optimal number of clusters in 𝑘-means by iteratively applying the Anderson–Darling test. Our splitting procedure employs a Gaussian mixture model to carefully choose the cover according to the distribution of the given data. In conclusion, experiments for synthetic and real-world datasets demonstrate that our algorithm generates covers so that the Mapper graphs retain the essence of the datasets, while also running significantly faster than a previous iterative method.

G-means clustering↗

DOE OSTI2023

Q-BEEP: Quantum Bayesian Error Mitigation Employing Poisson Modeling over the Hamming Spectrum

Quantum computing technology has grown rapidly in recent years, with new technologies being explored, error rates being reduced, and quantum processor’s qubit capacity growing. However, near-term quantum algorithms are still unable to be induced without compounding consequential levels of noise, leading to non-trivial erroneous results. Quantum Error Correction (in-situ error mitigation) and Quantum Error Mitigation (post-induction error mitigation) are promising fields of research within the quantum algorithm scene, aiming to alleviate quantum errors, increasing the overall fidelity and hence the overall quality of circuit induction. Earlier this year, a pioneering work, namely HAMMER, published in ASPLOS-22 demonstrated the existence of a latent structure regarding post-circuit induction errors when mapping to the Hamming spectrum. However, they intuitively assumed that errors occur in local clusters, and that at higher average Hamming distances this structure falls away. In this work, we show that such a correlation structure is not only local but extends certain non-local clustering patterns which can be precisely described by a Poisson distribution model taking the input circuit, the device run time status (i.e., calibration statistics) and qubit topology into consideration. Using this quantum error characterizing model, we developed an iterative algorithm over the generated Bayesian network state-graph for post-induction error mitigation. Thanks to more precise modeling of the error distribution latent structure and the new iterative method, our Q-Beep approach provides state of the art performance and can boost circuit execution fidelity by up to 234.6% on Bernstein-Vazirani circuits and on average 71.0% on QAOA solution quality, using 16 practical IBMQ quantum processors. For other benchmarks such as those in QASMBench, the fidelity improvement is up to 17.8%. Q-Beep is a light-weight post-processing technique that can be performed offline and remotely, making it a useful tool for quantum vendors to integrate and provide more reliable circuit induction results.

Stein, Samuel A.↗

DOE OSTI2022

Extension of the PINN diffusion model to k-eigenvalue problems

This paper extends our recent work on the Physics-Informed Neural Networks (PINN) approach for the fixed source diffusion models and applies it to the diffusion theory based k-eigenvalue problems. To make the PINN equitable for the eigenvalue problems, we introduce a novel integral regularization term to the loss function in the framework, and allow the direct inference of the principal eigenvalue and the associated eigenfunction. The regularization term enforces a pre-defined value on the integration of the model predictions, and this value can be directly related to a physical property of the system. We also introduce an additional learnable parameter to approximate the principal eigenvalue. As a proof of principle, we solve the one-group two-dimensional k-eigenvalue neutron diffusion equation in this work. We then provide two numerical examples to demonstrate the applicability of the PINN approach. In each example, we solve the k-eigenvalue diffusion equation in a multi-region configuration constrained with a set of Robin boundary conditions for generality. We use a FEM solution based on the power-iteration method to verify the results of the PINN solution. The results showed relative percentage error in the predicted eigenvalue of about 0.77% and about 1.2% for example 1 and example 2, respectively. The mean absolute error in the predicted flux for example 1 is ∼ 0.002 and for example 2 is ∼ 0.0024. These results indicate some preliminary successes of the PINN application to k-eigenvalue problems. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2025

Self-supervised physics-informed generative networks for phase retrieval from a single X-ray hologram

X-ray phase contrast imaging significantly improves the visualization of structures with weak or uniform absorption, broadening its applications across a wide range of scientific disciplines. Propagation-based phase contrast is particularly suitable for time- or dose-critical in vivo/in situ/operando (tomography) experiments because it requires only a single intensity measurement. However, the phase information of the wave field is lost during the measurement and must be recovered. Conventional algebraic and iterative methods often rely on specific approximations or boundary conditions that may not be met by many samples or experimental setups. In addition, they require manual tuning of reconstruction parameters by experts, making them less adaptable for complex or variable conditions. Here we present a self-learning approach for solving the inverse problem of phase retrieval in the near-field regime of Fresnel theory using a single intensity measurement (hologram). A physics-informed generative adversarial network is employed to reconstruct both the phase and absorbance of the unpropagated wave field in the sample plane from a single hologram. Unlike most state-of-the-art deep learning approaches for phase retrieval, our approach does not require paired, unpaired, or simulated training data. This significantly broadens the applicability of our approach, as acquiring or generating suitable training data remains a major challenge due to the wide variability in sample types and experimental configurations. The algorithm demonstrates robust and consistent performance across diverse imaging conditions and sample types, delivering quantitative, high-quality reconstructions for both simulated data and experimental datasets acquired at beamline P05 at PETRA III (DESY, Hamburg), operated by Helmholtz-Zentrum Hereon. Furthermore, it enables the simultaneous retrieval of both phase and absorption information.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Asymptotic Expansion of the Impedance Per Unit Length for Rectangular Conductors

An iteration method is introduced to obtain the asymptotic form of the impedance per unit length of a rectangular conductor when the half side lengths are large compared to the skin depth. The first terms of the asymptotic expansion are extracted in closed form. The manner in which the corner corrections fit into the expansion are illustrated. The asymptotic results are compared to a numerical solution in the square limit. The odd corner correction for a right angle edge is also discussed.

42 ENGINEERING↗

DOE OSTI2026

Impact of Time-Dependent Reactor and Sensor Physics on Core Power Synthesis (Rev.1)

Online synthesis of power distribution is critical in the operation and control of nuclear power reactors to ensure that the core is operating within safety margins and to provide essential knowledge associated with the burnup of the fuel. In light-water reactors, power synthesis is achieved by using some a priori knowledge of the state of the reactor core and updating based on the signals coming from in-core sensors—namely, self-powered neutron detectors (SPNDs). This report examines the effects of fuel burnup and sensor degradation on the ability to accurately synthesize the power distribution in a pressurized water reactor (PWR), considering the typical low-enriched uranium (LEU, 3%-5% enrichment) fuel cycle as well as the higher enrichment LEU+ (5%-8% enrichment) fuel cycle. Several modeling tools were used to simulate power synthesis based on the responses of SPNDs, with emitters made out of Rh or V. A representative PWR LEU core was modeled using the Polaris/Purdue Advanced Reactor Core Simulator (PARCS) approach. The Monte Carlo N-Particle Transport 6 (MCNP6) code was used as well to calculate response functions between different segments of fuel to individual SPNDs; this is a crucial parameter for power synthesis. The Oak Ridge Isotope GENeration (ORIGEN) package in the Standardized Computer Analyses for Licensing Evaluation (SCALE) code was used to model the time-dependent isotopic transmutation in the SPND emitters. All these data were fed into a custom code that enacted the point-based iterative method to simulate power synthesis. Developmental work was also performed on high-fidelity SPND models in the GEometry ANd Tracking 4 (Geant4) code, which enables higher-accuracy modeling of the current responses from SPNDs. In this work, five sets of time-dependent power synthesis test cases were conducted. In these test cases, systematic changes in the input conditions enabled an analysis of the effect of (1) slightly inaccurate a priori power distribution assumptions with respect to fuel burnup, (2) highly inaccurate a priori power distribution assumptions with respect to fuel burnup (such that burnup is not included in the a priori assumed distribution), and (3) differences between Rh and V SPNDs in terms of downstream consequences of the transmutation in the emitters and the extended nature of the LEU+ fuel cycle in comparison with LEU. The authors discovered that one may permissibly have slightly inaccurate a priori assumptions of the fuel burnup (such that the level of burnup may be slightly underapproximated or overapproximated by the accumulated burnup in approximately 9.3 full power days), but to not account for burnup at all in the a priori assumptions leads to severe levels of error, approaching 25% at maximum (for LEU). The authors also discovered that V SPNDs are extraordinarily robust in both the LEU and LEU+ fuel cycles considered in this modeling work, whereas Rh SPNDs undergo significant transmutation that can result in large errors in the synthesized power distribution.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2025

An iterative dynamic chemical stiffness removal method for reacting flow simulations

Abstract An iterative dynamic chemical stiffness removal method (IDCSR) based on quasi-steady-state approximation (QSSA) is proposed. The IDCSR method is built on a previously developed non-iterative method which has proved to work well for small timestep sizes. A novel iterative procedure is designed in IDCSR to enable explicit time integration of stiff chemistry at relatively large timestep sizes relevant to practical reacting flow simulations. The effectiveness of the iterative procedure is first demonstrated with a toy problem and homogeneous auto-ignition with fixed integration step sizes, showing that larger timestep sizes can be allowed for explicit time integration using IDCSR compared with the previous non-iterative method. IDCSR is then compared with existing explicit chemistry solvers for simulations of homogeneous auto-ignition and shows similar or lower computational cost but significantly higher accuracy across a wide range of timestep sizes. IDCSR is further combined with an automatic adaptive time-stepping scheme for simulations of 0-D homogeneous auto-ignition and a 2-D laminar lifted n -dodecane jet flame. For the 0-D auto-ignition simulations, IDCSR is shown to reduce both the error (by 43%–90%) and computational cost (by 6–15 times) compared with existing explicit solvers, while achieving speed-up factors of up to 400 compared with VODE for a wide range of timestep sizes and reaction mechanisms. For the 2-D jet flame simulations, speed-up factors of 15 and 31 for chemistry integration, and 5 and 9 for overall simulation, are achieved by IDCSR compared with CVODE with and without analytic Jacobian, respectively.

Xu, Chao (ORCID:0000000153074159)↗

DOE OSTI2022

AutoPhaseNN: unsupervised physics-aware deep learning of 3D nanoscale Bragg coherent diffraction imaging

Abstract The problem of phase retrieval underlies various imaging methods from astronomy to nanoscale imaging. Traditional phase retrieval methods are iterative and are therefore computationally expensive. Deep learning (DL) models have been developed to either provide learned priors or completely replace phase retrieval. However, such models require vast amounts of labeled data, which can only be obtained through simulation or performing computationally prohibitive phase retrieval on experimental datasets. Using 3D X-ray Bragg coherent diffraction imaging (BCDI) as a representative technique, we demonstrate AutoPhaseNN, a DL-based approach which learns to solve the phase problem without labeled data. By incorporating the imaging physics into the DL model during training, AutoPhaseNN learns to invert 3D BCDI data in a single shot without ever being shown real space images. Once trained, AutoPhaseNN can be effectively used in the 3D BCDI data inversion about 100× faster than iterative phase retrieval methods while providing comparable image quality.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Analysis of SCALE Criticality and Sensitivity Calculations for Reflected HEU Cylinders [Abstract]

The SCALE code package offers several nuclear data libraries to support Monte Carlo (MC) transport, as well as MC-based derivation of $\kappa$ eff sensitivity and uncertainty (S/U) data. The CSAS sequence using the KENO MC code can utilize continuous-energy (CE) cross sections, or pre-generated multigroup (MG) cross section libraries. The use of MG libraries introduces bias into calculations in exchange for faster transport solutions. The TSUNAMI-3D sequence also utilizes KENO MC calculations. TSUNAMI-3D has two CE calculational methods: the Iterated Fission Probability (IFP) method, and the Contribution-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) method. Previous work has shown poor agreement between CLUTCH and confirmatory direct perturbation calculations in specific applications, e.g., fissionable and polyethylene reflectors

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2022

Analysis of SCALE Criticality and Sensitivity Calculations for Reflected HEU Cylinders

The SCALE code package offers multiple nuclear data libraries and sensitivity and uncertainty (S/U) methods supporting and derived from Monte Carlo (MC) transport. The CSAS and TSUNAMI-3D sequences use KENO MC, utilizing either continuous-energy (CE) cross sections or multigroup (MG) cross section libraries. TSUNAMI-3D has two CE calculational methods: the iterated fission probability (IFP) method, and the Contribution-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) method. Previous work has shown poor agreement between CLUTCH and confirmatory direct perturbation calculations in specific applications (e.g., fissionable and polyethylene reflectors). The HEU-MET-FAST-084 (HMF-084) International Criticality Safety Benchmark Evaluation Project evaluation consists of 27 cylindrical highly enriched uranium metal cores with 14 unique reflector materials of 0.5 and 1 in. thicknesses. Included in this list of reflector materials are natural uranium and polyethylene. This work utilized SCALE 6.2.4 models of the HMF-084 evaluation, with additional non-physical configurations to test both the MG bias and CLUTCH functionality across a variety of reflector material thicknesses. The evaluation’s use of concentric cylinders allowed for examination of several MG self-shielding methods: infinite homogenous, cylindrical, and spherical. The results indicate that the use of polyethylene reflectors with CLUTCH is not fundamentally impossible but sensitive to geometry. The poor performance of CLUTCH with fissionable reflectors was reaffirmed. The 2 in. and greater polyethylene-reflected calculations demonstrate the necessity of using the 302-group library for fast systems. The nickel MG bias was substantial, as discussed in a companion paper, as were cobalt and iron.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗