Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative 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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Modeling cross-beam energy transfer with sector ray tracing

Ray-based cross-beam energy transfer (CBET) models are an essential feature of the radiation-hydrodynamic codes used to simulate inertial confinement fusion implosions, but full 3D ray-based CBET calculations can have a prohibitively high computational cost. Sector ray tracing can be used to reduce the cost by orders of magnitude in cases where the coronal plasma and laser drive can be approximated as spherically symmetric. An extension of sector ray tracing (section ray tracing) can be used to relax the assumption of a spherically symmetric drive while still retaining most of the computational savings of a sector ray trace. We discuss the foundations of sector and section ray tracing and compare them to full ray tracing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Desmearing Bonse–Hart USANS data using Bayesian Gaussian process regression

Ultra-small-angle neutron scattering (USANS) enables access to micrometer-scale structures but is intrinsically affected by strong, anisotropic resolution smearing arising from slit-geometry optics. As a result, recovery of the intrinsic scattering intensity constitutes an ill-posed inverse problem, and commonly used iterative desmearing methods lack rigorous uncertainty quantification. We present a Bayesian desmearing framework for slit-geometry USANS based on Gaussian process regression. In this approach, the scattering intensity is modeled as a smooth random function, and the instrumental point spread function is incorporated explicitly as a forward operator. The resulting formulation yields a closed-form maximum a posteriori solution with well-defined credibility intervals. Computational benchmarks and experimental validation using combined USANS and small-angle neutron scattering (SANS) measurements demonstrate that the framework enables stable desmearing, suppresses experimental noise, and preserves physically meaningful structural features under realistic conditions.

Tung, Chi-Huan [Oak Ridge National Laboratory (ORN↗
DOE OSTI2025

The dual-electron cyclotron emission based measurement of 3D structures on DIII-D tokamak

The measurements of the locked mode and other 3D magnetohydrodynamic modes are essential for real-time control of plasma stability in future fusion reactors. Current magnetic measurements present non-negligible challenges for the application on fusion pilot plants (FPPs) due to neutron radiation and pose challenging design issues. In this paper, we discuss an alternative solution with microwave-based measurements. The dual-electron cyclotron emission (ECE) method has been developed and applied on DIII-D. The dual-ECE measurement method demonstrates clear identification of magnetic islands compared to single ECE, which is highly beneficial for locked mode feedback control on the FPPs. Toroidally separated ECE measurements provide accurate three-dimensional structure of magnetic islands and tearing modes. This technique also offers deeper physical insights into the penetration of resonant magnetic perturbations. Numerical calculations indicate that small locked modes (magnetic island width > 2 cm) can be detected using the dual-ECE measurement method in ITER plasma. This will enhance measurement capabilities for the safe operation of FPP plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Machine learning assisted unfolding for neutrino cross-section measurements with the OmniFold technique

The choice of unfolding method for a cross-section measurement is tightly coupled to the model dependence of the efficiency correction and the overall impact of cross-section modeling uncertainties in the analysis. A key issue is the dimensionality used in unfolding, as the kinematics of all outgoing particles in an event typically affect the reconstruction performance in a neutrino detector. OmniFold is an unfolding method that iteratively reweights a simulated dataset, using machine learning to utilize arbitrarily high-dimensional information, that has previously been applied to proton-proton and proton-electron datasets. This paper demonstrates OmniFold’s application to a neutrino cross-section measurement for the first time using a public T2K near detector simulated dataset, comparing its performance with traditional approaches using a mock data study.

Machine learning↗
DOE OSTI2025

An Adaptive Newton-Based Free-Boundary Grad–Shafranov Solver

Equilibria in magnetic confinement devices result from force balancing between the Lorentz force and the plasma pressure gradient. In an axisymmetric configuration like a tokamak, such an equilibrium is described by an elliptic equation for the poloidal magnetic flux, commonly known as the Grad–Shafranov equation. It is challenging to develop a scalable and accurate free-boundary Grad–Shafranov solver, since it is a fully nonlinear optimization problem that simultaneously solves for the magnetic field coil current outside the plasma to control the plasma shape. In this work, we develop a Newton-based free-boundary Grad–Shafranov solver using adaptive finite elements and preconditioning strategies. The free-boundary interaction leads to the evaluation of a domain-dependent nonlinear form of which its contribution to the Jacobian matrix is achieved through shape calculus. The optimization problem aims to minimize the distance between the plasma boundary and specified control points while satisfying two nontrivial constraints, which correspond to the nonlinear finite element discretization of the Grad–Shafranov equation and a constraint on the total plasma current involving a nonlocal coupling term. The linear system is solved by a block factorization, and AMG is called for subblock elliptic operators. The unique contributions of this work include the treatment of a global constraint, preconditioning strategies, nonlocal reformulation, and the implementation of adaptive finite elements. Furthermore, it is found that the resulting Newton solver is robust, successfully reducing the nonlinear residual to 1e-6 and lower in a small handful of iterations while addressing the challenging case to find a Taylor state equilibrium where conventional Picard-based solvers fail to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Generic Discretization Library

The GenDiL library is a collection of C++ software abstractions designed to discretize and solve partial differential equations (PDEs) for high-performance computing (HPC) applications. Its primary focus is on modern C++ generic programming, which helps ensure portability across various hardware architectures. The central idea behind the library is to provide building blocks for numerical algorithms-such as discretization methods and iteration patterns-so that domain experts can focus on the math, rather than the low-level details of hardware or implementation. By defining abstractions for data types, iteration over computational grids, and scheduling of operations, the library isolates the high-level PDE algorithms from the platform-specific optimizations needed to achieve efficient performance.

Dudouit, Yohann [Lawrence Livermore National Labor↗
DOE OSTI2024

Dynamic Graph Sequence Data from Simulated Neutron Reflectometry Measurements

This dataset comprises dynamic graph sequences derived from simulated in-situ neutron reflectometry measurements, capturing the gradual evolution of a layer structure over time. Each graph sequence represents a synthetic sample, with node features detailing the scattering vector and corresponding reflectivity measurements, while adjacency matrices have corresponding reference material parameters attached as metadata. The dataset spans multiple sets, each with a different number of sequences, offering a comprehensive basis for training models that handle dynamic input sequences with embedded physics. This dataset is particularly suited for tackling inverse problems with hidden physical states that evolve over time, challenges that are typically difficult to address using conventional iterative fitting methods.

36 MATERIALS SCIENCE↗
DOE OSTI2025

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↗
DOE OSTI2025

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↗
DOE OSTI2024

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↗
DOE OSTI2025

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]↗
DOE OSTI2025

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↗
DOE OSTI2026

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↗
DOE OSTI2025

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↗
DOE OSTI2025

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↗
DOE OSTI2024

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↗
DOE OSTI2024

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↗
DOE OSTI2025

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↗