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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Thermal Response of a Lithium Vapor Divertor to Cyclical Operation

The lithium vapor divertor concept is being developed as a method to achieve detached divertor conditions in a tokamak while minimizing impurity radiation losses from the core plasma. SOLPS-ITER modeling has previously been used to identify some of the geometric constraints and required lithium evaporation rate of a lithium vapor divertor in a medium-sized tokamak during steady-state operation. Here an updated conceptual design based on these operating requirements is introduced and the thermal response of the system is modeled during cyclical operation, consistent with operation in a short-pulse tokamak. Controllability of the temperature of the lithium capillary porous system (CPS) is achieved by adopting a design where there is no line-of-sight for radiation from the plasma to reach the heated CPS surface. Operational strategies to minimize the amount of lithium evaporated between plasma discharges while achieving steady evaporation rates during plasma discharges are discussed and modeled here. The optimal feedforward control strategy demonstrated in this work is to ramp up the temperature of the evaporator as quickly as possible immediately before a plasma discharge and then reduce the heating to match the desired steady-state net evaporation rate just before the plasma discharge begins, allowing the thermal inertia of the system to stabilize the evaporation rate during the first second of the plasma discharge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Autonomous alloy composition optimization using molecular dynamics guided by a large language model

Here, we present an autonomous materials discovery framework that couples a large language model (LLM) with molecular dynamics (MD) simulations to optimize Fe–Cr–Mn alloy compositions for tensile strength. Starting from six distinct compositions, the LLM operated as an intelligent agent, iteratively proposing changes based on prior simulation results and constraints. Over 50 iterations per case, the LLM adaptively explored the composition space, identifying high-strength regions, not easily accessible by conventional methods. The highest strength, 18.7 GPa, was achieved with Fe 71 Cr 25 Mn 4 composition, identified from a Fe 75 Cr 20 Mn 5 starting point. The LLM autonomously adjusted its strategy in real time, demonstrating closed-loop decision-making using commodity hardware. This approach showcases the potential of LLMs as scientific co-pilots, capable of accelerating materials discovery and generalizable to other domains like biology and drug design.

Autonomy↗
DOE OSTI2024

Delineation of endorheic drainage basins in the MERIT-Plus dataset for 5 and 15 minute upscaled river networks

Abstract The MERIT-Hydro networks re-gridded by the Iterative Hydrography Upscaling (IHU) algorithm do not retain exo- or endorheic basin attributes from the original data. Here we developed methods to assign such attributes to those and any other digital river networks. The motivation is that endorheic inland drainage basins are essential for hydrologic modelling of global and regional water balances, land surface water storage, gravity anomalies, sea level rise, etc. First, we create basin attributes that explicitly label endorheic and exorheic catchments by the criteria of direct or hidden connectivity to the ocean without changing their flow direction grid. In the second step we alter the delineation of endorheic basins by the merging algorithm that eliminates small inland watersheds to the adjacent host basins. The resulting datasets have a significantly reduced number of endorheic basins while preserving the total land portion and topology of the inland basins. The data was validated using the Water Balance Model by comparing volume of endorheic inland depressions with modelled water accumulation in their inland lakes.

58 GEOSCIENCES↗
DOE OSTI2021

Integrating continuous hypermutation with high–throughput screening for optimization of cis,cis –muconic acid production in yeast

Directed evolution is a powerful method to optimize proteins and metabolic reactions towards user-defined goals. It usually involves subjecting genes or pathways to iterative rounds of mutagenesis, selection and amplification. While powerful, systematic searches through large sequence-spaces is a labour-intensive task, and can be further limited by a priori knowledge about the optimal initial search space, and/or limits in terms of screening throughput. Here, we demonstrate an integrated directed evolution workflow for metabolic pathway enzymes that continuously generate enzyme variants using the recently developed orthogonal replication system, OrthoRep and screens for optimal performance in high-throughput using a transcription factor-based biosensor. We demonstrate the strengths of this workflow by evolving a rate-limiting enzymatic reaction of the biosynthetic pathway for cis,cis-muconic acid (CCM), a precursor used for bioplastic and coatings, in Saccharomyces cerevisiae. After two weeks of simply iterating between passaging of cells to generate variant enzymes via OrthoRep and high-throughput sorting of best-performing variants using a transcription factor-based biosensor for CCM, we ultimately identified variant enzymes improving CCM titers > 13-fold compared with reference enzymes. Taken together, the combination of synthetic biology tools as adopted in this study is an efficient approach to debottleneck repetitive workflows associated with directed evolution of metabolic enzymes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Probabilistic predictions and uncertainty estimation for radiological and nuclear effects modeling

Better characterization of meteorological uncertainty is needed to predict the effects of radiological and nuclear releases in the atmosphere. Multi-physics ensembles of atmospheric simulations can estimate uncertainty of physical processes, but they are often limited for computational reasons. Because weather uncertainty is important for emergency response applications, but the conventional way of running multi-physics ensembles is infeasible, we have developed new machine learning-based methods that quickly estimate and identify key sources of meteorological uncertainty. Machine learning accelerates the analysis of weather uncertainty by iteratively learning about model physics options that affect plume predictions. We have demonstrated the power of machine learning by creating a large multi-physics weather and dispersion ensemble dataset containing 1,200 simulations for two hypothetical radiological release scenarios. By training on less than 10% of the ensemble, we can quickly and accurately predict different outcomes, including the mass of radiological material deposited and spatial distribution and extent of contaminated areas.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Potential Applications of Quantum Computing at Los Alamos National Laboratory, v0.3.0

Since the scientific revolution in the 16th and 17th centuries, the process of scientific discovery has followed an iterative feedback process of observation, hypothesis development and testing with physical experiments, which is widely referred to as the scientific method. This process remained largely unchanged until the middle of the 20th century, when the emergence of digital computers empowered scientist to build and inspect detailed simulations of physical phenomena. Over the last century, computational tools have transformed modern approaches to scientific discovery by enabling fast and affordable hypothesis testing before physical experiments are conducted, shown in Figure 1-1. Some notable examples include: global climate forecasts to understand how the environment may change over decades [130]; modeling the behavior of plasma to design fusion reactors [59]; and understanding the behavior of molecules in biological processes [161, 223].

36 MATERIALS SCIENCE↗
DOE OSTI2023

Data exchange and processing synchronization in distributed systems

Systems, methods, techniques and apparatuses of asynchronous communication is distributed systems are disclosed. One exemplary embodiment is a method determining, with a plurality of agent nodes structured to communicate asynchronously in a distributed system, a first set of iterations including an iteration determined by each of the plurality of agent nodes; determining, with a first agent node of the plurality of agent nodes, a local vector clock; receiving, with the first agent node, a first iteration of the first set of iterations and a remote vector clock determined based on the first iteration; updating, with the first agent node, the local vector clock based on the received remote vector clock; and determining a first iteration of a second set of iterations based on the first set of iterations after determining all iterations of the first set of iterations have been received based on the local vector clock.

Cintuglu, Mehmet H.↗
DOE OSTI2022

An immersed interface method for the 2D vorticity-velocity Navier-Stokes equations with multiple bodies

We present an immersed interface method for the vorticity-velocity form of the 2D Navier Stokes equations that directly addresses challenges posed by nonconvex immersed bodies, multiply connected domains, and the calculation of force distributions on immersed surfaces. The immersed interface method is re-interpreted as a polynomial extrapolation of flow quantities and boundary conditions into the immersed solid bodies, reducing computational cost and enabling simulations with nonconvex bodies that could not be discretized with previous immersed interface methods. In the flow, the vorticity transport equation is discretized using a conservative finite difference scheme and explicit Runge-Kutta time integration. The velocity reconstruction problem is transformed to a scalar Poisson equation that is discretized with conservative finite differences, and solved using an FFT-accelerated iterative algorithm. The use of conservative differencing throughout leads to exact enforcement of a discrete Kelvin's theorem, allowing for simulations with multiply connected domains and outflow boundaries that have challenged other immersed interface vortex methods. We also explore novel methods for recovering time-dependent pressure distributions on immersed bodies within a vorticity-based method and present a novel control volume formulation for recovering aerodynamic moments from only the vorticity and velocity fields. The method achieves second order spatial accuracy and third order temporal accuracy, and is validated on a variety of 2D flows in internal and free-space domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

Here, we propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to obtain an estimate of the active set. The algorithm enforces descent on the objective function to promote global convergence to B-stationary points. We provide a convergence analysis and preliminary numerical results on a range of test problems. We also study the effect of fixing the active constraints in a bound-constrained quadratic program that can be solved on each iteration in order to obtain fast convergence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An unconditionally stable, time-implicit algorithm for solving the one-dimensional Vlasov–Poisson system

The development of an implicit, unconditionally stable, numerical method for solving the Vlasov–Poisson system in one dimension using a phase-space grid is presented. The algorithm uses the Crank–Nicolson discretization scheme and operator splitting allowing for direct solution of the finite difference equations. This method exactly conserves particle number, enstrophy and momentum. A variant of the algorithm which does not use splitting also exactly conserves energy but requires the use of iterative solvers. This algorithm has no dissipation and thus fine-scale variations can lead to oscillations and the production of negative values of the distribution function. We find that overall, the effects of negative values of the distribution function are relatively benign. We consider a variety of test cases that have been used extensively in the literature where numerical results can be compared with analytical solutions or growth rates. We examine higher-order differencing and construct higher-order temporal updates using standard composition methods.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Employing Molecular Phylodynamic Methods to Identify and Forecast HIV Transmission Clusters in Public Health Settings: A Qualitative Study

Molecular HIV surveillance is a promising public health strategy for curbing the HIV epidemic. Clustering technologies used by health departments to date are limited in their ability to infer/forecast cluster growth trajectories. Resolution of the spatiotemporal dynamics of clusters, through phylodynamic and phylogeographic modelling, is one potential strategy to develop a forecasting tool; however, the projected utility of this approach needs assessment. Prior to incorporating novel phylodynamic-based molecular surveillance tools, we sought to identify possible issues related to their feasibility, acceptability, interpretation, and utility. Qualitative data were collected via focus groups among field experts (n = 17, 52.9% female) using semi-structured, open-ended questions. Data were coded using an iterative process, first through the development of provisional themes and subthemes, followed by independent line-by-line coding by two coders. Most participants routinely used molecular methods for HIV surveillance. All agreed that linking molecular sequences to epidemiological data is important for improving HIV surveillance. We found that, in addition to methodological challenges, a variety of implementation barriers are expected in relation to the uptake of phylodynamic methods for HIV surveillance. The participants identified several opportunities to enhance current methods, as well as increase the usability and utility of promising works-in-progress.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing

We analyze the convergence of a nonlocal gradient descent method for minimizing a class of high-dimensional non-convex functions, where a directional Gaussian smoothing (DGS) is proposed to define the nonlocal gradient (also referred to as the DGS gradient). The method was first proposed in [Zhang et al., Enabling long-range exploration in minimization of multimodal functions, UAI 2021], in which multiple numerical experiments showed that replacing the traditional local gradient with the DGS gradient can help the optimizers escape local minima more easily and significantly improve their performance. However, a rigorous theory for the efficiency of the method on nonconvex landscape is lacking. In this work, we investigate the scenario where the objective function is composed of a convex function, perturbed by deterministic oscillating noise. We provide a convergence theory under which the iterates exponentially converge to a tightened neighborhood of the solution, whose size is characterized by the noise wavelength. Here, we also establish a correlation between the optimal values of the Gaussian smoothing radius and the noise wavelength, thus justifying the advantage of using moderate or large smoothing radii with the method. Furthermore, if the noise level decays to zero when approaching the global minimum, we prove that DGS-based optimization converges to the exact global minimum with linear rates, similarly to standard gradient-based methods in optimizing convex functions. Several numerical experiments are provided to confirm our theory and illustrate the superiority of the approach over those based on the local gradient.

Tran, Hoang [Oak Ridge National Laboratory (ORNL),↗
DOE OSTI2023

Efficient QAOA Optimization using Directed Restarts and Graph Lookup

Variational Quantum Algorithms (VQA) aim to enhance the capabilities of Noisy Intermediate-Scale Quantum (NISQ) devices. These algorithms utilize parameterized circuits and classical optimizers to iteratively execute circuits with varying parameters. However, VQA faces computational overheads due to repeated iterations and random restarts. Prior work suggests using basic sub-graphs to transfer parameters for the input graph, reducing optimizer overheads but limiting applicability to structured regular graphs. In real-world applications, random irregular graphs are common, and existing methods are not scalable or practical for such graphs. This paper presents a framework that aims to improve random irregular graphs in VQA. The framework uses graph similarity and important features like total edge counts, average edge counts, and variance. It follows an iterative process to choose basis sub-graphs from a small database and adjust parameters accordingly. Classical optimizers then utilize these parameters to determine when to restart and perform gradient descent. This approach increases the chances of reaching global maximum points.

Wang, Meng↗
DOE OSTI2021

Optimizing multigrid reduction-in-time and Parareal coarse-grid operators for linear advection

Parallel-in-time methods, such as multigrid reduction-in-time (MGRIT) and Parareal, provide an attractive option for increasing concurrency when simulating time-dependent partial differential equations (PDEs) in modern high-performance computing environments. While these techniques have been very successful for parabolic equations, it has often been observed that their performance suffers dramatically when applied to advection-dominated problems or purely hyperbolic PDEs using standard rediscretization approaches on coarse grids. In this paper, we apply MGRIT or Parareal to the constant-coefficient linear advection equation, appealing to existing convergence theory to provide insight into the typically nonscalable or even divergent behavior of these solvers for this problem. To overcome these failings, we replace rediscretization on coarse grids with improved coarse-grid operators that are computed by applying optimization techniques to approximately minimize error estimates from the convergence theory. Therefore, one of our main findings is that, in order to obtain fast convergence as for parabolic problems, coarse-grid operators should take into account the behavior of the hyperbolic problem by tracking the characteristic curves. Our approach is tested for schemes of various orders using explicit or implicit Runge–Kutta methods combined with upwind-finite-difference spatial discretizations. In all cases, we obtain scalable convergence in just a handful of iterations, with parallel tests also showing significant speed-ups over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

EUTERPE: A global gyrokinetic code for stellarator geometry

The current state of the EUTERPE code is described with emphasis on the implemented models and their numerical implementation. The code solves the multi-species electromagnetic gyrokinetic equations in the full volume of a three-dimensional domain. Noise reduction of the particle-in-cell method is achieved by using a δf-method and Fourier filters. The field equations are discretized with B-splines and the resulting system of equations is solved iteratively. For linear simulations a phase-factor transformation is applied in order to strongly reduce the necessary grid resolution. Apart from the full gyrokinetic model, other numerically less expensive hybrid models are also implemented. They are mainly tailored for comparison with fluid theory and for studying the interaction of the bulk plasma with fast particles. The code is parallelized for CPUs by particle and domain decomposition. Good scalability up to several thousand nodes is demonstrated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit step size is accepted locally for the approximate search direction and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme (Na et al. 2022). However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, whereas we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Physics-Based Real-time Analysis and Control to Achieve Transient-Free Operations for the ITER Era (Final Report)

This is the final report for the early career award for Prof. Egemen Kolemen that aimed to develop the physics and technical basis of real-time transient – i.e. disruptions and Edge Localized Modes (ELMs) – avoidance and feedback control at the DIII-D nuclear fusion facility for the ITER era. During this project, we reconstructed high quality real-time DIII-D equilibria using kinetic information from the motional Stark effect (MSE), Thomson Scattering (TS), and Charge Exchange Recombination (CER) spectroscopy. These equilibria were analyzed in real-time to determine the low-n ideal MHD stability and the pedestal stability thresholds, and to obtain plasma response models. These calculations were used to understand which physical process evolves to lead to the onset of disruption in ITER-relevant scenarios at DIII-D, and how disruption can be predicted using stability analysis as opposed to the current methods of correlation of various signals, which are descriptive but lack predictive power. In the disruption studies, we focused on tearing modes, since these constitute the vast majority of disruptions in this regime. With this knowledge, real-time disruption avoidance algorithms were developed and tested. The enhanced situation awareness and physics insight were used in advanced real-time feedback control of pedestal and core profiles, which allowed the pursuit and sustainment of transient-free high-confinement regimes that cannot be achieved via feed-forward design based on in-between shot analysis.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Field Test Report Neutron Scintillator Array Dry Storage Cask Scanner FY2024

During two weeks of Field Testing at the Idaho National Laboratory INTEC Cask Farm in July and August 2024, the LLNL Dry Storage Cask Scanner Array was lifted on top of an MC-10 dry storage fuel cask and operated to acquire neutron and gamma-ray data from the 24 fuel bundle positions. Neutron and gamma-ray data acquisition scans across the top of the cask of varying dwell times were performed July 15-18, 2024 and August 19-22, 2024 to evaluate the ability of the scanner data to reveal asymmetries in the fuel positions that reflect asymmetries in the MC-10 cask fuel bundle loading. The MC-10 cask 24 position fuel bundle loading at the INTEC Cask Farm is well documented, including the locations of six empty fuel bundle positions. This loading presents an opportunity to test the ability of the scanner system to detect diversion of spent fuel bundles as well as to validate the MC-10 cask MCNP modeling. The cask scanner array consists of six Stilbene crystal scintillator detectors and a linear actuator frame that moves the six detectors across the MC-10 dry storage cask to obtain data above each of the 24 fuel bundle positions. The detectors are connected to a pulse-shape discrimination data acquisition system capable of generating separate neutron and gamma-ray spectra for each detector and for each scan position. From the prior single detector Field Test in 2021 and iteration with MCNP modeling, the neutron and gamma-ray data were analyzed in multiple energy regions to identify an analysis method that would provide the strongest and most consistent signature of the asymmetric MC-10 cask fuel loading1 . From both the 2021 Field Test and the current Field Test results, the neutron capture gamma-ray count rate around 2.2 MeV provides the strongest signature of the asymmetric MC-10 cask fuel loading and has qualitative agreement with MCNP calculations. Counting all gamma-rays produces a similar signature. Neutrons emerging from the cask top are moderated and captured by the hydrogen in the polyethylene moderator and scintillator detector, producing a 2.2 MeV gamma ray which is seen in the scintillator gamma-ray spectrum. The count rate in the 2.2 MeV gamma-ray region is ~50 c/s, which is ~1000x higher than the ~0.05 n/s rate in the > 4MeV neutron region, and ~50x greater than the ~1 n/s rate in the neutrons > 500 keV region. Analysis of the 2.2 MeV neutron-capture Compton-scattered gamma-rays produces a statistically significant signature of the INTEC Cask Farm MC-10 asymmetric fuel loading. MCNP simulations indicate that the average neutron energy spectrum offers the potential to detect a large asymmetry from several missing bundles as well as individual missing fuel bundles. Testing this feature will require measurements on a cask with single missing elements.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗