Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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 109 records · Page 6

WE-AB-BRB-01: Development of a Probe-Format Graphite Calorimeter for Practical Clinical Dosimetry: Numerical Design Optimization, Prototyping, and Experimental Proof-Of-Concept

Purpose: In this work, the feasibility of performing absolute dose to water measurements using a constant temperature graphite probe calorimeter (GPC) in a clinical environment is established. Methods: A numerical design optimization study was conducted by simulating the heat transfer in the GPC resulting from irradiation using a finite element method software package. The choice of device shape, dimensions, and materials was made to minimize the heat loss in the sensitive volume of the GPC. The resulting design, which incorporates a novel aerogel-based thermal insulator, and 15 temperature sensitive resistors capable of both Joule heating and measuring temperature, was constructed in house. A software based process controller was developed to stabilize the temperatures of the GPC’s constituent graphite components to within a few 10’s of µK. This control system enables the GPC to operate in either the quasi-adiabatic or isothermal mode, two well-known, and independent calorimetry techniques. Absorbed dose to water measurements were made using these two methods under standard conditions in a 6 MV 1000 MU/min photon beam and subsequently compared against TG-51 derived values. Results: Compared to an expected dose to water of 76.9 cGy/100 MU, the average GPC-measured doses were 76.5 ± 0.5 and 76.9 ± 0.5 cGy/100 MU for the adiabatic and isothermal modes, respectively. The Monte Carlo calculated graphite to water dose conversion was 1.013, and the adiabatic heat loss correction was 1.003. With an overall uncertainty of about 1%, the most significant contributions were the specific heat capacity (type B, 0.8%) and the repeatability (type A, 0.6%). Conclusion: While the quasi-adiabatic mode of operation had been validated in previous work, this is the first time that the GPC has been successfully used isothermally. This proof-of-concept will serve as the basis for further study into the GPC’s application to small fields and MRI-linac dosimetry. This work has been supported in part by the CREATE Medical Physics Research Training Network of the Natural Sciences and Engineering Research Council (NSERC) grant 432290, NSERC grants RGPIN 298191 & 435608-13, Canadian Institutes of Health Research doctoral scholarship GSD-121793. This work has also been supported by Sun Nuclear Corporation.

60 APPLIED LIFE SCIENCES↗

Adaptive Aft Signature Shaping of a Low-Boom Supersonic Aircraft Using Off-Body Pressures

The design and optimization of a low-boom supersonic aircraft using the state-of-the- art o -body aerodynamics and sonic boom analysis has long been a challenging problem. The focus of this paper is to demonstrate an e ective geometry parameterization scheme and a numerical optimization approach for the aft shaping of a low-boom supersonic aircraft using o -body pressure calculations. A gradient-based numerical optimization algorithm that models the objective and constraints as response surface equations is used to drive the aft ground signature toward a ramp shape. The design objective is the minimization of the variation between the ground signature and the target signature subject to several geometric and signature constraints. The target signature is computed by using a least-squares regression of the aft portion of the ground signature. The parameterization and the deformation of the geometry is performed with a NASA in- house shaping tool. The optimization algorithm uses the shaping tool to drive the geometric deformation of a horizontal tail with a parameterization scheme that consists of seven camber design variables and an additional design variable that describes the spanwise location of the midspan section. The demonstration cases show that numerical optimization using the state-of-the-art o -body aerodynamic calculations is not only feasible and repeatable but also allows the exploration of complex design spaces for which a knowledge-based design method becomes less effective.

Ordaz, Irian↗

Clifford Circuit-Based Heuristic Optimization of Fermion-To-Qubit Mappings

Simulation of interacting Fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analyzing Fermionic systems with a quantum computer hinges on the efficiency of Fermion-to-qubit mappings that encode nonlocal Fermionic degrees of freedom in local qubit degrees of freedom. While recent studies have highlighted the importance of designing Fermion-to-qubit mappings that are tailored to specific problem Hamiltonians, the methods proposed so far either are restricted to a narrow class of mappings or they use computationally expensive and unscalable brute-force search algorithms. Here, in this work, we address this challenge by designing a heuristic numerical optimization framework for Fermion-to-qubit mappings. To this end, we first translate the Fermion-to-qubit mapping problem to a Clifford circuit optimization problem and then use simulated annealing to optimize the average Pauli weight of the problem Hamiltonian. For all Fermionic Hamiltonians we have considered, the numerically optimized mappings outperform their conventional counterparts, including ternary-tree-based mappings that are known to be optimal for single creation and annihilation operators. We find that our optimized mappings yield between 15% and 40% improvements on the average Pauli weight when the simulation Hamiltonian has an intermediate level of complexity. Most remarkably, the optimized mappings improve the average Pauli weight for 6 × 6 nearest-neighbor hopping and Hubbard models by more than 40% and 20%, respectively. Surprisingly, we also find specific interaction Hamiltonians for which the optimized mapping outperforms any ternary-tree-based mapping. Our results establish heuristic numerical optimization as an effective method for obtaining mappings tailored for specific Fermionic Hamiltonian.

Hamiltonians↗

Machine learning-enhanced model-based scenario optimization for DIII-D

Abstract Scenario development in tokamaks is an open area of investigation that can be approached in a variety of different ways. Experimental trial and error has been the traditional method, but this required a massive amount of experimental time and resources. As high fidelity predictive models have become available, offline development and testing of proposed scenarios has become an option to reduce the required experimental resources. The use of predictive models also offers the possibility of using a numerical optimization process to find the controllable inputs that most closely achieve the desired plasma state. However, this type of optimization can require as many as hundreds or thousands of predictive simulation cases to converge to a solution; many of the commonly used high fidelity models have high computational burdens, so it is only reasonable to run a handful of predictive simulations. In order to make use of numerical optimization approaches, a compromise needs to be found between model fidelity and computational burden. This compromise can be achieved using neural networks surrogates of high fidelity models that retain nearly the same level of accuracy as the models they are trained to replicate while reducing the computation time by orders of magnitude. In this work, a model-based numerical optimization tool for scenario development is described. The predictive model used by the optimizer includes neural network surrogate models integrated into the fast Control-Oriented Transport simulation framework. This optimization scheme is able to converge to the optimal values of the controllable inputs that produce the target plasma scenario by running thousands of predictive simulations in under an hour without sacrificing too much prediction accuracy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Trust-region based return mapping algorithm for implicit integration of elastic-plastic constitutive models

A new method for the solution of the non-linear equations forming the core of constitutive model integration is proposed. Specifically, the trust-region method that has been developed in the numerical optimization community is successfully modified for use in implicit integration of elastic-plastic models. Although attention here is restricted to these rate-independent formulations, the proposed approach holds substantial promise for adoption with models incorporating complex physics, multiple inelastic mechanisms, and/or multiphysics. As a first step, the non-quadratic Hosford yield surface is used as a representative case to investigate computationally challenging constitutive models. The theory and implementation are presented, discussed, and compared to other common integration schemes. Multiple boundary value problems are studied and used to verify the proposed algorithm and demonstrate the capabilities of this approach over more common methodologies. Robustness and speed are then investigated and compared to existing algorithms. As a result through these efforts, it is shown that the utilization of a trust-region approach leads to superior performance versus a traditional closest-point projection Newton-Raphson method and comparable speed and robustness to a line search augmented scheme.

97 MATHEMATICS AND COMPUTING↗

Design optimization of transonic airfoils

Numerical optimization procedures were considered for the design of airfoils in transonic flow based on the transonic small disturbance (TSD) and Euler equations. A sequential approximation optimization technique was implemented with an accurate approximation of the wave drag based on the Nixon's coordinate straining approach. A modification of the Euler surface boundary conditions was implemented in order to efficiently compute design sensitivities without remeshing the grid. Two effective design procedures producing converged designs in approximately 10 global iterations were developed: interchanging the role of the objective function and constraint and the direct lift maximization with move limits which were fixed absolute values of the design variables.

Joh, C.-Y.↗

Jig-Shape Optimization of a Low-Boom Supersonic Aircraft

A simple approach for optimizing the jig-shape is proposed in this study. This simple approach is based on an unconstrained optimization problem and applied to a low-boom supersonic aircraft. In this study, the jig-shape optimization is performed using the two-step approach. First, starting design variables are computed using the least-squares surface fitting technique. Next, the jig-shape is further tuned using a numerical optimization procedure based on an in-house object-oriented optimization tool. During the numerical optimization procedure, a design jig-shape is determined by the baseline jig-shape and basis functions. A total of 12 symmetric mode shapes of the cruise-weight configuration, rigid pitch shape, rigid left and right stabilator rotation shapes, and a residual shape are selected as sixteen basis functions. After three optimization runs, the trim shape error distribution is improved, and the maximum trim shape error of 0.9844 inches of the starting configuration becomes 0.00367 inch by the end of the third optimization run.

numerical analysi↗

Surrogates for numerical simulations; optimization of eddy-promoter heat exchangers

Although the advent of fast and inexpensive parallel computers has rendered numerous previously intractable calculations feasible, many numerical simulations remain too resource-intensive to be directly inserted in engineering optimization efforts. An attractive alternative to direct insertion considers models for computational systems: the expensive simulation is evoked only to construct and validate a simplified, input-output model; this simplified input-output model then serves as a simulation surrogate in subsequent engineering optimization studies. A simple 'Bayesian-validated' statistical framework for the construction, validation, and purposive application of static computer simulation surrogates is presented. As an example, dissipation-transport optimization of laminar-flow eddy-promoter heat exchangers are considered: parallel spectral element Navier-Stokes calculations serve to construct and validate surrogates for the flowrate and Nusselt number; these surrogates then represent the originating Navier-Stokes equations in the ensuing design process.

Patera, Anthony T.↗

Machine Learning Techniques in Optimal Design

Many important applications can be formalized as constrained optimization tasks. For example, we are studying the engineering domain of two-dimensional (2-D) structural design. In this task, the goal is to design a structure of minimum weight that bears a set of loads. A solution to a design problem in which there is a single load (L) and two stationary support points (S1 and S2) consists of four members, E1, E2, E3, and E4 that connect the load to the support points is discussed. In principle, optimal solutions to problems of this kind can be found by numerical optimization techniques. However, in practice [Vanderplaats, 1984] these methods are slow and they can produce different local solutions whose quality (ratio to the global optimum) varies with the choice of starting points. Hence, their applicability to real-world problems is severely restricted. To overcome these limitations, we propose to augment numerical optimization by first performing a symbolic compilation stage to produce: (a) objective functions that are faster to evaluate and that depend less on the choice of the starting point and (b) selection rules that associate problem instances to a set of recommended solutions. These goals are accomplished by successive specializations of the problem class and of the associated objective functions. In the end, this process reduces the problem to a collection of independent functions that are fast to evaluate, that can be differentiated symbolically, and that represent smaller regions of the overall search space. However, the specialization process can produce a large number of sub-problems. This is overcome by deriving inductively selection rules which associate problems to small sets of specialized independent sub-problems. Each set of candidate solutions is chosen to minimize a cost function which expresses the tradeoff between the quality of the solution that can be obtained from the sub-problem and the time it takes to produce it. The overall solution to the problem, is then obtained by solving in parallel each of the sub-problems in the set and computing the one with the minimum cost. In addition to speeding up the optimization process, our use of learning methods also relieves the expert from the burden of identifying rules that exactly pinpoint optimal candidate sub-problems. In real engineering tasks it is usually too costly to the engineers to derive such rules. Therefore, this paper also contributes to a further step towards the solution of the knowledge acquisition bottleneck [Feigenbaum, 1977] which has somewhat impaired the construction of rulebased expert systems.

Cerbone, Giuseppe↗

Energy-Centric Cooperative Onramp Merging Strategy: An Analytical Solution

Cooperative highway onramp merging plays an important role in mitigating highway traffic congestion. A crucial component of a cooperative merging system is the merging sequence strategy, which determines each merging participant's order to reach the merging point. Existing merging sequence strategies can be classified into rule-based and optimization-based approaches. The rule-based strategies can be effortlessly implemented with a light online computational burden. However, they may not achieve the optimal energy efficiency. In contrast, the optimization-based strategies can yield the optimal merging sequence to minimize fuel consumption, but typically involve computationally expensive numerical optimization. To leverage the advantages from both sides, we propose a novel merging sequence strategy that can minimize fuel consumption while avoiding online numerical optimization. The key idea is to analytically formulate the expected fuel consumption of each merging participant. Using a realistic highway onramp scenario based on the NGSIM dataset, we validate the performance and the computational efficiency of the proposed merging sequence strategy via SUMO/SIMULINK joint simulation.

Wang, Zejiang↗

Finite element engine blade structural optimization

The Structural Tailoring of Engine Blades (STAEBL) computer program was developed to perform engine fan blade numerical optimizations. These blade optimizations seek a minimum weight or cost design that satisfies realistic blade design constraints, by tuning one to twenty design variables. The STAEBL system has been generalized to include both fan and compressor blade numerical optimizations. The system analyses have been significantly improved through the inclusion of an efficient plate finite element analysis for blade stress and frequency determinations. Additionally, a finite element based approximate severe foreign object damage (FOD) analysis has been included. The new FOD analysis gives very accurate estimates of the full nonlinear bird ingestion solution. Optimizations of fan and compressor blades have been performed using the system, showing significant cost and weight reductions, while comparing very favorably with refined design validation procedures.

Brown, K. W.↗

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.]↗

Optimal design of composite hip implants using NASA technology

Using an adaptation of NASA software, we have investigated the use of numerical optimization techniques for the shape and material optimization of fiber composite hip implants. The original NASA inhouse codes, were originally developed for the optimization of aerospace structures. The adapted code, which was called OPORIM, couples numerical optimization algorithms with finite element analysis and composite laminate theory to perform design optimization using both shape and material design variables. The external and internal geometry of the implant and the surrounding bone is described with quintic spline curves. This geometric representation is then used to create an equivalent 2-D finite element model of the structure. Using laminate theory and the 3-D geometric information, equivalent stiffnesses are generated for each element of the 2-D finite element model, so that the 3-D stiffness of the structure can be approximated. The geometric information to construct the model of the femur was obtained from a CT scan. A variety of test cases were examined, incorporating several implant constructions and design variable sets. Typically the code was able to produce optimized shape and/or material parameters which substantially reduced stress concentrations in the bone adjacent of the implant. The results indicate that this technology can provide meaningful insight into the design of fiber composite hip implants.

Blake, T. A.↗

Expert systems and their use in augmenting design optimization

The challenging requirements that are evolving for future aircraft demand that each design be optimally integrated, for the penalties imposed by nonoptimal performance are significant. Classic numerical optimization algorithms have been and will continue to be important tools for aircraft designers. These methods are, however, limited to certain categories of aircraft design variables, leaving the remainder to be determined by the user. A method that makes use of knowledge-based expert systems offers the potential for aiding the conceptual design process in a way that is similar to that of numerical optimization, except that it would address discrete, discontinuous, abstract, or any other unoptimized aspect of vehicle design and integration. Other unique capabilities such as automatic discovery and learning in design may also be achievable in the near term. This paper discusses current practice in conceptual aircraft design and knowledge-based systems, and how knowledge-based systems can be used in conceptual design.

Kidwell, G. H.↗

Resource-efficient generation of linear cluster states by linear optics with postselection

Here we report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon-photon entangling operations are currently limited to measurement-assisted stochastic transformations. A critical parameter for assessing the efficiency of such transformations is the success probability of a desired measurement outcome. At present there are several experimental groups that are capable of generating multi-photon cluster states carrying more than eight qubits. Separate photonic qubits or small clusters can be fused into a single cluster state by a probabilistic optical CZ gate conditioned on simultaneous detection of all photons with 1/9 success probability for each gate. This design mechanically follows the original theoretical scheme of cluster state generation proposed more than a decade ago by Raussendorf, Browne, and Briegel. The optimality of the destructive CZ gate in application to linear optical cluster state generation has not been analyzed previously. Our results reveal that this method is far from the optimal one. Employing numerical optimization we have identified that the maximal success probability of fusing n unentangled dual-rail optical qubits into a linear cluster state is equal to 1/2 n-1 ; an m-tuple of photonic Bell pair states, commonly generated via spontaneous parametric down-conversion, can be fused into a single cluster with the maximal success probability of 1/4 m-1 .

97 MATHEMATICS AND COMPUTING↗

An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics

This report is a repository of the results obtained from a large scale empirical comparison of seven iterative and evolution-based optimization heuristics. Twenty-seven static optimization problems, spanning six sets of problem classes which are commonly explored in genetic algorithm literature, are examined. The problem sets include job-shop scheduling, traveling salesman, knapsack, binpacking, neural network weight optimization, and standard numerical optimization. The search spaces in these problems range from 2368 to 22040. The results indicate that using genetic algorithms for the optimization of static functions does not yield a benefit, in terms of the final answer obtained, over simpler optimization heuristics. Descriptions of the algorithms tested and the encodings of the problems are described in detail for reproducibility.

Baluja, Shumeet↗

Calibration of CDM-Based Creep Constitutive Model Using Accelerated Creep Test (ACT) Data

In conventional creep testing (CCT) a specimen is subject to constant load and temperature for a long-duration until creep rupture occurs. Conventional testing can be costly when considering the number of experiments needed to characterize the creep response of a material over a range of stress and temperature. To predict long-term creep-rupture properties, the time-temperature-stress superposition principle (TTSSP) approach has been employed where stress and/or temperature is applied at an elevated level; the result of which are extrapolated down to low stress and/or temperature conditions. These methods have been successful in predicting minimum-creep-strain-rate (MCSR) and stress-rupture (SR) but suffer from an inability to predict the creep deformation curve or account for changes in deformation mechanisms or aging that occurs at long-duration. An accelerated technique, termed the Stepped isostress method (SSM) allows the accelerated testing of materials to determine their creep deformation response. Unlike TTSSP tests, the SSM test employs a single specimen where the stress is periodically step increased until rupture. The SSM creep deformation curve is processed (time and strain shifted) to produce an accelerated creep deformation curve that represent the creep deformation curve at the initial stress level in SSM. A processing procedure for metals has yet to be developed. The research objective of this study is to develop a processing procedure for SSM test data using a creep-damage constitutive model. Triplicate SSM tests were conducted on Ni-based superalloy Inconel 718 at 650°C with stress being periodically increased until rupture. Triplicate CCT tests were conducted at the initial stress level of the SSM tests. The Sine-hyperbolic (Sinh) creep-damage model was employed in this study. The Sinh creep-damage constitutive model is based on coupled creep strain rate and damage evolution equations; where both rates are dependent on the current state of damage. Calibration is two-step: analytical and numerical optimization. Each stepped creep deformation curve is tackled quasi-analytically to determine MCSR and SR related material constants and accumulated damage. The damage accumulated at the end of each step was then passed onto subsequent steps to calibrate the MCSR, rupture prediction, and damage evolution. Numerical optimization was applied to optimize model constants involved in the creep strain constitutive equations in order to generate best-fitted Sinh creep deformation curves. The Sinh model predictions were compared to the SSM and CCT data. The Sinh model satisfactorily predicts the SSM data and thus the calibrated material constants provides a good estimate of rupture found in the CCT data. Calibration using SSM data reduces the number of tests needed to calibrate a model; significantly reducing costs. A single SSM test replaces numerous creep tests at different stresses.

36 MATERIALS SCIENCE↗

Wing design code using three-dimensional Euler equations and optimization

This paper describes a new wing design code which is based on the Euler equations and a constrained numerical optimization technique. The geometry modification is based on a set of fundamental modes define on the unit interval. A design example involving a high speed civil transport wing is presented to demonstrate the usefulness of the design code. It is shown that the use of an Euler solver in the direct numerical optimization procedures is affordable on the current generation of supercomputers.

Chang, I-Chung↗