Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Optimal 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 775 records · Page 43
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Optimization of the moderators in the STS preliminary design

This report details the results for an optimization of the dimensions of the moderators in the preliminary design of the Spallation Neutron Source Second Target Station (STS). This study uses the optimization algorithms of Dakota and an unstructured mesh model for the moderators in MCNP. More details on the unstructured mesh model and the automated mesh generation can be found in [3]. Parallel to this effort, the same moderator geometries have been optimized using a constructive solid geometry (CSG) MCNP model. More details on this model and its results can be found in [4]. Three optimal designs are selected for each moderator: one that is optimized for maximum peak brightness, one for maximum time-integrated brightness, and one for a combination of peak and time-integrated brightness. The backbone of the optimization work flow is provided by Dakota. For each set of design parameters requested by Dakota, a new solid geometry is automatically built in Creo and SpaceClaim, and subsequently exported to Attila4MC to generate an unstructured mesh geometry for MCNP. After the MCNP calculation is finished, the objective function (e.g., brightness metric) is returned to Dakota. After the new design has been evaluated, a result-file is written, and Dakota proposes the next set of design parameters to be evaluated. The loop continues until a specified convergence criterion has been met. The design parameters of the cylindrical (upper) moderator include the hydrogen radius, the premoderator thickness (top, bottom, radial), the beryllium radius and the horizontal position of the moderator. The crucial design choice is the hydrogen radius. A radius of 62 mm is shown to provide the maximum time-integrated brightness. The maximum peak brightness occurs with a radius of 40 mm. A combined (middle) design, which balances peak and time-integrated brightnesses, is obtained with a hydrogen radius of 50 mm. The premoderator thicknesses and the beryllium radius are slightly larger in the design optimized for time-integrated brightness than in the design optimized for peak brightness. The sensitivity to these two parameters is relatively small close to the optimal configurations. The hydrogen vessel and vacuum vessel wall thicknesses are dependent on the radius of the liquid hydrogen due to structural integrity requirements. The increased wall thicknesses for larger vessels significantly penalize the time-integrated brightness, with the maximum obtainable value reduced by more than 10% relative to earlier studies which used fixed vessel wall thicknesses. The impact of the variable wall thicknesses is much less for the peak brightness and combined brightness designs. The design parameters of the tube (lower) moderator selected for the optimization are the tube length, the annular premoderator thickness, the beryllium radius and the horizontal position of the moderator. The tube length is the crucial parameter and is chosen large (210 mm) and small (125 mm) in the designs optimized for time-integrated and peak brightness respectively. A combined optimal design has a tube length of 170 mm. The premoderator thickness and the beryllium radius are chosen larger in the design optimized for time-integrated brightness.

42 ENGINEERING↗
DOE OSTI2024

Adaptive Online Model Update Algorithm for Predictive Control in Networked Systems

In this article, we introduce an adaptive on-line model update algorithm designed for predictive control applications in networked systems, particularly focusing on power distribution systems. Unlike traditional methods that depend on historical data for offline model identification, our approach utilizes real-time data for continuous model updates. This method integrates seamlessly with existing online control and optimization algorithms and provides timely updates in response to real-time changes. This methodology offers significant advantages, including a reduction in the communication network bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt after disturbances. Furthermore, our algorithm is tailored for non-linear convex models, enhancing its applicability to practical scenarios. The efficacy of the proposed method is validated through a numerical study, demonstrating improved control performance using a synthetic IEEE test case.

data-driven model predictive control↗
DOE OSTI2018

A gradient-based optimization approach for the detection of partially connected surfaces using vibration tests

The integrity of engineering structures is often compromised by embedded surfaces that result from incomplete bonding during the manufacturing process, or initiation of damage from fatigue or impact processes. Examples include delaminations in composite materials, incomplete weld bonds when joining two components, and internal crack planes that may form when a structure is damaged. In many cases the areas of the structure in question may not be easily accessible, thus precluding the direct assessment of structural integrity. In this paper, we present a gradient-based, partial differential equation (PDE)-constrained optimization approach for solving the inverse problem of interface detection in the context of steady-state dynamics. An objective function is defined that represents the difference between the model predictions of structural response at a set of spatial locations, and the experimentally measured responses. One of the contributions of our work is a novel representation of the design variables using a density field that takes values in the range [0, 1] and raised to an integer exponent that promotes solutions to be near the extrema of the range. The density field is combined with the penalty method for enforcing a zero gap condition and realizing partially bonded surfaces. Furthermore the use of the penalty method with a density field representation leads to objective functions that are continuously differentiable with respect to the unknown parameters, enabling the use of efficient gradient-based optimization algorithms. Numerical examples of delaminated plates are presented to demonstrate the feasibility of the approach.

42 ENGINEERING↗
DOE OSTI2020

Constrained Bayesian Optimization of Criticality Experiments [Slides]

The design of criticality experiments is typically an iterative process that employs a Monte Carlo transport code. The goal is to find a design that optimizes some variable, like the sensitivity of a response to a cross section, while simultaneously ensuring criticality. The high fidelity of the Monte Carlo code is a great asset, but it makes exploring the design space computationally expensive. Herein, we present how a constrained Bayesian optimization algorithm can be used to efficiently design a criticality experiment. It uses Gaussian processes as a surrogate model to probe the design space and to reduce the number of code executions that are needed to find the optimum. We demonstrate constrained Bayesian optimization with a Pu-239/polyethylene solution system and a TEX experiment that is designed for criticality safety validation of a nuclear waste model at the Hanford Site. For both systems, a global optimum was found within 75 Monte Carlo simulations.

42 ENGINEERING↗
DOE OSTI2020

Constrained Bayesian Optimization of Criticality Experiments at LLNL [Slides]

The design of criticality experiments is typically an iterative process that employs a Monte Carlo transport code. The goal is to find a design that optimizes some variable, like the sensitivity of a response to a cross section, while simultaneously ensuring criticality. The high fidelity of the Monte Carlo code is a great asset, but it makes exploring the design space computationally expensive. Herein, we present how a constrained Bayesian optimization algorithm can be used to efficiently design a criticality experiment. It uses Gaussian processes as a surrogate model to probe the design space and to reduce the number of code executions that are needed to find the optimum. We demonstrate constrained Bayesian optimization with a Pu-239/polyethylene solution system and a TEX experiment that is designed for critical ity safety validation of a nuclear waste model at the Hanford Site. For both systems, a global optimum was found within 75 Monte Carlo simulations.

42 ENGINEERING↗
DOE OSTI2020

Constrained Bayesian optimization of criticality experiments

The design of criticality experiments is typically an iterative process that employs a Monte Carlo transport code. The goal is to find a design that optimizes some variable, like the sensitivity of a response to a cross section, while simultaneously ensuring criticality. The high fidelity of the Monte Carlo code is a great asset, but it makes exploring the design space computationally expensive. Herein, we present how a constrained Bayesian optimization algorithm can be used to efficiently design a criticality experiment. It uses Gaussian processes as a surrogate model to probe the design space and to reduce the number of code executions that are needed to find the optimum. Furthermore, we demonstrate constrained Bayesian optimization with a Pu-239/polyethylene solution system and a TEX experiment that is designed for criticality safety validation of a nuclear waste model at the Hanford Site. For both systems, a global optimum was found within 75 Monte Carlo simulations.

42 ENGINEERING↗
NASA NTRS1994

Constrained minimization of smooth functions using a genetic algorithm

The use of genetic algorithms for minimization of differentiable functions that are subject to differentiable constraints is considered. A technique is demonstrated for converting the solution of the necessary conditions for a constrained minimum into an unconstrained function minimization. This technique is extended as a global constrained optimization algorithm. The theory is applied to calculating minimum-fuel ascent control settings for an energy state model of an aerospace plane.

Moerder, Daniel D.↗
DOE OSTI2017

Robust online monitoring for calibration assessment of transmitters and instrumentation - 260

Robust online monitoring (OLM) technologies are expected to enable the extension or elimination of periodic sensor calibration intervals in operating and new reactors. Advances in OLM technologies will improve the safety and reliability of current and planned nuclear power systems through improved accuracy and increased reliability of sensors used to monitor key parameters. In this paper, we discuss an overview of research being performed within the Nuclear Energy Enabling Technologies (NEET)/Advanced Sensors and Instrumentation (ASI) program, for the development of OLM algorithms to use sensor outputs and, in combination with other available information, 1) determine whether one or more sensors are out of calibration or failing and 2) replace a failing sensor with reliable, accurate sensor outputs. A Gaussian Process (GP)-based uncertainty quantification (UQ) method previously developed for UQ in OLM, was adapted for this purpose. The resulting models are being evaluated for use in high-confidence signal validation for the purpose of detecting and diagnosing sensor faults, and for computing virtual sensor outputs that may be used as a temporary replacement for failing sensors. In addition to assessing sensor drift, approaches for extracting sensor response time in an automated fashion were developed, for monitoring changes in sensor response time in pressure transmitters. Such changes are also indicative of various fault modes. These algorithms were evaluated with existing measurement data from several laboratory-scale flow loops. Ongoing research in this project is focused on further evaluation of the algorithms, optimization for accuracy and computational efficiency, and integration into a suite of tools for robust OLM that are applicable to monitoring sensor calibration state in nuclear power plants. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Alchemy: A Model-Based Approach for 2D to 3D Autonomous Nuclear System Design

Engineering design of nuclear power plant (NPP) piping and equipment systems frequently bypasses crucial 2D system planning, instead moving straight to 3D modeling. This often leads to designs that exceed building envelope constraints, forcing expensive and time-consuming redesigns. When 2D modeling is employed, it typically involves labor-intensive manual workflows that convert 2D drawings into 3D models, resulting in inefficiencies and errors across design iterations. These workflows further suffer from poor software interoperability and dependence on proprietary software ecosystems, thereby contributing to schedule delays and cost overruns. This paper presents Alchemy, an autonomous framework that transforms 2D system definitions into Industry Foundation Classes (IFC)-compliant 3D building information models (BIMs) for expediting nuclear facility design at the conceptual preliminary phase. Using a model-based approach, the framework treats the 2D system diagram as the central reference model employed to automatically generate all subsequent outputs, ensuring consistency between the system definition and the resulting physical design. A web-based interface enables engineers to define hierarchical system topologies including associated equipment, geometric properties, and connectivity requirements. A two-phase equipment layout optimization algorithm automatically computes collision-free spatial configurations within predefined building envelopes. An artificial intelligence (AI)-assisted pipe routing module then generates orthogonal, collision-free routing paths, allowing the user to select either an A* search-based method or an Ant Colony Optimization (ACO)-based method. All outputs are authored natively in IFC format, relying on open-source technologies and standardized formats in order to ensure extensibility and eliminate proprietary software dependencies. The proposed framework is validated on two representative pressurized-water reactor (PWR)-based case studies, for which it autonomously generates IFC-compliant 3D models in minutes, drastically reducing workflows that typically require hours of manual effort. The generated model demonstrates topologically correct equipment placement, physically plausible spatial relationships, and collision-free pipe routing consistent with known PWR loop configurations. This work represents a foundational step toward digital engineering for nuclear facility preliminary design, with future ongoing development targeting design code compliance and expanded system complexity.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2023

An asynchronous parallel high-throughput model calibration framework for crystal plasticity finite element constitutive models

Crystal plasticity finite element model (CPFEM) is a powerful numerical simulation in the integrated computational materials engineering toolboxes that relates microstructures to homogenized materials properties and establishes the structure–property linkages in computational materials science. However, to establish the predictive capability, one needs to calibrate the underlying constitutive model, verify the solution and validate the model prediction against experimental data. Bayesian optimization (BO) has stood out as a gradient-free efficient global optimization algorithm that is capable of calibrating constitutive models for CPFEM. Here in this paper, we apply a recently developed asynchronous parallel constrained BO algorithm to calibrate phenomenological constitutive models for stainless steel 304 L, Tantalum, and Cantor high-entropy alloy.

304L stainless steel↗
DOE OSTI2021

Sensitivity-based Similarity Metrics for New Experiment Design Optimization

The nuclear data used in advanced reactor simulations requires validation. Data from nuclear criticality experiments can provide this validation. New nuclear criticality experiment design requires extensive knowledge and expert judgement such that the experimental design parameters are selected in such a way to keep the experiment subcritical. To aide in this experimental design process, professionals can utilize sensitivity and uncertainty analysis. Sensitivity and uncertainty analysis relies on matching new application experiments with currently existing benchmark experiments. Currently, there is functionality in the Whisper 1.1 software package to calculate a similarity metric based on neutron multiplication factor sensitivity coefficients between a new application designed by the user and existing International Criticality Safety Benchmark Experiment Project (ICSBEP) benchmarks. The Whisper 1.1 software package is included in Monte Carlo N-Particle ® Code Version 6.21 (MCNP ® 6.2). This work is geared toward expanding this capability to new similarity metrics based on beta-effective sensitivity coefficients and reactivity coefficient sensitivity coefficients. While the investigation of these sensitivity coefficients is presented in detail in separate works at this same conference, this work will be primarily focused on studying the similarity metrics in more detail. These similarity metrics will then be incorporated into the optimization algorithms used for experiment design in EUCLID (Experiments Underpinned by Computational Learning for Improvements in nuclear Data), which is a Los Alamos National Laboratory (LANL) project designed to constrain nuclear data of interest, such that adjustments can be made to possible inaccuracies. A more detailed optimization can be subsequently performed by breaking down these similarity metrics by isotope, reaction, and energy.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Flexible silicon photonic architecture for accelerating distributed deep learning

The increasing size and complexity of deep learning (DL) models have led to the wide adoption of distributed training methods in datacenters (DCs) and high-performance computing (HPC) systems. However, communication among distributed computing units (CUs) has emerged as a major bottleneck in the training process. In this study, we propose Flex-SiPAC, a flexible silicon photonic accelerated compute cluster designed to accelerate multi-tenant distributed DL training workloads. Flex-SiPAC takes a co-design approach that combines a silicon photonic hardware platform with a tailored collective algorithm, optimized to leverage the unique physical properties of the architecture. The hardware platform integrates a novel wavelength-reconfigurable transceiver design and a micro-resonator-based wavelength-reconfigurable switch, enabling the system to achieve flexible bandwidth steering in the wavelength domain. The collective algorithm is designed to support reconfigurable topologies, enabling efficient all-reduce communications that are commonly used in DL training. The feasibility of the Flex-SiPAC architecture is demonstrated through two testbed experiments. First, an optical testbed experiment demonstrates the flexible routing of wavelengths by shuffling an array of input wavelengths using a custom-designed spatial-wavelength selective switch. Second, a four-GPU testbed running two DL workloads shows a 23% improvement in job completion time compared to a similarly sized leaf-spine topology. We further evaluate Flex-SiPAC using large-scale simulations, which show that Flex-SiPAC is able to reduce the communication time by 26% to 29% compared to state-of-the-art compute clusters under representative collective operations.

Wu, Zhenguo (ORCID:0000000322847985)↗
DOE OSTI2019

mystic - a brief introduction

The mystic framework enables the solving of difficult optimization problems through three major innovations: (1) plug-and-play component-based optimization algorithms, (2) the ability to dynamically construct and apply generalzed trnasforms, K , where x' = K(x) , and (3) workflows providing asynchronous execution and statefulness. These features, in conjunction with supporting packages pathos , pyina , and klepto , can provide massively-parallel scalable workflows for quickly solving optimization problems in complex nonlinear spaces. mystic can be used to simplify non-convex optimization problems by transforming away nonlinearities through user-built kernel transforms. This tutorial demonstrates using mystic for machine learning with automated dimensional-reduction, using embarrasingly parallel solver ensembles to find an accurate interpolated surrogate for a nonlinear surface, and the determination of worst-case bounds on expectation value of an objective function under uncertainty.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Computational mechanics analysis tools for parallel-vector supercomputers

Computational algorithms for structural analysis on parallel-vector supercomputers are reviewed. These parallel algorithms, developed by the authors, are for the assembly of structural equations, 'out-of-core' strategies for linear equation solution, massively distributed-memory equation solution, unsymmetric equation solution, general eigen-solution, geometrically nonlinear finite element analysis, design sensitivity analysis for structural dynamics, optimization algorithm and domain decomposition. The source code for many of these algorithms is available from NASA Langley.

Storaasli, O. O.↗
NASA NTRS2011

Combined Retrievals of Boreal Forest Fire Aerosol Properties with a Polarimeter and Lidar

Absorbing aerosols play an important, but uncertain, role in the global climate. Much of this uncertainty is due to a lack of adequate aerosol measurements. While great strides have been made in observational capability in the previous years and decades, it has become increasingly apparent that this development must continue. Scanning polarimeters have been designed to help resolve this issue by making accurate, multi-spectral, multi-angle polarized observations. This work involves the use of the Research Scanning Polarimeter (RSP). The RSP was designed as the airborne prototype for the Aerosol Polarimetery Sensor (APS), which was due to be launched as part of the (ultimately failed) NASA Glory mission. Field observations with the RSP, however, have established that simultaneous retrievals of aerosol absorption and vertical distribution over bright land surfaces are quite uncertain. We test a merger of RSP and High Spectral Resolution Lidar (HSRL) data with observations of boreal forest fire smoke, collected during the Arctic Research of the Composition of the Troposphere from Aircraft and Satellites (ARCTAS). During ARCTAS, the RSP and HSRL instruments were mounted on the same aircraft, and validation data were provided by instruments on an aircraft flying a coordinated flight pattern. We found that the lidar data did indeed improve aerosol retrievals using an optimal estimation method, although not primarily because of the constraints imposed on the aerosol vertical distribution. The more useful piece of information from the HSRL was the total column aerosol optical depth, which was used to select the initial value (optimization starting point) of the aerosol number concentration. When ground based sun photometer network climatologies of number concentration were used as an initial value, we found that roughly half of the retrievals had unrealistic sizes and imaginary indices, even though the retrieved spectral optical depths agreed within uncertainties to independent observations. The convergence to an unrealistic local minimum by the optimal estimator is related to the relatively low sensitivity to particles smaller than 0.1 ( m) at large optical thicknesses. Thus, optimization algorithms used for operational aerosol retrievals of the fine mode size distribution, when the total optical depth is large, will require initial values generated from table look-ups that exclude unrealistic size/complex index mixtures. External constraints from lidar on initial values used in the optimal estimation methods will also be valuable in reducing the likelihood of obtaining spurious retrievals.

Knobelspiesse, K.↗
NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗