Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Optimization algorithms”

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 433 records · Page 24

Topology Optimization of 3D Flow Fields for Flow Batteries

We report as power generated from renewables becomes more readily available, the need for power-efficient energy storage devices, such as redox flow batteries, becomes critical for successful integration of renewables into the electrical grid. An important aspect of a redox flow battery is the planar flow field, which is usually composed of two-dimensional channels etched into a backing plate. As reactant-laden electrolyte flows into the flow battery, the channels in the flow field distribute the fluid throughout the reactive porous electrode. We utilize topology optimization to design flow fields with full three-dimensional geometry variation, i.e., 3D flow fields. Specifically, we focus on vanadium redox flow batteries and use the optimization algorithm to generate 3D flow fields evolved from standard interdigitated flow fields by minimizing the electrical and flow pressure power losses. To understand how these 3D designs improve performance, we analyze the polarization of the reactant concentration and exchange current within the electrode to highlight how the designed flow fields mitigate the presence of electrode dead zones. While interdigitated flow fields can be heuristically engineered to yield high performance by tuning channel and land dimensions, such a process can be laborious; this work provides a framework for automating that design process.

25 ENERGY STORAGE↗

Devastator Parallel Discrete Event Simulation Runtime (Devastator) v1.0

The Devastator runtime is a modern C++ implementation of optimistic parallel discrete event simulation methods. Devastator allows simulation application code to productively specify their component and event functionality with C++14 constructs. It utilizes GASNet-EX for distributed memory communication and includes parallel performance optimizations such as light-weight thread message queues and asynchronous GVT. Furthermore, it supports efficient event broadcasts and pause-rewind-resume functionality to support periodic load balancing and outer loop optimization algorithms.

Chan, Cy↗

O4855---Geometry_Optimizer_with_NSGA-II

It is a geometry optimizer, written for MCNP geometries but also applicable to other simulation programs. It uses NSGA-II optimization algorithm to change the specified input parameters to iteratively improve the requested tally values over generations.

Erdem, Omer↗

NuFast-LBL

NuFast is designed to calculate all nine neutrino oscillation probabilities in matter for long-baseline accelerator (e.g. NOvA, T2K, DUNE, HK) and reactor experiments (e.g. JUNO) very quickly, using the algorithms optimized for realistic oscillation scenarios. NuFast is provided in Fortran, C++, and Python, although no particular guarantees are made that the Python code is "fast".

Denton, PeterB. [Brookhaven National Laboratory (B↗

Inversion of downhole electrical measurements for proppant mapping using very fast simulated annealing

Proppant mapping is critical for optimizing fracture treatment design and improving wells’ productivity. An electrode-based resistivity tool concept was developed earlier for proppant mapping in cased-hole wells. An array of insulating gaps is installed and cemented in place as a permanent part of the casing string. The electrical measurements are performed by imposing a voltage across each insulating gap, one at a time, before and after hydraulic fracture operations. The voltages across other insulating gaps near the transmitter gap are recorded. The method relies on direct excitation of the casing, which is expected to overcome the severe limitations of induction tools in cased-hole wells. A forward model based on a finite volume method has been developed to simulate the tool’s response to one or multiple fractures. To enable the implementation of such a practical system in multistage fractured horizontal wells, a fast and robust inversion approach is required. To that end, we have developed a divide-and-conquer approach based on a global optimization algorithm very fast simulated annealing (VFSA). Specifically, the original inverse problem is divided into subproblems and each subproblem can be solved separately using VFSA. The results indicate that our approach can invert the data and output widths and radii of multiple fractures without requiring a large number of forward simulations. The robustness of the inverse solver is also tested by adding Gaussian noise to the synthetic data. We tested example cases that demonstrate that when up to 5% noise is introduced, VFSA still provides very accurate inversion results with moderate uncertainties. Inversion results with some more realistic conditions, e.g., tilted fractures, complex fractures, and so on, are also presented.

Geochemistry & Geophysics↗

Beam-Based Diagnostics of Electric Guide Fields and Lattice Parameters for Run-1 of the Muon g-2 Storage Ring at Fermilab

A portion of the Muon g-2 Storage Ring electric system, which provides vertical beam focusing, exhibited an unexpected time dependence that produced a characteristic evolution of the stored beam during Run-1 of the Muon g-2 Experiment at Fermilab (E989). A method to reconstruct the Run-1 electric guide fields has been developed, which is based on a numerical model of the muon storage ring and optimization algorithms supported by COSY INFINITY. This method takes beam profile measurements from the Muon g-2 straw tracking detectors as input, and it produces a full reconstruction of the time-dependent fields. The fields can then be used for the reproduction of detailed beam tracking simulations and the calculation of ring lattice parameters for acceptance studies and systematic error evaluations.

43 PARTICLE ACCELERATORS↗

Bilevel Parameter Optimization for Nonlocal Image Denoising Models

We propose a bilevel optimization approach for the determination of parameters in nonlocal image denoising. We consider both spatial weights in front of the fidelity term, as well as weights within the kernel of the nonlocal operator. In both cases we investigate the differentiability of the solution operator in function spaces and derive a first order optimality system that characterizes local minima. For the numerical solution of the problems, we propose a second-order optimization algorithm in combination with a finite element discretization of the nonlocal denoising models and a computational strategy for the solution of the resulting dense linear systems. Several experiments are run in order to show the suitability of our approach.

97 MATHEMATICS AND COMPUTING↗

Optimization of Geometric Perturbations on a Rod Moving Through a High Explosive Target

After completing a study to ensure the simulation results were converged, several high resolution 3D Smoothed Particle Hydrodynamic (SPH) simulations of copper rods impacting a high explosive (LX14) target were performed. This was then formulated into an optimization problem: I wanted to find the optimum shape and location of a perturbation on the rod that would maximize its erosion after it left the target. The shape of the perturbation was modeled as a 2D Gaussian bump and parameterized by its location along the rod axis (z 0 ) and amplitude (A). The final mass of the coherent part of the rod as it leaves the target was used as a metric to represent the erosion of the rod, and the optimization was formulated to maximize this metric with respect to the aforementioned design variables. Due to the expensive nature of the high-fidelity 3D SPH simulations, a surrogate model needed to be chosen so that many function calls to the optimizer would be feasible. Thus, a strategic full factorial sampling plan was chosen to build a dataset, which consisted of 24 high-fidelity simulations. Two surrogate models, a third order polynomial regression model and a Gaussian Process Model, were analyzed using a 14%/86% test/train holdout technique. The root mean square and R2 score of the test set was used to determine the best model, and the third order polynomial regression model was chosen as the surrogate model. Finally, the Nelder-Mead Simplex and Basin-hopping optimization algorithms were implemented, and it was found that the two algorithms gave slightly different optimum values. Nelder-Mead gave an optimum point of [z* 0 ;A*] = [9:9;0:4] and Basin-Hopping gave an optimum value of x* = [z* 0 ;A*] = [9:2;0:1].

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Shape Optimization for Control and Isolation of Structural Vibrations in Aerospace and Defense Applications

Among the main challenges in shape optimization is the coupling of Finite Element Method (FEM) codes in a way that facilitates efficient computation of shape derivatives. This is particularly difficult with multi-physics problems involving legacy codes, where the costs of implementing and maintaining shape derivative capabilities are prohibitive. There are two mathematically equivalent approaches to computing the shape derivative: the volume method, and the boundary method. Each has a major drawback: the boundary method is less accurate, while the volume method is more invasive to the FEM code. Prior implementations of shape derivatives at Sandia have been based on the volume method. We introduce the strip method, which computes shape derivatives on a strip adjacent to the boundary. The strip method makes code coupling simple. Like the boundary method, it queries the state and adjoint solutions at quadrature nodes, but requires no knowledge of the FEM code implementations. At the same time, it exhibits the higher accuracy of the volume method. The development of the strip method also offers us the opportunity to share some lessons learned about implementing the volume method and boundary method, to show shape optimization results on problems of interest, and to begin addressing the other main challenges at hand: constraints on optimized shapes, and their interplay with optimization algorithms.

97 MATHEMATICS AND COMPUTING↗

Final Report For Project TCF-18-15778

This report documents work performed under the Technology Commercialization Fund (TCF-18-15778, Used (spent) nuclear fuel management and analysis tool) award provided by the US Department of Energy (DOE) Office of Technology Transitions (OTT). This report describes various Used Nuclear Fuel-Storage, Transportation & Disposal Analysis Resource and Data System (UNF-ST&DARDS) enhancements to advance the technology readiness level (TRL). The principal work performed under TCF is the integration of the initial dry storage loading optimization algorithm into UNF-ST&DARDS.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Model Reference Adaptive Control (MRAC) for Additive Manufacturing (AM)

Model Reference Adaptive Control (MRAC) is based on the fundamental concept that the process under investigation is to be controlled to follow or “track” a reference system (model) characterized by a state/input/output model employing an adaptive optimization algorithm to adjust the controller parameters in real-time. The generic structure of the MRAC is shown in Fig. 1 consisting of the following primary components: Reference model, Process (system) model, controller and the adaption algorithm. The basic structure of the controller is specified by a linear construct with the corresponding real-time adaption algorithms given by a gradient-type (so-called MIT rule) or based on stability theory (Lyapunov, hyperstability). This approach to adaptive control is termed “direct”, since the controller (parameters) are adjusted based on the component models/algorithm in contrast to the “indirect” approach that adjusts the process model parameters applying real-time system identification techniques.

42 ENGINEERING↗

Development of Electro-chemical Battery Model for Plug-and-Play Eco-system Library

Energy storage components are fundamental to the concept of an Integrated Energy System (IES). They serve to store surplus energy during low-demand periods for later release when other IES components (i.e., Secondary Energy Source, Balance of Plant, etc.) would otherwise have to operate flexibly. This provision for storage avoids high-amplitude power ramps in these components thereby limiting thermal and mechanical stresses to their internals and providing for extended service life. This report describes a dynamic model that has been developed for an electrochemical battery. The lithium-ion (Li-ion) cell was selected as representative technology. The battery model was developed in the Dymola simulation environment and meets the requirements of the ecosystem plug-and-play library. The model accurately describes the electric dynamic response of a Li-ion battery for an imposed charging/discharging power profile. The corresponding physical limitations related to over-power scenarios, and the impact of the residual state of charge are accounted for in the model. A literature review of the major degradation processes affecting Li-ion batteries was performed. Given the purposes of the CTD-IES project, the progressive fade of the installed capacity, the reduction of the round-trip efficiency, and the limits on the number of charging/discharging cycles are aspects that need to be taken into account in techno-economic analyses. The modeling of these degradation phenomena becomes crucial when predictions over long time horizons (capacity expansion) are made. For each one of these phenomena, a brief description is given, and some figures to be implemented in the HERON optimization algorithm are presented.

25 ENERGY STORAGE↗

Position Papers for the ASCR Workshop on the Science of Scientific-Software Development and Use

Software is an increasingly important component in the pursuit of scientific discovery. Both its development and use are essential activities for many scientific teams. At the same time, very little scientific study has been conducted to understand, characterize, and improve the development and use of software for science. Computational science teams have diversified over time to include contributions from domain scientists who provide expertise in scientific and engineering disciplines, applied mathematicians and computer scientists who provide optimal algorithms and data structures, and software and data engineers who provide methodologies and tools adapted and adopted from other software domains. These diverse contributions have enabled tremendous advances in the pursuit of scientific discovery, even as models, computer architectures, and software environments have become more complicated. With this increasing diversity, we believe the next opportunity for qualitative improvement comes from applying the scientific method to understanding, characterizing, and improving how scientific software is developed and used. We believe that this pursuit requires expertise from computational scientists themselves, and from the cognitive and social sciences as well as the software engineering research community. As we look to increase the productivity and sustainability of the scientific-software-development-and-use cycle, a more systematic application of the scientific method to understand processes for software development and use will be a valuable tool to guide future work and result in more usable and sustainable software. This workshop will bring together computer scientists, software engineering researchers, computational scientists, applied mathematicians, social scientists, cognitive scientists, and others, to explore how we can conduct such systematic investigations, what can be learned, and how doing so will benefit the scientific enterprise. The workshop will be structured around a set of breakout sessions, with every attendee expected to participate actively in the discussions. Afterward, workshop attendees — from DOE, industry, and academia — will produce a report for ASCR that summarizes the findings of the workshop.

42 ENGINEERING↗

Light Water Reactor LEU+ Lattice Optimization

Commercial light water reactor (LWR) operators and fuel vendors in the United States are exploring potential changes to nuclear fuel that include low-enriched uranium plus (LEU+) designs to further improve operational economics (e.g., extend cycle length). LEU+ fuel is fuel with a maximum enrichment between 5 wt% and 10 wt% 235 U; it allows for higher assembly burnup but likely requires additional reactivity control, e.g., increased burnable absorbers. This report examines possible LEU+ fuel lattice design changes using the lattice physics code, SCALE/Polaris. An optimization driver called the Metaheuristic Optimization Tool (MOT) is used to automate domain space exploration and optimization of LEU+ lattice designs. Heuristics from previous LWR lattice optimization studies were used to construct the objective function and define the domain space for optimization. This work successfully demonstrated that the optimization algorithms of MOT can generate feasible, nonproprietary LEU+ lattice designs (GE14 10 × 10 and Westinghouse 17 × 17) that meet the constraints of traditional LWR lattices while extending cycle length.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Posterior Regularized Bayesian Neural Network

Traditional NNs often lack the ability for uncertainty quantification. Bayesian NNs(BNNs) could help measure the confidence level by using distributions in NNs modeling. Besides, knowledge is commonly available and could improve the performance of BNNs if it can be properly incorporated. In this work, we propose a novel Posterior-Regularized BNN(PR-BNN) model by incorporating soft and hard constraints as a posterior regularization term. We also propose an augmented Lagrangian method and stochastic optimization algorithm for efficient updating via Monte Carlo sampling. The simulations and case studies for solar PV plants have shown the performance improvement of the proposed model over traditional BNNs.

97 MATHEMATICS AND COMPUTING↗

Graph Contractions for Calculating Correlation Functions in Lattice QCD

Computing correlation functions for many-particle systems in Lattice QCD is vital to extract nuclear physics observables like the energy spectrum of hadrons such as protons. However, this type of calculation has long been considered to be very challenging and computing-resource intensive because of the complex nature of a hadron composed of quarks with many degrees of freedom. In particular, a correlation function can be calculated through a sum of all possible pairs of quark contractions, each of which is a batched tensor contraction, dictated by Wick's theorem. Because the number of terms of this sum can be very large for any hadronic system of interest, fast evaluation of the sum faces several challenges: an extremely large number of contractions, a huge memory footprint at runtime, and the speed of tensor contractions. In this paper, we present a Lattice QCD analysis software suite, Redstar, which addresses these challenges by utilizing novel algorithmic and software engineering methods targeting modern computing platforms such as many-core CPUs and GPUs. In particular, Redstar represents every term in the sum of a correlation function by a graph, applies efficient graph algorithms to reduce the number of contractions to lower the cost of computations, and minimizes the total memory footprint. Moreover, Redstar carries out the contractions on either CPUs or GPUs utilizing an internal and highly efficient Hadron contraction library. Specifically, we illustrate some important algorithmic optimizations of Redstar, show various key design features of Hadron library, and present the speedup values due to the optimizations along with performance figures for calculating six correlations functions on four computing platforms.

Chen, Jie↗

Pressurized Water Reactor Gadolinia Pin Location Optimization

This report presents the results of lattice optimization studies performed to find optimum locations for gadolinia burnable absorber (BA) rods in pressurized water reactor (PWR) lattice fuel designs. Initial excess reactivity suppression allows core designers to further improve operational economics by extending cycle length. Gadolinia BAs are commonly used in boiling water reactor assembly designs for this purpose. In recent years, gadolinia absorbers have been used in PWR designs owing to their longer effectiveness for reactivity suppression compared with common BAs used in PWR assemblies. This report examines the optimum gadolinia pin placement in 17 × 17 PWR lattices at different fuel and gadolinia concentrations for optimized lattice performance, using the SCALE/Polaris lattice physics code. The completed work is continuation of the Light Water Reactor LEU+ Lattice Optimization (ORNL/TM-2021/2366) project. An optimization driver called the metaheuristic optimization tool (MOT) is used to automate domain space exploration and optimization of the lattice designs. Heuristics from previous light-water reactor (LWR) lattice optimization studies were used to construct the objective function and define the domain space for optimization. This work successfully demonstrated that the optimization algorithms of MOT can generate feasible, nonproprietary PWR lattice designs with gadolinia.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

MLOps for Beam Controls

Machine learning operations (MLOps) is the standardization and streamlining of the ML development lifecycle to address the challenges associated with large-scale machine learning applications. The full MLOps pipeline consists of open-source tools: DataHub, MinIO and MLflow. It is being used for dataset management and model development to handle changing data dependencies, varying business needs, reproducibility, and diverse teams working with differing tools and skills. To demonstrate the completion of an MLOps pipeline for particle accelerator operations, we are deploying a simple script that computes settings for the Booster’s gradient magnet power supply. Once the demonstration is complete, we will develop and deploy ML-based optimization algorithms to improve Booster’s overall efficiency. This MLOps pipeline opens the gate to systematically develop and deploy ML applications for accelerator controls and diagnostics.

43 PARTICLE ACCELERATORS↗