Engineering Papers⌕ Search

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.

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

At least 145 records · Page 8

Impact of Time Dependent Reactor and Sensor Physics on Core Power Synthesis

Online synthesis of the 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 (LWRs), 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 aims to study the effects of fuel burnup and sensor degradation on the ability to accurately synthesize the power distribution in a LWR. 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 pressurized water reactor low-enriched uranium (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 (PBI) 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 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. 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 under- or over-approximated by the accumulated burnup in approximately 9.3 full power days), but to not account for burnup at all in the a priori assumption leads to severe levels of error, approaching 25% at maximum. The authors also discovered that V SPNDs are extraordinarily robust in the low-enriched uranium fuel cycle 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↗

An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications

In this paper, we explore using the Harrow–Hassidim–Lloyd (HHL) algorithm to address scientific and engineering problems through quantum computing, utilizing the NWQSim simulation package on a high-performance computing platform. Focusing on domains such as power-grid management and climate projection, we demonstrate the correlations of the accuracy of quantum phase estimation, along with various properties of coefficient matrices, on the final solution and quantum resource cost in iterative and non-iterative numerical methods such as the Newton–Raphson method and finite difference method, as well as their impacts on quantum error correction costs using the Microsoft Azure Quantum resource estimator. We summarize the exponential resource cost from quantum phase estimation before and after quantum error correction and illustrate a potential way to reduce the demands on physical qubits. This work lays down a preliminary step for future investigations, urging a closer examination of quantum algorithms’ scalability and efficiency in domain applications.

hybrid software for QC-HPC↗

Preliminary Monte Carlo and Thermal Hydraulic Analysis using a Hybrid ETF-Corrected-Diffusion Prediction Block

This paper builds upon previous work to accelerate the Picard iteration (PI) method typically applied for coupled Monte Carlo-Thermal hydraulic (MC-TH) solutions. Previously, the use of the generalized transfer functions (GTFs) to predict variation in macroscopic cross sections following a perturbation in TH properties was demonstrated for a subset of simple 3D problems. In addition, the reduced-order transport prediction block relied on the first order perturbation (FOP) method, which was shown to have computational overheads. Recent work replaced the FOP block with a 1-group nodal diffusion solver to eliminate these overheads. While the use of diffusion is desirable for large-scale problems, the new solver introduces significant homogenization error. This work aims to address this issue by using the Jacobian-Free Newton Krylov (JFNK) method to generate a set of super homogenization (SPH) factors to improve the accuracy of the diffusion solution. The SPH factors will be used in conjunction with an improved cross section prediction method – the expanded transfer function (ETF) method – to produce a highly accurate flux prediction for an axial 1D boiling water reactor (BWR) pincell following a large perturbation in moderator density. The ETF-corrected diffusion (ETF-CD) block is shown to be highly accurate for the 1D test case. Future work will investigate the accuracy of the method for a realistic 3D pressurized water reactor core.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Fourier analysis of continuous fractional diffusion synthetic acceleration schemes in slab geometry

We propose two fractional extensions of continuous diffusion synthetic acceleration (DSA) with fractional derivative order α varying over the interval 2 ≥ α ≥ 1 . We investigate the spectral properties of the corresponding continuous families of fractional preconditioners by performing Fourier analysis for a model infinite homogeneous medium problem in slab geometry. The first family results in a fractional acceleration scheme, FrDSAo, that reduces to traditional DSA for .α = 2 and scattering ratio c limiting to a unit value (c → 1) but is otherwise optimized via the Fourier analysis, to obtain the smallest possible spectral radius, for c < 1 and 2 ≥ α ≥ 1. The second family corresponds to a fractional acceleration scheme, FrDSAs, that reduces to traditional DSA for α = 2 for all values of c. The latter scheme is not optimized but has the advantage of lending itself to a more straightforward implementation. For high values of c, the results of the Fourier analysis point to the existence of an interval 2 > α > ∼1.8 where both FrDSAo and FrDSAs can achieve a lower spectral radius than DSA. For example, DSA has a spectral radius of ∼0.2246 for c = 0.9999 while FrDSAo produces a value of ∼0.1616 at α = 1.92 and FrDSAs results in ∼0.2116 at α =1.93. (author)

97 MATHEMATICS AND COMPUTING↗

Investigating the AGN-201M research reactor's unique dominance ratio

The AGN-201M reactor is a small, thermal spectrum reactor located at the University of New Mexico (UNM). It is moderated by polyethylene, reflected by graphite, with fuel comprised of uranium microspheres embedded in polyethylene plates that are separated by an aluminum baffle. The dominance ratio of a multiplying system is the ratio of the first higher-mode eigenvalue to the fundamental, k{sub 1}/k{sub 0}. It is a key parameter in characterizing the rate of convergence, analyzing system stability, and determining how tightly coupled the system's neutron fission is. The purpose of this paper is to investigate the system's unusually low dominance ratio of 0.632. This investigation varied the reactor's physical parameters, such as the fuel geometry, fuel density, and reflector thickness, and examined their impact on the reactor's dominance ratio. Additionally, this study examined neutronically similar systems in hopes of identifying common causes for systems with low dominance ratios. The reason why the dominance ratio of the reactor is small compared to larger thermal reactors was determined to be because of its significantly smaller geometry and the composition of the fuel plates. The reflector's effect on the dominance ratio is small in comparison to the other factors, but was found to have a non-zero effect. Furthermore, the AGN-201M was found to have a significantly lower dominance ratio than systems in which it shares a very high (c{sub k} >95%) degree of neutronic similarity.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Angular Distribution of Dimuons from Drell-Yan Production in p+Fe Interactions at 120 GeV Beam Energy

In the E906/SeaQuest Fermilab experiment, we report a measurement of the angular distributions by measuring the angular parameters $\lambda$, $\mu$, and $\nu$ of Drell-Yan dimuons produced using a 120 GeV proton beam incident on an iron target. The angular distribution in the naive Drell-Yan model does not show any $\cos2\phi$ dependency, where $\phi$ denotes the azimuthal angle of dimuons in the Collins-Soper frame. However, pion-induced Drell-Yan experiments, such as NA10 and E615, have observed a significant dependence on $\cos2\phi$. The Boer–Mulders function, a transverse momentum-dependent distribution function, represents the correlation between the transverse spin and the transverse momentum of the quark. A non-zero Boer-Mulders function or an improved higher-order Drell-Yan model considering QCD effects can produce a $\cos 2\phi$ modulation in the Drell-Yan angular distribution. To measure the angular distributions, we have used an event mixing method to construct the combin atorial background, which was then subtracted from the data to isolate the Drell-Yan signal. Following this, we corrected the detector, trigger, and reconstruction efficiencies using a doubly-iterative Bayesian Unfolding method. This iterative unfolding technique improves the response matrix based on the results of the previous unfolding step, ensuring robust convergence without exaggeration of uncertainties. The angular distributions of the dimuons were measured over the invariant mass range $5.0 < M_{\mu^+ \mu^-} < 8.0$ $GeV/c^2$, with dimuon transverse momentum $P_T < 2$ GeV/c and Feynman-x $-0.18 < x_F < 0.9$. The measured angular distributions are then compared with the QCD calculations for $p + \text{Fe}$ interactions, and proton-induced angular distribution measurements from other experiments. We have observed weak $\cos 2\phi$ modulations as a function of $P_T$. For $P_T > 1.0 \, \text{GeV}/c$, the predicted NNLO perturbative QCD value of $\nu$ is larger than what we have me asured at E906/SeaQuest. Moreover, we have not observed a strong dependence of $\nu$ on the kinematic variables, such as dimuon mass $M_{\mu^+ \mu^-}$ and Bjorken-$x$. The spin alignment of the virtual photon, $\lambda$, measured from the SeaQuest Drell-Yan $p+\text{Fe}$ data, is found to be strongly dependent on $P_T$, decreasing as $P_T$ increases. $\lambda$ also holds to the upper bound condition $\lambda < 1.0$ within the statistical uncertainty, showing a trend similar to that predicted by NNLO perturbative QCD. However, for $1.0 < P_T < 2.0 \, \text{GeV}/c$, the extracted $\lambda$ value from SeaQuest is smaller than that predicted by perturbative QCD at NNLO.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

SymProp: Scaling Sparse Symmetric Tucker Decomposition via Symmetry Propagation

Sparse symmetric tensors are an important class of tensors, and their decompositions serve as powerful tools for revealing low-rank structures. This paper introduces SymProp, a novel approach for scaling sparse symmetric Tucker decomposition by propagating symmetry through intermediate computations. SymProp optimizes two key computational kernels: Sparse Symmetric Tensor Times Same Matrix chain (S3 TTMc) for Higher-Order Orthogonal Iteration (HOOI) and Sparse Symmetric Tensor Times Same Matrix chain Times Core (S3 TTMcTC) for Higher-Order QR Iteration (HOQRI). Our method employs a metaprogramming-based index iteration approach to efficiently handle the upper triangular parts of intermediate dense symmetric tensors. SymProp achieves up to 50.9× speedup over SPLATT and up to 360.8× over Compressed Sparse Symmetric (CSS) format on the S3 TTMc operation. Moreover, our S3 TTMc and S3 TTMcTC implementations support tensor orders four levels higher than state-of-the-art methods. Our HOQRI demonstrates superior scalability and up to a 33.6× speedup over optimized HOOI. By enabling more scalable Tucker decompositions for higher orders, decomposition ranks, and dimension sizes, SymProp opens new possibilities for analyzing complex hypergraph structures in fields such as network science, data mining, and machine learning.

Li, Zecheng [North Carolina State University]↗

An eigenvalue-based method for computing the relaxed pressure in compressible multiphase flow with N phases

The modeling of compressible multiphase flows is a decades-old area of study with many applications across various fields. Many of these application areas use stiff pressure relaxation. This process involves the solution of a nonlinear system with N + 1 equations and N + 1 unknowns, where N is the number of phases. The resolution of this system with general equations of state (EOSs) is difficult. Furthermore, nonlinear systems can admit multiple solutions, and current solution methods do not address this possibility. Very recently, a thermodynamic relaxation method was introduced, which effectively maps a relatively simple predictor equation of state onto a more complex target equation of state. In this context, the target EOSs are the chosen EOSs for the thermodynamic model. Furthermore, this thermodynamic relaxation has the benefit of simplifying the stiff pressure relaxation system of equations. In this article, we show this system reduces to a polynomial of degree N, which can be recast as an eigenvalue problem through the use of the associated companion matrix. We show that although this eigenvalue method is generally less efficient than Newton–Raphson iteration, it does not suffer from convergence issues and finds all N roots of the polynomial. Hence, the method provides a fail-safe for root-finding iterative methods and a way to address the issue of multiple solutions to the nonlinear system of equations in stiff pressure relaxation.

Eigenvalue algorithm↗

Hierarchical ensemble Kalman methods with sparsity-promoting generalized gamma hyperpriors

This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods, generalizing the iterative alternating scheme to nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a hierarchical Bayesian model characterized by a conditionally Gaussian prior and generalized gamma hyperpriors. Suitable choices of hyperparameters yield sparsity-promoting regularization. We propose an iterative algorithm for MAP estimation, which alternates between updating the unknown with an ensemble Kalman method and updating the hyperparameters in the regularization to promote sparsity. Here, the effectiveness of our methodology is demonstrated in several computed examples, including compressed sensing and subsurface flow inverse problems.

Ensemble Kalman methods↗

Innovative laser-based methods for monitoring fuel retention in ITER

This paper addresses the challenge of tritium inventory management in ITER and future fusion reactors, highlighting the importance of accurate tritium measurement and its spatial distribution within the vacuum vessel. Given ITER’s operational constraints, especially the limit on tritium retention, precise measurement is essential for both safety and regulatory compliance. To tackle these questions, the paper presents the T-monitor diagnostic system developed by Forschungszentrum Jülich, which uses Laser-Induced Desorption (LID) in combination with Diagnostic Residual Gas Analysis (DRGA) to measure hydrogen isotope concentrations on the surface of divertor tiles. The system integrates a high-power laser, advanced optical components, and a Fast Scanning Mirror Unit (FSMU) for accurate laser spot positioning with rapid response. Designed to measure in situ tritium retention, the diagnostic provides high-resolution spatial mapping, vital for evaluating detritiation strategies. The laser heating process increases the divertor surface temperature to 1600 K within the laser spot, promoting hydrogen isotope desorption. Accurate measurements require the precise control of laser parameters, including pulse duration and spot size, with a target relative accuracy of 20%. The optical design includes both in-vessel and ex-vessel components, such as durable high-reflectivity mirrors made of gold and copper, selected not only for their infrared performance but also for their transmission of visible wavelengths for observation purposes. To protect optical components from contamination, a pneumatic shutter is used.

Hydrogen isotopes↗

Entropy-driven Optimal Sub-sampling of Fluid Dynamics for Developing Machine-learned Surrogates

Optimal sub-sampling of large datasets from fluid dynamics simulations is essential for training reduced-order machine learned models. A method using Shannon entropy was developed to weight flow features according to their level of information content, such that the most informative features can be extracted and used for training a surrogate model. The method is demonstrated in the canonical flow over a cylinder problem simulated with OpenFOAM. Both time-independent predictions and temporal forecasting were investigated as well as two types of prediction targets: local per-grid-point predictions and global per-time-step predictions. When tested on training a surrogate model, results indicate that our entropy-based sampling method typically outperforms random sampling and yields more reproducible results in less iterations. Finally, the method was used to train a surrogate model for modeling turbulence in magnetohydrodynamic flows, which revealed various challenges and opportunities for future research.

Brewer, Wes↗

On High-Order/Low-Order and Micro-Macro Methods for Implicit Time-Stepping of the BGK Model

In this paper, a high-order/low-order (HOLO) method is combined with a micro-macro (MM) decomposition to accelerate iterative solvers in fully implicit time-stepping of the Bhatnagar–Gross–Krook (BGK) equation for gas dynamics. The MM formulation represents a kinetic distribution as the sum of a local Maxwellian and a perturbation. In highly collisional regimes, the perturbation away from initial and boundary layers is small and can be compressed to reduce the overall storage cost of the distribution. The convergence behavior of the MM methods, the usual HOLO method, and the standard source iteration method is analyzed on a linear BGK model. Both the HOLO and MM methods are implemented using a discontinuous Galerkin (DG) discretization in phase space, which naturally preserves the consistency between high- and low-order models required by the HOLO approach. Furthermore, the accuracy and performance of these methods are compared on the Sod shock tube problem and a sudden wall heating boundary layer problem. Overall, the results demonstrate the robustness of the MM and HOLO approaches and illustrate the compression benefits enabled by the MM formulation when the kinetic distribution is near equilibrium.

BGK model↗

Simultaneous Celestial Navigation

GPS technology is used in a multitude of applications around the world for navigation. However, GPS can be contested or denied and thus alternatives to GPS are needed for positioning in high-consequence systems. This project investigates a non-RF based method to produce an estimated geolocation using stellar/celestial measurements in combination with measurements from inclinometers and a real time clock. The initial iteration of this method, developed in FY20/21, achieved an estimated location accuracy within approximately 3 kilometers of the true location with a 3-sigma bound of about 8 kilometers. The next iteration aims to enhance this technology further, targeting an estimation accuracy within 100 meters of the true location, representing a 30-fold improvement over the initial method.

42 ENGINEERING↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

Adapting CLUTCH methodology to multigroup TSUNAMI-3D for eigenvalue sensitivity calculations

The sensitivity of the eigenvalue to uncertainties in nuclear data and its evaluation are important for nuclear criticality safety. TSUNAMI-3D sequences within the SCALE code system offer several options to the user community for calculating eigenvalue sensitivity coefficients with multigroup (MG) and continuous energy (CE) 3D transport capabilities. TSUNAMI-3D sequences implement the adjoint-based perturbation theory with MG KENO code, the Contributon Linked eigenvalue sensitivity/Uncertainty estimation via Track length importance CHaracterization (CLUTCH) method with CE KENO code, and the Iterated Fission Probability (IFP) method with CE KENO and Shift codes. Each method has benefits and limitations depending on the problem that is run. The work presented here aims to adapt the CLUTCH method, which enables the Contributon method's mesh-free, memory-efficient approach for calculating adjoint-weighted tallies for sensitivity calculations, to the MG TSUNAMI-3D sequence. This application would eliminate the explicit adjoint KENO calculation, as well as the memory-consuming mesh flux moment tallies required by the conventional MG TSUNAMI-3D. Smaller memory footprints in the CLUTCH methodology and relatively shorter runtimes in MG KENO transport can make MG TSUNAMI-3D a viable method for some complex problems. Moreover, this adaptation allows MG sensitivity calculations with Shift, ORNL's next-generation high-performance Monte Carlo transport code, which currently does not offer any sensitivity capabilities with MG particle transport simulations. Initial implementation of the new MG TSUNAMI-3D sequence and its preliminary results with a selected critical benchmark experiment in the Verified, Archived Library of Inputs and Data (VALID) are presented in this study.

KENO↗

Brought to Light. I. Quantification of Disk Substructure in Dwarf Early-type Galaxies

Dwarf early-type galaxies (ETGs) display a rich diversity in their photometric, structural, and dynamical properties. In this work, we address their structural complexity by studying with deep imaging a sample of nine dwarf ETGs from the Virgo galaxy cluster, characterized by having faint disk features such as bars and spiral arms, that lie mostly hidden within the bright diffuse light of the galaxies. We present a new, robust method that aims to identify and extract the disk substructure embedded in these dwarf ETGs. The method consists in an iterative procedure that gradually separates a galaxy image into two components: the bright, dominant, diffuse component, and the much fainter, underlying disk component. By applying it to the dwarf ETG sample, we quantify their disk substructure and find that its relative contribution to the total galaxy light ranges between 2.2% and 6.4% within two effective radii. We test the reliability of the method, and prove that it is accurate in recovering the disk substructure we introduce in mock galaxy images, even at low disk-to-total light fractions of a few percent. As a potential application of the method, we perform a Fourier analysis on the extracted disk substructures and measure the orientation, length, and strength of the bars, as well as the pitch angle and strength of the spiral arms. We also briefly discuss a scenario based on the numerical simulations presented in our companion paper, Brought to Light II: Smith et al., in which we investigate the origins of the substructure in such dwarf systems.

79 ASTRONOMY AND ASTROPHYSICS↗

Introducing a Markov chain-based time calibration procedure for multi-channel particle detectors: application to the SuperFGD and ToF detectors of the T2K experiment

Inter-channel mis-synchronisation can be a limiting factor to the time resolution of high performance timing detectors with multiple readout channels and independent electronics units. In these systems, time calibration methods employed must be able to efficiently correct for minimal mis-synchronisation between channels and achieve the best detector performance. We present an iterative time calibration method based on Markov Chains, suitable for detector systems with multiple readout channels. Starting from correlated hit pairs alone, and without requiring an external reference time measurement, the method solves for fixed per-channel offsets, with precision limited only by the intrinsic single-channel resolution. A mathematical proof that the method is able to find the correct time offsets to be assigned to each detector channel in order to achieve inter-channel synchronisation is given, and it is shown that the number of iterations to reach convergence within the desired precision is controllable with a single parameter. Numerical studies are used to confirm unbiased recovery of true offsets. Finally, the application of the calibration method to the Super Fine-Grained Detector (SuperFGD) and the Time of Flight (TOF) detector at the upgraded T2K near detector (ND280) shows good improvement in overall timing resolution, demonstrating the effectiveness in a real-world scenario and scalability.

calibration and fitting methods↗

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗