SEARCH · Engineering Papers

Results for “iterative methods”

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 199 records · Page 11

All sources NASA NTRS DOE OSTI

DOE OSTI2023

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↗

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 OSTI2023

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↗

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 OSTI2020

Phase-Only Beam Broadening of Contiguous Uniform Subarrayed Arrays

In modern antenna systems, beam broadening of subarrayed arrays provides continuous coverage of a wide angular extent in a cost-effective manner. While many methods have been published that address beam broadening of traditional (non-subarrayed) arrays, there is a knowledge gap in the published literature with respect to efficient beam broadening of contiguous uniform subarrayed arrays. This article presents efficient methods for beam broadening of contiguous uniform subarrayed arrays where the excitation of each element is not individually controlled, but the elements of the array are grouped together as subarrays to have the same element excitations. Particularly, this article focuses on phase-only optimization to preserve maximum power output. Additionally, three modilied iterative Fourier transform (IFT) methods and one genetic algorithm (GA) are presented to efliciently search the vast solution space of possible phase settings for a solution that satislies the desired broadened pattern. These methods are evaluated on idealized 1 x 40 and 1 x 80 linear arrays with live element subarrays and 40 x 40 and 80 x 80 element rectangular arrays with 5 x 5 element subarrays. The proposed modilied IFT methods are found to be faster than the GA approach, while the GA approach only offers a few percentage points of better effectiveness.

42 ENGINEERING↗

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 OSTI2021

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↗

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↗

DOE OSTI2020

Unfolding quantum computer readout noise

Abstract In the current era of noisy intermediate-scale quantum computers, noisy qubits can result in biased results for early quantum algorithm applications. This is a significant challenge for interpreting results from quantum computer simulations for quantum chemistry, nuclear physics, high energy physics (HEP), and other emerging scientific applications. An important class of qubit errors are readout errors. The most basic method to correct readout errors is matrix inversion, using a response matrix built from simple operations to probe the rate of transitions from known initial quantum states to readout outcomes. One challenge with inverting matrices with large off-diagonal components is that the results are sensitive to statistical fluctuations. This challenge is familiar to HEP, where prior-independent regularized matrix inversion techniques (“unfolding”) have been developed for years to correct for acceptance and detector effects, when performing differential cross section measurements. We study one such method, known as iterative Bayesian unfolding, as a potential tool for correcting readout errors from universal gate-based quantum computers. This method is shown to avoid pathologies from commonly used matrix inversion and least squares methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

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↗

DOE OSTI2023

A Model Calibration Method for Grid-Forming Inverters Using Iterative Bayesian Optimization

As inverter-based resources (IBRs) are rapidly deployed, especially at the distribution and microgrid levels, the need to include their accurate representations in power systems models increases. With well-calibrated models, IBR-interactions can be examined, preventing any stability and operational issues, especially in islanded systems. This paper proposes a method to calibrate generic inverter models using Bayesian optimization, but with a parameter-grouping approach to improve speed and accuracy. This approach is illustrated for a grid-forming inverter using synthetic data and field measurements from a simple IBRbased microgrid. Tests show that the calibration algorithm has modest computation cost and is robust to noisy measurements..

Biswas, Shuchismita↗

DOE OSTI2022

Neutron diffusion calculation in heterogeneous geometry based on local/global iteration using proper orthogonal decomposition

This study newly proposes a heterogeneous core calculation method based on local/global iteration using proper orthogonal decomposition (POD). By using the singular value decomposition (SVD) and the low-rank approximation, appropriate POD bases for expanding the neutron flux can be obtained from snapshot data of the neutron flux obtained by fine mesh calculations. By projection using the POD bases, the dimension of the target equation (e.g., discretized neutron diffusion equation) can be dramatically reduced. In the proposed method, POD is effectively applied to each single assembly calculation (local calculation). Furthermore, using the local/global iteration, the effective neutron multiplication factor and the neutron flux distribution in the whole core geometry can be obtained by combining the numerical results of the local calculation for each fuel assembly and the global calculation for the whole core. As a feasibility study, the proposed method is applied to a one-dimensional heterogeneous core analysis, and the accuracy is investigated by changing the total number of POD bases. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2025

Accelerating iterative ptychography with an integrated neural network

Electron ptychography is a powerful and versatile tool for high-resolution and dose-efficient imaging. Iterative reconstruction algorithms are powerful but also computationally expensive due to their relative complexity and the many hyperparameters that must be optimised. Gradient descent-based iterative ptychography is a popular method, but it may converge slowly when reconstructing low spatial frequencies. Here, in this work, we present a method for accelerating a gradient descent-based iterative reconstruction algorithm by training a neural network (NN) that is applied in the reconstruction loop. The NN works in Fourier space and selectively boosts low spatial frequencies, thus enabling faster convergence in a manner similar to accelerated gradient descent algorithms. We discuss the difficulties that arise when incorporating a NN into an iterative reconstruction algorithm and show how they can be overcome with iterative training. We apply our method to simulated and experimental data of gold nanoparticles on amorphous carbon and show that we can significantly speed up ptychographic reconstruction of the nanoparticles.

4DSTEM↗

DOE OSTI2023

Deterministic-Monte Carlo Hybrid Methods for Eigenvalue Sensitivity Coefficient Calculations

The TSUNAMI suite within the SCALE code package includes several methods for generating sensitivity data, including multigroup (MG) and continuous-energy (CE) capabilities. For generating sensitivities with CE data, three methods are available in SCALE 6.3.0: (1) the iterated fission probability (IFP) method with the KENO Monte Carlo transport solver, (2) IFP with the Shift Monte Carlo transport solver, and (3) the Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance Characterization (CLUTCH) with the KENO Monte Carlo transport solver. Currently, it is difficult to generate accurate sensitivities with large reflectors when using the CLUTCH method, specifically with fissionable and hydrogenous materials. To address this issue, the work presented herein examines a methodology to calculate the adjoint flux externally with the 3D deterministic SN transport code DENOVO in SCALE; the result is then read directly into the CLUTCH-TSUNAMI sequence. This hybridization method replaces the Monte Carlo F*(r) calculation in CLUTCH while still utilizing the forward calculation. The critical benchmark HEU-MET-FAST-028-001 is used to generate sensitivities based on the inability of CLUTCH to generate accurate sensitivities. Results from the hybrid method appear to generate sensitivity values that are in excellent agreement with direct perturbations. Although further testing is needed, the method provides promising results for the development and utility of a hybrid method for use in TSUNAMI.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2021

Inversion of dynamical Bragg intensities to complex structure factors by iterated projections. For Ultramic. 2020. ("Pico" Festschrift, May 2021)

We discuss a method for recovering complex structure factors from many simultaneously excited Bragg beam intensities is described. The method is applied to simulated transmission electron diffraction data over a wide range of crystal thickness and beam energies. The method is based on iterated projections between structure and scattering matrices, which are related by a matrix unitary transformation, exponential, which we invert. The algorithm removes multiple-scattering perturbations from diffraction data and might be extended to other fields, including X-ray and neutron diffraction and cryo-electron microscopy. Because coherent multiple scattering involves interference between Bragg beams, the method also solves the phase problem. Unlike dynamical inversion from electron microscope images or ptychography data, the method, which starts with Bragg beam intensities, provides complex structure factors unaffected by focusing errors or resolution limitations imposed by lenses. We provide inversions from simulated data with 441 simultaneously excited Bragg beams over a range of thickness and beam energy. We discuss the retrieval of chirality information from enantiomorphs, the efficient incorporation of symmetry information using the irreducible representation of the group of structure matrices, and the effect of HOLZ lines to provide three-dimensional information.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗