Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization algorithm”

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 631 records · Page 35

A simple model based magnet sorting algorithm for planar hybrid undulators

Various magnet sorting strategies have been used to optimize undulator performance, ranging from intuitive pairing of high- and low-strength magnets, to full 3D FEM simulation with 3-axis Helmholtz coil magnet data. In the extreme, swapping magnets in a full field model to minimize trajectory wander and rms phase error can be time consuming. This paper presents a simpler approach, extending the field error signature concept to obtain trajectory displacement, kick angle and phase error signatures for each component of magnetization error from a Radia model of a short hybrid-PM undulator. We demonstrate that steering errors and phase errors are essentially decoupled and scalable from measured X, Y and Z components of magnetization. Then, for any given sequence of magnets, rms trajectory and phase errors are obtained from simple cumulative sums of the scaled displacements and phase errors. The cost function (a weighted sum of these errors) is then minimized by swapping magnets, using one's favorite optimization algorithm. This approach was applied recently at NSLS to a short in-vacuum undulator, which required no subsequent trajectory or phase shimming. Trajectory and phase signatures are also obtained for some mechanical errors, to guide 'virtual shimming' and specifying mechanical tolerances. Some simple inhomogeneities are modeled to assess their error contributions.

43 PARTICLE ACCELERATORS↗

Approaching hydro-equivalent ignition in laser direct-drive via target design optimization using novel statistical modeling

Laser direct-drive offers significant advantages in terms of target simplicity, improved energy coupling, and large fuel masses over indirect drive. However, performance degradations from hydrodynamic and laser-plasma instabilities seeded and driven by the direct illumination pose limitations on the parameter space available for achieving ignition. In this paper, new design improvements are identified to forge a path forward for a hydro-equivalent ignition demonstration. The first is related to a new formulation of the statistical model (SM) used to accurately predict target performance directly from input parameters such as laser pulse shape and target specifications. This new SM formulation provides direct guidance on target dimensions and laser beam-to-target radius to achieve the highest fusion yield on the OMEGA laser. The second improvement comes from cooling the deuterium–tritium (DT) ice layer below the triple point right before shot time leading to lower DT vapor densities and higher convergence. Guided by these design improvements, a Bayesian optimization algorithm was used to design an implosion that is predicted to closely approach a Lawson triple product that hydrodynamically scales to ignition if equivalent laser–target coupling is achieved at laser energies typical of the National Ignition Facility.

Deuterium↗

Hybrid quantum-classical algorithms for approximate graph coloring

We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An algorithm for control system design via parameter optimization

An algorithm for design via parameter optimization has been developed for linear-time-invariant control systems based on the model reference adaptive control concept. A cost functional is defined to evaluate the system response relative to nominal, which involves in general the error between the system and nominal response, its derivatives and the control signals. A program for the practical implementation of this algorithm has been developed, with the computational scheme for the evaluation of the performance index based on Lyapunov's theorem for stability of linear invariant systems.

Sinha, P. K.↗

Multi-scale and multi-physics analysis, design optimization, and experimental validation of heat exchangers utilizing high performance, non-round tubes

Air-to-refrigerant heat exchangers (HXs) are fundamental components in HVAC&R systems, and considerable research has been dedicated designing continually smaller, lighter, and more efficient HX designs. In recent years, researchers have leveraged advancements in Computational Fluid Dynamics (CFD), Finite Element Analysis (FEA), and optimization algorithms to consider primary tube shape and topology optimization to design highly compact, high performance HXs for a multitude of applications. In this research, we present a computationally efficient, comprehensive, multi-scale, and multi-physics analysis and optimization method for air-to-refrigerant HXs featuring automated CFD and FEA simulations and approximation-assisted optimization. This methodology was utilized to design HXs with shape-optimized, non-round tubes which outperform current state-of-the-art tube-fin HXs without compromising structural integrity. The optimal HXs were shown to deliver similar thermal performance to the baseline HXs while also achieving more than 20% reductions in airside pressure drop and core envelope volume and more than 30% reduction in internal volume. Comprehensive experimental validation of the optimization methodology was conducted through the testing of two prototypes in a standardized wind tunnel facility under multiple operating conditions. For prototype #1 under dry evaporator conditions, the predicted heat load agreed within ± 10% of measured values and the predicted airside pressure drop agreed within ± 30%, while for dehumidifying conditions, the predicted sensible and latent heat loads agreed within ± 10% and ± 20% of the measured values, respectively. For prototype #2, the predicted condenser heat load agreed within ± 3.0% of measured values, and the predicted airside pressure drop agreed within ± 27%. The acceptable agreement between simulation and experimental results for the present application highlights the flexibility of the novel optimization methodology to design next generation HXs with improved performance and reduced volume, weight, and environmental impact.

42 ENGINEERING↗

Bayesian Optimized Deep Ensemble for Uncertainty Quantification of Deep Neural Networks: a System Safety Case Study on Sodium Fast Reactor Thermal Stratification Modeling

Deep neural networks (DNNs) are increasingly important to scientific computing and engineering system simulations. Accurate uncertainty quantification (UQ) for DNNs is critical in safety-sensitive engineering domains. Traditional Deep Ensemble (DE) methods, while easy to implement, frequently suffer from poorly calibrated uncertainty estimates and limited predictive accuracy due to reliance on fixed architectures with varied weight initializations. To address these issues, we introduce a workflow that combines Bayesian Optimization (BO) and DE. The workflow is modular, scalable, and integrates parallel BO initialized with Sobol sequences to individually optimize the hyperparameters of each ensemble member. This method enhances ensemble diversity, improves predictive accuracy, and provides reliable uncertainty estimates. We evaluate the proposed BODE approach in a sodium fast reactor thermal stratification modeling case study, where we used a densely connected convolutional neural network to predict turbulent viscosity during the reactor transient with consideration of data noise. We benchmark its performance against several optimization approaches, including baseline deep ensemble, evolutionary algorithm-optimized ensemble, ensemble formed via random search combined with greedy selection, and a BO ensemble using random initialization. Here, our results demonstrate superior performance of the developed BODE approach. In noise-free scenarios, BODE notably reduces incorrect aleatoric uncertainty and significantly enhances predictive accuracy. Under conditions of 5% and 10% Gaussian noise, BODE adaptively quantifies uncertainty proportional to data noise, achieving up to an 80% reduction in root mean square error compared to baseline methods and producing well-calibrated prediction intervals.

Bayesian optimization↗

Generation of thermofield double states and critical ground states with a quantum computer

Significance Our experiment prepares two types of nontrivial quantum states on a trapped ion quantum computer: the thermofield double state of the transverse-field Ising model at arbitrary temperature and the quantum critical state of the zero-temperature model. We use techniques motivated by the quantum approximate optimization algorithm, and we implement a hybrid quantum–classical optimization loop to prepare the quantum critical state. Our results pave the way for exploring strongly correlated models at finite temperature and teleportation protocols inspired by black hole physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Natural evolutionary strategies for variational quantum computation

Abstract Natural evolutionary strategies (NES) are a family of gradient-free black-box optimization algorithms. This study illustrates their use for the optimization of randomly initialized parameterized quantum circuits (PQCs) in the region of vanishing gradients. We show that using the NES gradient estimator the exponential decrease in variance can be alleviated. We implement two specific approaches, the exponential and separable NES, for parameter optimization of PQCs and compare them against standard gradient descent. We apply them to two different problems of ground state energy estimation using variational quantum eigensolver and state preparation with circuits of varying depth and length. We also introduce batch optimization for circuits with larger depth to extend the use of ES to a larger number of parameters. We achieve accuracy comparable to state-of-the-art optimization techniques in all the above cases with a lower number of circuit evaluations. Our empirical results indicate that one can use NES as a hybrid tool in tandem with other gradient-based methods for optimization of deep quantum circuits in regions with vanishing gradients.

Anand, Abhinav (ORCID:0000000280812310)↗

SU-E-T-42: A Method to Determine the Optimal Proton Scanned Beam Angle to Ensure Robust Treatment Planning

Purpose: The ability of pencil beam scanning (PBS) to deliver highly conformal dose distributions may be affected by patient- and physics-related uncertainties. In clinical practice, selection of proton beam angles is determined qualitatively. This study investigates whether an optimal proton PBS beam angle could be quantitatively determined to ensure robust planning for pelvic targets. Methods: PBS beam angles were optimized based on two independent criteria; shortest and most homogeneous path from the patient surface to the distal edge of the target. The beam angle optimization criteria for gantry angles between 90°-270° were quantified in 10° increments for each ray, calculated as the straight line distance from the surface of the skin to the CTV’s distal edge. The goal was to minimize the path length of a proton PBS beam from the patient surface to the distal edge of the CTV, relative to the entry point, while minimizing HU inhomogeneity along the ray. HU homogeneity (i.e. HU variation) was quantitatively defined as the standard deviation of the average intra-ray HU intensity distribution of the rays comprising a single beam. This method was validated relative to inter-fraction changes on ten consecutive, locally advanced, rectal cancer patients, who underwent an average 4 verification CTs. The displacement of the 95–98% isodose lines was determined from forward calculated dose distributions on verification CTs. Results: The posterior beam (180°) had the average shortest path length, 132.7±17.2mm, and the most homogenous path, 31.9±4.3HU. The 95–98% isodose lines from all plans verified our path length to within 2.3±1.2% and HU homogeneity to within 1.2±0.5%. Conclusion: The proposed optimization algorithm determined the posterior beam dose distribution as the most robust relative to inter-fraction variation for large pelvic targets treated with PBS and was validated via verification CT for our patient cohort. Future work will focus on further algorithm development.

60 APPLIED LIFE SCIENCES↗

Adjoint-based optimization of mechanical performance in polycrystalline materials and structures through texture control

The texture of a polycrystalline material refers to the preferred orientation of the grains within the material. In metallic materials, texture can significantly affect the mechanical properties such as elastic moduli, yield stress, strain hardening, and fracture toughness. Recent advances in additive manufacturing of metallic materials offer the possibility in the not too distant future of controlling the spatial variation of texture. In this work, we investigate the advantages, in terms of mechanical performance, of allowing the texture to vary spatially. We use an adjoint-based gradient optimization algorithm within a finite element solver (COMSOL) to optimize several engineering quantities of interest in a simple structure (hole in a plate) and loading (uniaxial tension) condition. As a first step to general texture optimization, we consider the idealized case of a pure fiber texture in which the homogenized properties are transversely isotropic. In this special case, the only spatially varying design variables are the three Euler angles that prescribe the orientation of the homogenized material at each point within the structure. This work paves a new way to design metallic materials for tunable mechanical properties at the microstructure level.

36 MATERIALS SCIENCE↗

On Benchmarking Quantum Heuristics

Present an outline of important aspects for benchmarking quantum algorithms, in particular quantum heuristics. Using quantum approximate optimization algorithm as an example, we demonstrate how the choice of cost Hamiltonian, of mixer, and of initial states can affect the performance. We also discuss how realistic aspects of near-term quantum hardware will influence the algorithm performance.

Wang, Zhihui↗

A Bayesian experimental design approach to structural health monitoring

Optimal system design for SHM involves two primarily challenges. The first is the derivation of a proper performance function for a given system design. The second is the development of an efficient optimization algorithm for choosing a design that maximizes, or nearly maximizes the performance function. In this paper we will outline how an SHM practitioner can construct the proper performance function by casting the entire design problem into a framework of Bayesian experimental design. The approach demonstrates how the design problem necessarily ties together all steps of the SHM process.

42 ENGINEERING↗

Distributed-Memory Breadth-First Search on Massive Graphs. IN: Parallel Graph Algorithms

This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchronous top-down algorithm as well as the recently discovered direction optimizing algorithm. We analyze the performance and scalability trade-offs in using different local data structures such as CSR and DCSC, enabling in-node multithreading, and graph decompositions such as 1D and 2D decomposition.

97 MATHEMATICS AND COMPUTING↗

Optimization of a dry, mixed nuclear fuel storage array for nuclear criticality safety - 14339

A dry storage array of used nuclear fuel at the Idaho National Laboratory contains a mixture of more than twenty different types of research and test reactor fuels. Significant neutronic interaction occurs between fuel canisters within this large storage arrangement of 636 fuel storage canisters. Nuclear criticality safety is maintained primarily by moderation control and through control of neutron interaction and leakage provided by the credited geometry. Over the nearly forty years of operation the collected fuels are now arranged in a configuration that does not minimize the system neutron multiplication factor (k{sub eff}). This creates a concern since the entire remaining facility storage capacity cannot be utilized without exceeding the system minimum subcritical state (k{sub safe}) for ensuring nuclear criticality safety. This work determines a more optimal arrangement for the stored fuels with a goal to minimize the system k{sub eff}, but also with a minimum of potential fuel canister relocation movements. The ultimate goal is to establish a solution for this multiple-objective optimization problem by finding the Pareto Front for maximum k{sub eff} reduction versus the number of canister relocations. The process first required additional analysis of the array by Monte-Carlo neutron transport codes (specifically, MCNP) to gain a greater understanding of the interaction characteristics of the disparate fuel types. Some stored fuels are composed of primarily metallic and oxide components that provide very little inherent moderation, while other fuel types contain graphite or zirconium-hydride which can contribute a significant amount of moderation. These factors cause a complex relationship within a fuel arrangement with respect to thermal utilization and axial leakage probability. The new MCNP analysis was utilized to develop a simplified spreadsheet-based empirical model which simulates the array k{sub eff} result. This empirical model was benchmarked against additional MCNP calculations for various arrangements and then employed in the optimization analysis. A Tabu metaheuristic and stochastic approximation optimization was applied to the empirical model with the optimization function to minimize the array k{sub eff}. The optimization algorithm interrogated the empirical model to determine the optimal rearrangement for up to sixty canister movements. The Pareto Front was found, which shows that a limited number of canister relocation movements could allow the existing thirty-one empty array positions to be filled with common research reactor fuels while also yielding a reduction in the overall array k{sub eff} relative to the current arrangement. This will impart an improvement in the facility utilization while also offering an enhancement in the safety margin. The reduction in array reactivity has been confirmed by a final set of MCNP calculations with the proposed new arrangements. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Strategic planning for disaster recovery with stochastic last mile distribution

This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and parallel fleet routing. Moreover, these problems must be solved under tight runtime constraints to be practical in real-world disaster situations. This paper formalizes the specification of SCAPs and introduces a novel multi-stage hybrid-optimization algorithm that utilizes the strengths of mixed integer programming, constraint programming, and large neighborhood search. The algorithm was validated on hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation tools and is deployed to aid federal organizations in the US.

97 MATHEMATICS AND COMPUTING↗

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗

Using Graph Coloring to Compute Total Derivatives More Efficiently in OpenMDAO

When they are applicable, gradient based optimization algorithms are the most efficient way to solve design optimization problems. Although gradient based methods are generally efficient, they can be made significantly more so through the usage of analytic techniques to compute the necessary total derivatives. The traditional forward (direct) and reverse (adjoint) analytic techniques have computational costs that scale linearly with the number of design variables and the number of constraints, respectively. In this work, we present an application of a graph coloring algorithm to the analytic techniques for computing total derivative Jacobians in order to achieve much better computational scaling than the pure analytic methods can provide alone. A detailed theoretical explanation of how coloring algorithms interact with analytic derivative methods is presented that illustrates specific types of sparsity patterns that must be present in total derivative Jacobians in order for this coloring technique to be effective. The new technique has been implemented as a feature in the OpenMDAO framework and the implementation is demonstrated on two example problems. The performance on the example problems up to 50% reduction in compute cost for optimizations with bi-directional coloring compared to traditional constraint aggregation. Additionally, the results show how coloring technique alleviates some of the numerical difficulties that constraint aggregation can cause, leading to the ability to solve larger problems. It is expected that the new method will have wide applicability to multidisciplinary optimization problems, and that its availability in OpenMDAO will offer significant computational savings for users without the need for them to implement the coloring algorithm themselves.

Trajectory↗

Thrust stand evaluation of engine performance improvement algorithms in an F-15 airplane

Results are presented from the evaluation of the performance seeking control (PSC) optimization algorithm developed by Smith et al. (1990) for F-15 aircraft, which optimizes the quasi-steady-state performance of an F100 derivative turbofan engine for several modes of operation. The PSC algorithm uses onboard software engine model that calculates thrust, stall margin, and other unmeasured variables for use in the optimization. Comparisons are presented between the load cell measurements, PSC onboard model thrust calculations, and posttest state variable model computations. Actual performance improvements using the PSC algorithm are presented for its various modes. The results of using PSC algorithm are compared with similar test case results using the HIDEC algorithm.

Conners, Timothy R.↗