Engineering Papers⌕ Search

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.

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

At least 667 records · Page 37

Automated Adversary-in-the-Loop Cyber-Physical Defense Planning

Security of cyber-physical systems (CPS) continues to pose new challenges due to the tight integration and operational complexity of the cyber and physical components. To address these challenges, this article presents a domain-aware, optimization-based approach to determine an effective defense strategy for CPS in an automated fashion—by emulating a strategic adversary in the loop that exploits system vulnerabilities, interconnection of the CPS, and the dynamics of the physical components. Our approach builds on an adversarial decision-making model based on a Markov Decision Process (MDP) that determines the optimal cyber (discrete) and physical (continuous) attack actions over a CPS attack graph. The defense planning problem is modeled as a non-zero-sum game between the adversary and defender. We use a model-free reinforcement learning method to solve the adversary’s problem as a function of the defense strategy. We then employ Bayesian optimization (BO) to find an approximate best-response for the defender to harden the network against the resulting adversary policy. This process is iterated multiple times to improve the strategy for both players. We demonstrate the effectiveness of our approach on a ransomware-inspired graph with a smart building system as the physical process. Numerical studies show that our method converges to a Nash equilibrium for various defender-specific costs of network hardening.

97 MATHEMATICS AND COMPUTING↗

Enhancements to Overset Methods for Achieving Higher Accuracy and Solution Convergence: Preprint

Overset methods, when utilized within a multi-solver framework, provide a very flexible and powerful toolset for analyzing moving body problem. However, many overset framework suffer from several deficiencies such as (1) convergence degradation of the non-linear iterative schemes (2) difficulty in achieving higher-order accuracy and (3) high computational costs over long simulation times. In this work, we explore approaches that mitigate these deficiencies and provide a pathway for improved accuracy and fidelity of overset methods. A high-order, discontinuous Galerkin solver is integrated into an existing overset framework and applied to an unsteady ROBIN fuselage case. For convergence acceleration, an Overset-GMRES linear solver with a timestep controller is applied to a DLR-F6 aircraft steady simulation and an unsteady, notional rotor-fuselage. Finally the same rotor-fuselage case as well as the JVX rotor/wing case is simulated using a reduced-order aerodynamic model.

aerospace↗

A Model Predictive Control to Improve Grid Resilience

The following article details a model predictive control (MPC) to improve grid resilience when faced with variable generation resources. This topic is of significant interest to utility power systems where distributed intermittent energy sources will increase significantly and be relied on for electric grid ancillary services. Previous work on MPCs has focused on narrowly targeted control applications such as improving electric vehicle (EV) charging infrastructure or reducing the cost of integrating Energy Storage Systems (ESSs) into the grid. In contrast, this article develops a comprehensive treatment of the construction of an MPC tailored to electric grids and then applies it integration of intermittent energy resources. To accomplish this, the following article includes a description of a reduced order model (ROM) of an electric power grid based on a circuit model, an optimization formulation that describes the MPC, a collocation method for solving linear time-dependent differential algebraic equations (DAEs) that result from the ROM, and an overall strategy for iteratively refining the behavior of the MPC. Next, the algorithm is validated using two separate numerical experiments. First, the algorithm is compared to an existing MPC code and the results are verified by a numerically precise simulation. It is shown that this algorithm produces a control comparable to existing algorithms and the behavior of the control carefully respects the bounds specified. Second, the MPC is applied to a small nine bus system that contains a mix of turbine-spinning-machine-based and intermittent generation in order to demonstrate the algorithm’s utility for resource planning and control of intermittent resources. This study demonstrates how the MPC can be tuned to change the behavior of the control, which can then assist with the integration of intermittent resources into the grid. The emphasis throughout the paper is to provide systematic treatment of the topic and produce a novel nonlinear control compatible design framework applicable to electric grids and the control of variable resources. This differs from the more targeted application-based focus in most presentations.

microgrid↗

Flash Heating of a Hollow Rod to Determine Thermal Properties

In a nuclear reactor, prolonged exposure to high neutron flux levels can change material properties of reactor components. Due to the danger posed to personnel by highly radioactive components such as spent fuel, noncontact methods must be used to determine these properties. The objective of the current research is to test the viability of using a flash-heating method to determine the thermal diffusivity of a silicon carbide (SiC) tube, which could be used as cladding for a nuclear fuel rod. The flash-heating experiment was conducted at Oak Ridge National Laboratory and temperature results were analyzed as a two-Dimensional cross section which assumed axial symmetry. The model was fitted iteratively to the temperature measurements using nonlinear regression which required values for thermal diffusivity, Biot number and a term to determine the magnitude of the heat absorbed by the flash. The method could be expanded in the future to estimate the thermal diffusivity of spent nuclear fuel rods in an effort to increase the certainty of new reactor designs using precise thermal properties throughout the core life. A statistical analysis of the results of this work is provided as part of the analysis.

McMasters, Robert L [Virginia Military Institute, ↗

Space-Time Block Preconditioning for Incompressible Flow

Parallel-in-time methods have become increasingly popular in the simulation of time-dependent numerical PDEs, allowing for the efficient use of additional message passing interface processes when spatial parallelism saturates. Most methods treat the solution and parallelism in space and time separately. In contrast, all-at-once methods solve the full space-time system directly, largely treating time as simply another spatial dimension. All-at-once methods offer a number of benefits over separate treatment of space and time, most notably significantly increased parallelism and faster time to solution (when applicable). However, the development of fast, scalable all-at-once methods has largely been limited to time-dependent (advection-)diffusion problems. This paper introduces the concept of space-time block preconditioning for the all-at-once solution of incompressible flow. By extending well-known concepts of spatial block preconditioning to the space-time setting, we develop a block preconditioner whose application requires the solution of a space-time (advection-)diffusion equation in the velocity block, coupled with a pressure Schur complement approximation consisting of independent spatial solves at each time-step, and a space-time matrix-vector multiplication. The new method is tested on four classical models in incompressible flow. Finally, the results indicate perfect scalability in refinement of spatial and temporal mesh spacing, perfect scalability in nonlinear Picard iteration count when applied to a nonlinear Navier--Stokes problem, and minimal overhead in terms of number of preconditioner applications compared with sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

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↗

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↗

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.↗

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↗

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↗

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↗

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↗

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),↗

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↗