Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational 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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Multi-tool optimization for computer controlled optical surfacing

With the rapid development of precision technologies, the demand of high-precision optical surfaces has drastically increased. These optical surfaces are mainly fabricated with computer controlled optical surfacing (CCOS). In a CCOS process, a target surface removal profile is achieved by scheduling the dwell time for a set of machine tools. The optimized dwell time should be positive and smooth to ensure convergence to the target while considering CNC dynamics. The total run time of each machine tool is also expected to be balanced to improve the overall processing efficiency. In the past few decades, dwell time optimization for a single machine tool has been extensively developed. While the methods are applicable to multi-tool scenarios, they fail to consider the overall contributions of multiple tools simultaneously. In this paper, we conduct a systematic study on the strategies for multi-tool dwell time optimization and propose an innovative method for simultaneously scheduling dwell time for multiple tools for the first time. First, the influential factors to the positiveness and smoothness of dwell time solutions for a single machine tool are analyzed. The compensation strategies that minimize the residual while considering the CNC dynamics limit are then proposed. Afterwards, these strategies are extended to the proposed multi-tool optimization that further balances the run time of machine tools. Finally, the superiority of each strategy is carefully studied via simulation and experiment. The experiment is performed by bonnet polishing a 60 mm × 60 mm mirror with three tools of different diameters ( i.e., 12 mm, 8 mm, and 5 mm). The figure error of the mirror is reduced from 45.42 nm to 11.18 nm root mean square in 13.28 min. Moreover, the measured polishing result well coincides with the estimation, which proves the effectiveness of the proposed method.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Dielectric Resonator Design for Low Power and Low Temperature Microwave Plasma

Waveguide-based microwave plasmas generally operate at high temperatures (2000 - 6000K)[1], making it difficult to directly interface solid materials with the plasma without significant thermal damage. Dielectric microwave resonators (DMRs), long studied for wave-based manipulation of electromagnetic radiation for telecom and optics, can focus radiation to extremely small mode volumes, creating intense localized fields with low-power input.[2] This phenomenon can be used for applications ranging from efficient plasma electronics to near-ambient plasma-materials interactions. Such DMR-based plasmas have been demonstrated a handful of times in the literature, but the majority of research towards this utilize the lowest frequency resonance mode.[3], [4], [5] By carefully controlling the geometry of cylindrical resonators, a variety of electromagnetic modes can be excited. In this work, COMSOL Multiphysics simulations are used to study the electric field enhancement and absorption properties of CaTiO3 DMRs as a function of geometry and excitation frequency. Whereas previous studies have utilized the HEM111 resonance frequency to drive low power plasma excitation, we find that higher order resonance frequencies are more effective at field enhancement and result in less power loss within the dielectric material, hence less wasted heating. The effectiveness of these modes is also geometry dependent and can be computationally optimized for plasma generation. Complementing these computational efforts, we demonstrate a new closed-system reactor design built in a WR-650 waveguide and experimentally demonstrate the formation of atmospheric argon microwave plasma using < 30 W input power on DMR dimers. We observe a shifting resonance frequency as the DMRs heat in response to microwave excitation and develop a Python-based lock-in mechanism to effectively track the DMR resonance over time, leading to stable plasma operation. We use infrared thermal imaging to monitor the temperature of the DMR dimers and surrounding quartz chamber, demonstrating thermal temperatures < 60 degreesC. Finally, we utilize optical emission spectroscopy (OES) to probe the plasma properties as a function of the resonance mode.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Explosively driven Richtmyer–Meshkov instability jet suppression and enhancement via coupling machine learning and additive manufacturing

The ability to control the behavior of fluid instabilities at material interfaces, such as the shock-driven Richtmyer–Meshkov instability, is a grand technological challenge with a broad number of applications ranging from inertial confinement fusion experiments to explosively driven shaped charges. In this work, we use a linear-geometry shaped charge as a means of studying methods for controlling material jetting that results from the Richtmyer–Meshkov instability. A shaped charge produces a high-velocity jet by focusing the energy from the detonation of high explosives. The interaction of the resulting detonation wave with a hollowed cavity lined with a thin metal layer produces the unstable jetting effect. By modifying the characteristics of the detonation wave prior to striking the lined cavity, the kinetic energy of the jet can be enhanced or reduced. Modifying the geometry of the liner material can also be used to alter jetting properties. We apply optimization methods to investigate several design parameterizations for both enhancing or suppressing the shaped-charge jet. This is accomplished using 2D and 3D hydrodynamic simulations to investigate the design space that we consider. We also apply new additive manufacturing methods for producing the shaped-charge assemblies, which allow for the experimental testing of complicated design geometries obtained through computational optimization. We present a direct comparison of our optimized designs with experimental results carried out at the High Explosives Application Facility at Lawrence Livermore National Laboratory.

36 MATERIALS SCIENCE↗
DOE OSTI2021

TEAM Project Review, Year 2

This report summarizes our research activities within the TEAM project between December 2020 and December 2021, funded by the ASCR Advanced Research in Quantum Computing program. During the reporting period the LLNL-MSU team has made progress on several fronts. An overarching goal of the team is to provide a comprehensive suite of software tools that can be used for the Characterize-Optimize-Compute loop needed to implement and execute algorithms on quantum devices. We are concurrently developing lightweight solvers that can be used on desktop computers to find optimal control pulses and to characterize small quantum systems (consisting of a few transmons and cavities). However, desktop computers are insufficient for simulating and characterizing larger quantum systems. We have therefore also developed parallel, distributed memory, simulators and optimization solvers, both for open and closed quantum systems. These parallel solvers have, for example, been used to study quantum optimal control for pure-state preparation, utilizing 1000’s of cores on a modern high-performance computing (HPC) platform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Review of multi-fidelity models

Multi-fidelity models provide a framework for integrating computational models of varying complexity, allowing for accurate predictions while optimizing computational resources. These models are especially beneficial when acquiring high-accuracy data is costly or computationally intensive. This review offers a comprehensive analysis of multi-fidelity models, focusing on their applications in scientific and engineering fields, particularly in optimization and uncertainty quantification. It classifies publications on multi-fidelity modeling according to several criteria, including application area, surrogate model selection, types of fidelity, combination methods and year of publication. The study investigates techniques for combining different fidelity levels, with an emphasis on multi-fidelity surrogate models. Here this work discusses reproducibility, open-sourcing methodologies and benchmarking procedures to promote transparency. The manuscript also includes educational toy problems to enhance understanding. Additionally, this paper outlines best practices for presenting multi-fidelity-related savings in a standardized, succinct and yet thorough manner. The review concludes by examining current trends in multi-fidelity modeling, including emerging techniques, recent advancements, and promising research directions.

42 ENGINEERING↗
DOE OSTI2023

Non-Empirical and Self-Interaction Corrections for DFTB: Towards Accurate Quantum Simulations for Large Mesoscale Systems (Final Report)

This project was comprised of two complementary (but parallel) thrusts: (1) implementing massively-parallelized computing hardware (with new computational hardware that may replace GPUs) in the density functional tight binding (DFTB) approach and (2) developing new capabilities in DFTB to calculate the electronic structure and dynamics of large chemical systems. While classical molecular dynamics can handle hundreds of thousands of atoms, it cannot provide a first-principles based description of chemical systems at the quantum level. At the other extreme, conventional Kohn-Sham DFT methods can probe the true quantum mechanical nature of chemical systems; however, these methods cannot tackle the large sizes and length scales relevant to dynamics simulations of realistic systems. The DFTB formalism utilized in this project provides a viable approach for probing these large systems at a quantum mechanical level of detail. However, to utilize the DFTB approach for accurate calculations of electronic properties, it is crucial to incorporate quantum-based corrections in DFTB since exchange-correlation effects can still remain very strong in these large systems. At the same time, enhancing the computational efficiency of DFTB is also essential since optimal computational performance is required for addressing the large size scales associated with realistic chemical systems. As such, the new non-empirical corrections and computing hardware enhancements implemented in this project will enable accurate and computationally efficient approaches to directly probe electronic properties in these large, complex systems.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Towards an Agent-Based Blackboard System for Reactor Design Optimization

The field of reactor design is rich with opportunities for applications of computational optimization algorithms; these applications can range from preliminary core design to reactor shuffling patterns. Many of these schemes rely on sets of previously generated solutions (sometimes referred to as “generations”) to inform future decisions. While it is important to build upon prior knowledge, this process requires a full generation of solutions to be formed before future solutions can be examined. Rather than relying on a generational scheme to perform an optimization, we propose using an agent-based approach in conjunction with a blackboard framework for performing reactor design optimizations. Utilizing an agent-based approach allows agents to perform tasks independently, while retaining the ability to build off of previous solutions. We develop an agent-based blackboard system (ABBS) for determining the Pareto front (PF) in sodium fast reactor design optimization problems and compared this with the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). Our goal is to evaluate the viability of the ABBS in producing a PF that is comparable with the NSGA-II algorithm. The design space consists of the fuel height, fuel smear, and plutonium fraction in the core, and we seek to minimize the reactivity swing and plutonium mass, while maximizing the burnup. The diversity, coverage, and spread of the PFs generated by the two methods are examined, and the ABBS is able to converge to the same PF as the NSGA-II algorithm. These results show that the ABBS is able to find optimal designs that are similar to those found by the NSGA-II algorithm. We conclude our study by applying the ABBS to the design of a sodium-cooled fast reactor to dispose of weapons-grade plutonium. The ABBS finds a core design that can burn upwards of 17.5 kg of weapons-grade plutonium per year and degrade an additional 195 kg of weapons-grade plutonium per year into non-weapons-grade material.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Generating Euler Diagrams Through Combinatorial Optimization

Abstract Can a given set system be drawn as an Euler diagram? We present the first method that correctly decides this question for arbitrary set systems if the Euler diagram is required to represent each set with a single connected region. If the answer is yes, our method constructs an Euler diagram. If the answer is no, our method yields an Euler diagram for a simplified version of the set system, where a minimum number of set elements have been removed. Further, we integrate known wellformedness criteria for Euler diagrams as additional optimization objectives into our method. Our focus lies on the computation of a planar graph that is embedded in the plane to serve as the dual graph of the Euler diagram. Since even a basic version of this problem is known to be NP‐hard, we choose an approach based on integer linear programming (ILP), which allows us to compute optimal solutions with existing mathematical solvers. For this, we draw upon previous research on computing planar supports of hypergraphs and adapt existing ILP building blocks for contiguity‐constrained spatial unit allocation and the maximum planar subgraph problem. To generate Euler diagrams for large set systems, for which the proposed simplification through element removal becomes indispensable, we also present an efficient heuristic. We report on experiments with data from MovieDB and Twitter. Over all examples, including 850 non‐trivial instances, our exact optimization method failed only for one set system to find a solution without removing a set element. However, with the removal of only a few set elements, the Euler diagrams can be substantially improved with respect to our wellformedness criteria.

Computer Science↗
DOE OSTI2023

Renewable electricity capacity planning with uncertainty at multiple scales

Abstract We formulate and compare optimization models of investment in renewable generation using a suite of social planning models that compute optimal generation capacity investments for a hydro-dominated electricity system where inflow uncertainty results in a risk of energy shortage. The models optimize the expected cost of capacity expansion and operation allowing for investments in hydro, geothermal, solar, wind, and thermal plant, as well as battery storage for smoothing load profiles. A novel feature is the integration of uncertain seasonal hydroelectric energy supply and short-term variability in renewable supply in a two-stage stochastic programming framework. The models are applied to data from the New Zealand electricity system and used to estimate the costs of moving to a 100% renewable electricity system by 2035. We also explore the outcomes obtained when applying different forms of CO 2 constraint that limit respectively non-renewable capacity, non-renewable generation, and CO 2 emissions on average, almost surely, or in a chance-constrained setting, and show how our models can be used to investigate the merits of a proposed pumped-hydro scheme in New Zealand’s South Island.

Ferris, Michael C.↗
DOE OSTI2026

Intrusive Uncertainty Quantification and Optimal Experiment Design in the Open-Source Pyomo Ecosystem

This contribution describes ParmEst and Pyomo.DoE, two pillars of the open-source Python-based Pyomo ecosystem for computational optimization with (partial differential) algebraic equation mathematical models. Specifically, ParmEst facilitates intrusive frequentist parameter estimation (PE) and uncertainty quantification (UQ) through built-in features, such as covariance matrix estimation, bootstrapping, and likelihood ratio tests. Complementary, Pyomo.DoE enables optimal experiment design by maximizing various metrics of the Fisher information matrix, such as A-optimality (trace), D-optimality (determinant), E-optimality (minimum eigenvalue), and ME-optimality (condition number). ParmEst and Pyomo.DoE can solve high-dimensional optimization problems by leveraging the model structure and exact derivative information. Finally, we will discuss future opportunities to integrate PE and UQ capabilities with optimization under uncertainty, including robust optimization with non-convex models via PyROS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Universal energy-speed-accuracy trade-offs in driven nonequilibrium systems

The connection between measure theoretic optimal transport and dissipative nonequilibrium dynamics provides a language for quantifying nonequilibrium control costs, leading to a collection of thermodynamic speed limits, which rely on the assumption that the target probability distribution is perfectly realized. This is almost never the case in experiments or numerical simulations, so here we address the situation in which the external controller is imperfect. We obtain a lower bound for the dissipated work in generic nonequilibrium control problems that (1) is asymptotically tight and (2) matches the thermodynamic speed limit in the case of optimal driving. Along with analytically solvable examples, we refine this imperfect driving notion to systems in which the controlled degrees of freedom are slow relative to the nonequilibrium relaxation rate, and identify independent energy contributions from fast and slow degrees of freedom. Furthermore, we develop a strategy for optimizing minimally dissipative protocols based on optimal transport flow matching, a generative machine learning technique. Furthermore, this latter approach ensures the scalability of both the theoretical and computational framework we put forth. Crucially, we demonstrate that we can compute the terms in our bound numerically using efficient algorithms from the computational optimal transport literature and that the protocols we learn saturate the bound.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

AlignOT: An Optimal Transport Based Algorithm for Fast 3D Alignment With Applications to Cryogenic Electron Microscopy Density Maps

Aligning electron density maps from Cryogenic electron microscopy (cryo-EM) is a first key step for studying multiple conformations of a biomolecule. As this step remains costly and challenging, with standard alignment tools being potentially stuck in local minima, we propose here a new procedure, called AlignOT, which relies on the use of computational optimal transport (OT) to align EM maps in 3D space. By embedding a fast estimation of OT maps within a stochastic gradient descent algorithm, our method searches for a rotation that minimizes the Wasserstein distance between two maps, represented as point clouds. Here, we quantify the impact of various parameters on the precision and accuracy of the alignment, and show that AlignOT can outperform the standard local alignment methods, with an increased range of rotation angles leading to proper alignment. We further benchmark AlignOT on various pairs of experimental maps, which account for different types of conformational heterogeneities and geometric properties. As our experiments show good performance, we anticipate that our method can be broadly applied to align 3D EM maps.

3D alignment↗
DOE OSTI2024

CIRCLEZ : Reliable photometric redshifts for active galactic nuclei computed solely using photometry from Legacy Survey Imaging for DESI

Photometric redshifts for galaxies hosting an accreting supermassive black hole in their center, known as active galactic nuclei (AGNs), are notoriously challenging. At present, they are most optimally computed via spectral energy distribution (SED) fittings, assuming that deep photometry for many wavelengths is available. However, for AGNs detected from all-sky surveys, the photometry is limited and provided by a range of instruments and studies. This makes the task of homogenizing the data challenging, presenting a dramatic drawback for the millions of AGNs that wide surveys such as SRG/eROSITA are poised to detect. This work aims to compute reliable photometric redshifts for X-ray-detected AGNs using only one dataset that covers a large area: the tenth data release of the Imaging Legacy Survey (LS10) for DESI. LS10 provides deep grizW1-W4 forced photometry within various apertures over the footprint of the eROSITA-DE survey, which avoids issues related to the cross-calibration of surveys. We present the results from CIRCLEZ, a machine-learning algorithm based on a fully connected neural network. CIRCLEZ is built on a training sample of 14 000 X-ray-detected AGNs and utilizes multi-aperture photometry, mapping the light distribution of the sources. The accuracy (σNMAD) and the fraction of outliers (η) reached in a test sample of 2913 AGNs are equal to 0.067 and 11.6%, respectively. The results are comparable to (or even better than) what was previously obtained for the same field, but with much less effort in this instance. We further tested the stability of the results by computing the photometric redshifts for the sources detected in CSC2 and Chandra-COSMOS Legacy, reaching a comparable accuracy as in eFEDS when limiting the magnitude of the counterparts to the depth of LS10. The method can be applied to fainter samples of AGNs using deeper optical data from future surveys (for example, LSST, Euclid), granting LS10-like information on the light distribution beyond the morphological type. Along with this paper, we have released an updated version of the photometric redshifts (including errors and probability distribution functions) for eROSITA/eFEDS.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Role of Computational Parameters on Predicting Self-Consistent Residual Stress and Distortion during Wire Arc Additive Manufacturing

Production of three-dimensional metallic parts through integration of an articulated robot and gas metal arc welding, also known as wire arc additive manufacturing (WAAM), can produce large-scale components with moderate geometrical complexity. This technology is particularly appealing due to its high deposition rates, scalability, and cost-effective feedstock compared to other AM processes. Despite its advantages, WAAM adoption is hindered by challenges in ensuring geometric conformity without extensive distortion, defect-free structures, and consistent mechanical properties. Finite element analysis (FEA) is often used to address the challenge of geometrical conformity. As the size of parts increases, the best practices for mesh size and temporal resolution known in the literature become computationally unviable. This research examined the effects of mesh and time-step resolutions during transient FEA of a large-scale (248 layers) metallic part. The impact of computational parameters on the thermal history, displacement, and residual stress distributions were evaluated. The results showed that predicted distortion was consistent across resolutions, while time-step length significantly affected predicted thermal history, and mesh size influenced residual stress distributions. To investigate this relationship further, directionally biased meshes were considered and analyzed. The results indicated that increasing mesh resolution perpendicular to the welding path yielded stress predictions that aligned closely with higher-resolution models while offering substantial computational savings. In conclusion, the significances of this research are related to verification and validation of WAAM models for widespread industrial adoption and pragmatic guidelines for optimizing computation parameters for balancing computational efficiency and predictive accuracy of residual stress and distortion.

Solsbee, Brandon [Univ. of Tennessee, Knoxville, T↗
DOE OSTI2024

Using Computer Simulations to Optimize Biofuel Production

The DOE strives to ensure America's security and prosperity by addressing energy challenges. NREL shares this goal and tries to achieve a clean energy world. Fossil fuels are problematic for both organizations. Using them endangers American security. Their supply is finite and burning them causes environmental damage. Biofuels are a good alternative to fossil fuels. They are renewably produced on American soil and can lower greenhouse gas emissions. Also, cars and planes need no costly mechanical adjustments to use biofuels. However, the fuels themselves are expensive. For my SULI project, I reduced the cost of biofuels by optimizing the production process through computer simulations. Existing simulations were accurate but slow. One simulation takes up to eight hours, and researchers must do hundreds. My solution reduces the computing time. I treated the biomass particles in the simulation as one-dimensional. That simplified the simulation equations, making them easier for the computer to solve. Still, biomass particles are three-dimensional. The 1D assumption was wrong and produced inaccurate results. To maintain accuracy while increasing speed, I developed a method to convert 1D simulation results into usable 3D data. I adjusted the 1D simulation until the output matched the 3D results for a specific environment. I found out how much the simulation changed when the environment changed. Machine learning algorithms defined a relationship between 1D and 3D data for all environments. This lets scientists convert fast 1D simulation results into valid 3D data.

1D↗
DOE OSTI2024

Efficient Anomaly Detection Driven By Different Machine Learning Architectures And Models

The rapid growth and ubiquitous adoption of the internet and cyber-physical systems (CPS) have fundamentally transformed modern communication, work, and human-system interactions. While networks now form the backbone of critical digital ecosystems, enabling seamless data transmission across diverse, interconnected systems, this increased connectivity also expands the attack surface, making real-time detection of network intrusions and anomalies a pressing challenge. Detecting unusual activities within network infrastructure requires advanced data traffic analysis to differentiate between legitimate and malicious interactions. Traditional approaches to network anomaly detectionâ??such as rule-based and signature-based systemsâ??often depend on predefined patterns to identify known anomalies, limiting their effectiveness against emerging, stealthy, or previously unseen threats. These conventional methods suffer from high false alarm rates and fail to adapt to the ever-evolving nature of network traffic, particularly in large-scale, decentralized environments where data volume, velocity, and variety are constantly increasing. This dissertation presents artificial intelligence (AI)-driven approaches to anomaly detection that leverage graphics processing unit (GPU)-enabled high-performance computing (HPC) platforms for processing massive network traffic data and monitoring the components of cyber-physical systems (CPS) for potentially hazardous conditions. The research advances several key contributions: (1) Designing efficient machine learning techniques for CPS condition monitoring and anomaly detection; (2) enabling federated learning (FL) frameworks that enable distributed detection while preserving data privacy and system resilience; (3) exploring graph-based methodologies combining graph neural networks (GNN) and graph machine learning (ML) approaches for the Internet of Things (IoT) and automotive network security, and (4) performing distributed edge computing optimizations that integrate FL with scalable technologies for reduced communication overhead. Through extensive experiments, these methodologies demonstrate that complex anomaly detection and condition monitoring tasks can be achieved while balancing computational efficiency and detection accuracy through fine-grained network information processing. The frameworks developed in this research establish a robust foundation for network anomaly detection, providing scalable, adaptive, and privacy-preserving solutions for safeguarding CPS and IoT networks in an increasingly interconnected digital landscape. The practical implications of these research findings are significant, as they can inform the development of next-generation network security systems and contribute to the protection of critical infrastructure against sophisticated cyber attacks.

Marfo, William↗