Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Point Optimization”

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 253 records · Page 14

Gradient-Informed Design Optimization of Select Nuclear Systems

In this work, we present a gradient-informed design optimization of nuclear reactor core components based on neutronics objectives with both continuous and discrete materials. The main argument in favor of using gradient-informed design optimization is that it scales well with increasing dimensionality of the design space. First, a challenge problem with 121 free parameters is solved with a gradient-informed method and then with a genetic algorithm. Then, a challenge problem to optimize the flux profile of a simplified assembly with eight axial zones is solved. Both challenge problems are solved using directly calculated derivatives from Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) in the SCALE package. Furthermore, we demonstrate how a discrete optimization problem—selection of materials for 121 voxels—can be lifted into a continuous problem with mixed materials. In the continuous space, adjoint-based gradients are well-defined, and gradient descent is applicable. Then, a forcing function is introduced that with the selection of an appropriately sized hyperparameter can be used to guide the optimized continuous solution back into a discrete solution. This paper presents an account of the challenges that were faced when applying a gradient-informed optimization algorithm using a Monte Carlo calculation to estimate the gradient information and compares a gradient descent optimization method to a genetic algorithm optimization of the same geometry. Overall, this work demonstrates the potential use of adjoint-based gradient calculations in design optimization of nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Nonlinear Multiobjective MPC-Based Optimal Operation of a High Consistency Refining System in Papermaking

As one of the most important unit in the papermaking industry, the high consistency (HC) refining system is confronted with challenges such as improving pulp quality, energy saving, and emissions reduction in its operation processes. Here in this correspondence, an optimal operation of HC refining system is presented using nonlinear multiobjective model predictive control strategies that aim at set-point tracking objective of pulp quality, economic objective, and specific energy (SE) consumption objective, respectively. First, a set of input and output data at different times are employed to construct the subprocess model of the state process model for the HC refining system, and then the Wiener-type model can be obtained through combining the mechanism model of Canadian Standard Freeness and the state process model that determines their structures based on Akaike information criterion. Second, the multiobjective optimization strategy that optimizes both the set-point tracking objective of pulp quality and SE consumption is proposed simultaneously, which uses NSGA-II approach to obtain the Pareto optimal set. Furthermore, targeting at the set-point tracking objective of pulp quality, economic objective, and SE consumption objective, the sequential quadratic programming method is utilized to produce the optimal predictive controllers. In conclusion, the simulation results demonstrate that the proposed methods can make the HC refining system provide a better performance of set-point tracking of pulp quality when these predictive controllers are employed. In addition, while the optimal predictive controllers orienting with comprehensive economic objective and SE consumption objective, it has been shown that they have significantly reduced the energy consumption.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Improved Manufacturability and Throughput of Ultra- Transparent, Super-Insulating Aerogels

AeroShield Materials produces a novel silica aerogel material with exemplary thermal performance and unprecedented optical clarity, offering the potential for super-insulating fenestration and insulated glass to reduce thermal losses in the built environment by billions of dollars every year. One of the most significant challenges facing AeroShield today is the total amount of time that is required to produce large monolithic aerogel samples. This overall process can require as much as 144 hours total, which can significantly hinder scale-up to an economically viable product. The purpose of this Phase 1 research was to continue development of our novel aerogel manufacturing process to reduce material processing time by up to 10x, greatly improving product throughput and reducing cost. AeroShield’s manufacturing process can be divided into 4 major stages, each with their own distinct set of parameters and time requirements. Under this Phase 1 award, AeroShield was able to identify and optimize a number of these parameters, including molding materials, solvent rinse conditions, critical point drying time, and annealing conditions. AeroShield also performed thorough analyses on how these optimized parameters affected important final characteristics of the gels, including optical clarity, thermal conductivity, and dimensional stability. This campaign culminated in the production of laboratory scale aerogel samples using significantly lower process times of both 36 and 18 total hours, which represent Phase 1 Target and Stretch goals. In order to achieve widespread market adoption, monolithic sheets of the aerogel material must be made to industry-standard sizes (8’ x 12’) at a cost that provides 5-7 year or less breakeven energy savings for consumers (<$2 sq/ft). The work performed under this Phase 1 award shows that time and materials required to make aerogel samples, which make up a significant portion of their overall cost, can be greatly reduced without sacrificing quality. AeroShield plans to use these optimized processes to produce larger, product-relevant sized aerogels in order to achieve target final material costs.

Wilke, Kyle↗

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗

Impact and mitigation of polarized extragalactic foregrounds on Bayesian cosmic microwave background lensing

Future low-noise cosmic microwave background (CMB) lensing measurements from e.g., CMB-S4 will be polarization dominated, rather than temperature dominated. In this new regime, statistically optimal lensing reconstructions outperform the standard quadratic estimator, but their sensitivity to extragalactic polarized foregrounds has not been quantified. Using realistic simulations of polarized radio and infrared point sources, we show for the first time that optimal Bayesian lensing from a CMB-S4-like experiment is insensitive to the expected level of polarized extragalactic foregrounds after masking, as long as an accurate foreground power spectrum is included in the analysis. For more futuristic experiments where these foregrounds could cause a detectable bias, we propose a new method to jointly fit for lensing and the Poisson foregrounds, generalizing the bias hardening from the standard quadratic estimator to Bayesian lensing.

cosmic microwave background↗

ZEUS: An Efficient GPU Optimization Method Integrating PSO, BFGS, and Automatic Differentiation

We introduce a novel, efficient computational method, ZEUS, for numerical optimization, and provide an open-source implementation. It has four key ingredients: (1) particle swarm optimization (PSO), (2) the use of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method, (3) automatic differentiation (AD), and (4) GPUs. Our approach addresses the computational challenges inherent in high-dimensional, non-convex optimization problems. In the first phase of the algorithm, we get a potentially good set of starting points using PSO. Thereafter, we run BFGS independently in parallel from these starting points. BFGS is one of the best-performing algorithms for numerical optimization. However, it requires the gradient of the function being optimized. ZEUS integrates automatic differentiation into BFGS thus avoiding the need for the user to calculate derivatives explicitly. The use of GPUs allows ZEUS to speed up the calculations substantially. We carry out systematic studies to explore the trade-offs between the number of PSO iterations taken, starting points, and BFGS iteration depth. We show that a handful of iterations of PSO can improve global convergence when combined with BFGS. We also present performance studies using common test functions. The source code can be found at https://github.com/fnal-numerics/global-optimizer-gpu.

Soos, Dominik [Old Dominion U.]↗

Identifying native point defect configurations in α-alumina

Intimately intertwined atomic and electronic structures of point defects govern diffusion-limited corrosion and underpin the operation of optoelectronic devices. For some materials, complex energy landscapes containing metastable defect configurations challenge first-principles modeling efforts. Here, we thoroughly reevaluate native point defect geometries for the illustrative case of α-Al 2 O 3 by comparing three methods for sampling candidate geometries in density functional theory calculations: displacing atoms near a naively placed defect, initializing interstitials at high-symmetry points of a Voronoi decomposition, and Bayesian optimization. We find symmetry-breaking distortions for oxygen vacancies in some charge states, and we identify several distinct oxygen split-interstitial geometries that help explain literature discrepancies involving this defect. We also report a surprising and, to our knowledge, previously unknown trigonal geometry favored by aluminum interstitials in some charge states. Importantly, these new configurations may have transformative impacts on our understanding of defect migration pathways in aluminum-oxide scales protecting metal alloys from corrosion. Overall, the Voronoi scheme appears most effective for sampling candidate interstitial sites because it always succeeded in finding the lowest-energy geometry identified in this study, although no approach found every metastable configuration. Finally, we show that the position of defect levels within the band gap can depend strongly on the defect geometry, underscoring the need to conduct careful searches for ground-state geometries in defect calculations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Development of a Vibration Technique Based on Geometric Optimization for Fatigue Life Evaluation of Sandwich Composite Structures

A major obstacle to obtaining cost-effective experimental data on the fatigue life of sandwich panels is the prohibitive amount of time and cost required to carry out millions of cycles. On the other hand, vibration techniques applied to sandwich geometries fail to match the stress patterns that are obtained from standard flexural fatigue tests. To overcome such limitations, a vibration-based fatigue technique is proposed, which entails the use of sandwich specimens whose geometries are optimized to reproduce the stress distribution observed during three point bend loading while vibrating at the first resonant frequency. The proposed vibration technique was experimentally validated. The results, compared with the average number of cycles to failure at different stress ratios obtained via the Three-Point Bending test, showed high levels of accuracy. The proposed method is robust and time effective and indicates the possibility of attaining fatigue lifetime prediction of a wide class of composite elements, such as sandwich panels.

36 MATERIALS SCIENCE↗

Deep reinforcement learning assisted co-optimization of Volt-VAR grid service in distribution networks

With the increasing penetration of distributed energy resources in distribution networks, Volt-VAR control and optimization (VVC/VVO) have become very important to ensure an acceptable quality of service to all customers. System operators can rely on slow-responding utility devices, including capacitor banks and on-load tap changing transformers, along with fast-responding battery and photovoltaic (PV) inverters for the VVC/VVO implementation. Because of variations in response time of these two classes of devices, and different control actions (discrete versus continuous), coordinated and optimal scheduling and operation have become of utmost importance. Here, this paper develops a look-ahead deep reinforcement learning (DRL)-based multi-objective VVO technique to improve the voltage profile of active distribution networks, decrease network and inverter power loss, and save the operational cost of the grid. It proposes a deep deterministic policy gradient (DDPG)-based approach to schedule the optimal reactive and/or active power set-points of fast-responding inverters, and a deep Q-network (DQN)-based DRL agent to schedule the discrete decisions variables of slow-responding assets. The reactive power output of PV and battery smart inverters are scheduled at 30-minute intervals and the capacitors’ commitment status is scheduled with several hour intervals. The proposed framework is validated on the modified IEEE 34-bus and 123-bus test cases with embedded PV and PV-plus-storage. To validate the efficacy of the proposed VVO, it is compared with several scenarios, including the base case without VVO, localized droop control of DERs, DDPG-only, and twin delayed DDPG (TD3) agent-based DRL techniques. The results justify the superior performance of the proposed method to improve the voltage profile, reduce network power loss, and minimize the look-ahead grid operational cost while minimizing the undesirable power losses in inverters as a result of power factor adjustments.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Chapter 6: Surrogate Model Guided Optimization Algorithms and Their Potential Use in Autonomous Experimentation

This chapter reviews the basics of derivative-free optimization methods based on surrogate models and outlines how these methods can straightforwardly be applied to autonomously steering experimentation. It summarizes general solution approaches that use surrogate models and active learning. Surrogate modeling is often combined with active learning strategies, where in each iteration of the optimization algorithm, the surrogate model is used to identify which new inputs should be evaluated next and given the new input-output pair, the surrogate model is updated. Regardless of feasibility, the surrogate models for the constraints are updated in each iteration of the optimization algorithm, while the surrogate model for the objective function is only updated when a feasible point has been found. Similarly to the case of computationally cheap constraints, the surrogate models of the constraints should be incorporated into the definition of the auxiliary optimization problem that is solved to select new sample points.

active learning↗

K-Spin Hamiltonian for Quantum-Resolvable Markov Decision Processes

The Markov decision process is the mathematical formalization underlying the modern field of reinforcement learning when transition and reward functions are unknown. We derive a pseudo-Boolean cost function that is equivalent to a K-spin Hamiltonian representation of the discrete, finite, discounted Markov decision process with infinite horizon. This K-spin Hamiltonian furnishes a starting point from which to solve for an optimal policy using heuristic quantum algorithms such as adiabatic quantum annealing and the quantum approximate optimization algorithm on near-term quantum hardware. In arguing that the variational minimization of our Hamiltonian is approximately equivalent to the Bellman optimality condition for a prevalent class of environments we establish an interesting analogy with classical field theory. Along with proof-of-concept calculations to corroborate our formulation by simulated and quantum annealing against classical Q-Learning, we analyze the scaling of physical resources required to solve our Hamiltonian on quantum hardware.

Hamiltonian↗

KSSOLV 2.0: An efficient MATLAB toolbox for solving the Kohn-Sham equations with plane-wave basis set

KSSOLV (Kohn-Sham Solver) is a MATLAB toolbox for performing Kohn-Sham density functional theory (DFT) calculations with a plane-wave basis set. KSSOLV 2.0 preserves the design features of the original KSSOLV software to allow users and developers to easily set up a problem and perform ground-state calculations as well as to prototype and test new algorithms. Furthermore, it includes new functionalities such as new iterative diagonalization algorithms, k-point sampling for electron band structures, geometry optimization and advanced algorithms for performing DFT calculations with local, semi-local, and hybrid exchange-correlation functionals. It can be used to study the electronic structures of both molecules and solids. So, we describe these new capabilities in this work through a few use cases. We also demonstrate the numerical accuracy and computational efficiency of KSSOLV on a variety of examples.

97 MATHEMATICS AND COMPUTING↗

Size effect on the growth and pulverization behavior of Si nanodomains in SiO anode

Silicon monoxide (SiO) as a promising silicon-based anode electrode of lithium-ion batteries (LIBs) has been the subject of many recent investigations. However, the complex microstructural features of SiO hinder attempts to link the microstructure changes in SiO with its electrochemical performances upon electrochemical cycling. This study employs X-ray pair distribution function (PDF), with a high-resolution transmission electron microscope (HRTEM), to investigate the microstructure of Si nanodomains in SiO and its structural evolution over the electrochemical cycling process. The experiment results reveal the size evolution of Si nanodomains in SiO during the electrochemical cycling and find it highly dependent on the initial Si domain size in SiO. If the initial Si domain size is too large, the average size of Si nanodomains would increase at first and then decrease after a certain number of cycles, which indicates the pulverization of Si domains after the electrochemical-driven growth of Si nanodomains reaches a critical point. Furthermore, these results suggest that an optimal initial Si nanodomain size of 4-6 nm for SiO anode materials is essential to retard the growth and subsequent pulverization process of Si nanodomains and thus to improve the cyclability of SiO during long-term cycling.

25 ENERGY STORAGE↗

TomocuPy – efficient GPU-based tomographic reconstruction with asynchronous data processing

Fast 3D data analysis and steering of a tomographic experiment by changing environmental conditions or acquisition parameters require fast, close to real-time, 3D reconstruction of large data volumes. Here a performance-optimized TomocuPy package is presented as a GPU alternative to the commonly used central processing unit (CPU) based TomoPy package for tomographic reconstruction. TomocuPy utilizes modern hardware capabilities to organize a 3D asynchronous reconstruction involving parallel read/write operations with storage drives, CPU–GPU data transfers, and GPU computations. In the asynchronous reconstruction, all the operations are timely overlapped to almost fully hide all data management time. Since most cameras work with less than 16-bit digital output, the memory usage and processing speed are furthermore optimized by using 16-bit floating-point arithmetic. As a result, 3D reconstruction with TomocuPy became 20–30 times faster than its multi-threaded CPU equivalent. Full reconstruction (including read/write operations and methods initialization) of a 2048 3 tomographic volume takes less than 7 s on a single Nvidia Tesla A100 and PCIe 4.0 NVMe SSD, and scales almost linearly increasing the data size. To simplify operation at synchrotron beamlines, TomocuPy provides an easy-to-use command-line interface. Efficacy of the package was demonstrated during a tomographic experiment on gas-hydrate formation in porous samples, where a steering option was implemented as a lens-changing mechanism for zooming to regions of interest.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Accelerating crystal structure determination with iterative AlphaFold prediction

Experimental structure determination can be accelerated with artificial intelligence (AI)-based structure-prediction methods such as AlphaFold . Here, an automatic procedure requiring only sequence information and crystallographic data is presented that uses AlphaFold predictions to produce an electron-density map and a structural model. Iterating through cycles of structure prediction is a key element of this procedure: a predicted model rebuilt in one cycle is used as a template for prediction in the next cycle. This procedure was applied to X-ray data for 215 structures released by the Protein Data Bank in a recent six-month period. In 87% of cases our procedure yielded a model with at least 50% of C α atoms matching those in the deposited models within 2 Å. Predictions from the iterative template-guided prediction procedure were more accurate than those obtained without templates. It is concluded that AlphaFold predictions obtained based on sequence information alone are usually accurate enough to solve the crystallographic phase problem with molecular replacement, and a general strategy for macromolecular structure determination that includes AI-based prediction both as a starting point and as a method of model optimization is suggested.

59 BASIC BIOLOGICAL SCIENCES↗

DC-Ripple-Energy Adaptive-Minimization (DREAM) Modulation Scheme for a High Power Density Inverter

The DC bus capacitor is one of the major power-density and reliability hurdles of electric drive systems. It is hard to shrink because it is constrained by the DC bus RMS ripple current, which is only load dependent. A dual-inverter based segmented drive can reduce the ripple current by ~50% compared to a non-segmented case. This paper analyzes the origin of this ripple current and points out the path for minimization. An optimal DC-ripple-energy adaptive-minimization (DREAM) modulation method is proposed to further reduce the ripple current. It is observed in experimental results that the proposed method can achieve additional 38% reduction over the traditional segmented drive system.

Xue, Lincoln↗

Safe Deep Reinforcement Learning for Robust Frequency and Voltage-Constrained Networked Microgrid Restoration

Here, this paper proposes a safe soft actor-critic reinforcement learning (RL) algorithm–based controller for networked microgrid restoration. It formulates the post black-start start as a finite-horizon constrained Markov decision process. The RL agent co-optimizes real and reactive power set-points for both grid-forming and grid-following inverters under explicit voltage and frequency constraints, while enforcing proper power sharing via the Mean Active Power Sharing Index (MPSI) and Mean Reactive Power Sharing Index (MQSI). Numerical results obtained on the IEEE 123-bus distribution system show that the proposed method achieves a mean voltage build-up time of 0.01 s without breaching the 5% sharing-violation budget under various load scenarios, considering MPSI and MQSI indices. These findings demonstrate that the proposed method yields fast and safe black-start schedules without resorting to heuristic penalties.

Selim, Alaa [Dartmouth College, Hanover, NH (Unite↗

Massively parallel and universal approximation of nonlinear functions using diffractive processors

Nonlinear computation is essential for a wide range of information processing tasks, yet implementing nonlinear functions using optical systems remains a challenge due to the weak and power-intensive nature of optical nonlinearities. Overcoming this limitation without relying on nonlinear optical materials could unlock unprecedented opportunities for ultrafast and parallel optical computing systems. Here, we demonstrate that large-scale nonlinear computation can be performed using linear optics through optimized diffractive processors composed of passive phase-only surfaces. In this framework, the input variables of nonlinear functions are encoded into the phase of an optical wavefront—e.g., via a spatial light modulator (SLM)—and transformed by an optimized diffractive structure with spatially varying point-spread functions to yield output intensities that approximate a large set of unique nonlinear functions–all in parallel. We provide proof establishing that this architecture serves as a universal function approximator for an arbitrary set of bandlimited nonlinear functions, also covering wavelength-multiplexed nonlinear functions as well as multi-variate and complex-valued functions that are all-optically cascadable. Our analysis also indicates the successful approximation of typical nonlinear activation functions commonly used in neural networks, including the sigmoid, tanh, ReLU (rectified linear unit), and softplus. We numerically demonstrate the parallel computation of one million distinct nonlinear functions, accurately executed at wavelength-scale spatial density at the output of a diffractive optical processor. Furthermore, we experimentally validated this framework using in situ optical learning and approximated 35 unique nonlinear functions in a single shot using a compact setup consisting of an SLM and an image sensor. These results establish diffractive optical processors as a scalable platform for massively parallel universal nonlinear function approximation, paving the way for new capabilities in analog optical computing based on linear materials.

Rahman, Md Sadman Sakib [University of California,↗