Search NASA⌕ Search

SEARCH · Search NASA

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 1,783 records · Page 99

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↗

Study network-related optimization problems using quantum alternating optimization ansatz

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.

Zhihui Wang↗

Rotorcraft airframe structural optimization for combined vibration and fatigue constraints

This paper addresses the application of a formal optimization technique in rotorcraft airframe structural design studies to reduce the structural weight, to lower airframe vibrations, and to enhance fatigue life of the structure. Vibration and fatigue considerations in airframe design are described. An optimization methodology based on the use of a nonlinear programming technique to size airframe structural members subjected to constraints on weight, vibration response and fatigue stresses under dynamic loads, are described. The paper focuses on the development of necessary computational tools for airframe structural optimization and describes the sensitivity analysis procedure for these types of design constraints. Further, the paper describes the optimization procedure as implemented in a computer code called DYNOPT which is a unique operational combination of several newly developed Fortran codes as well as modification of existing codes consisting of the direct matrix abstraction modules of the MSC/NASTRAN Program and CONMIN optimizer. The application of the optimization procedure is demonstrated using an elastic-line model of the Bell AH-1G helicopter airframe structure and computational results are discussed.

Sareen, Ashish K.↗

A Machine Learning-Assisted Framework to Control Thermally Anisotropic Building Envelopes in Residential Buildings

To curb the energy consumption of buildings and their related CO2 emissions, Oak Ridge National Laboratory (ORNL) has developed the thermally anisotropic building envelope (TABE) —a multi-layer design comprising insulation materials and metal foils connected to thermal loops. In this study, a machine learning-assisted framework was developed to control the TABE in residential buildings to reduce the computation load for future optimal rule-based control and application. First, a 2D finite element model was established in COMSOL to calculate the hourly heat flux through exterior walls installed with the TABE. Then, TABE wall heat fluxes were simulated for various given indoor and outdoor boundary conditions, as well as thermal loops fluid temperatures and flow rates. Since the finite element simulations are computationally expensive, an artificial neural network (ANN) was then trained to use as a proxy of the finite element (COMSOL) modeling. Finally, the trained ANN model was coupled with the EnergyPlus model to predict the energy consumption of a US Department of Energy prototype single-family house installed with the TABE. An optimal simple rule-based control was determined from predefined rules for a case study. The results demonstrate that the developed machine learning–assisted framework can reduce 99.9% of the computation time while efficiently managing residential building energy for installed TABE walls.

Shen, Zhenglai↗

Design And Verification of Controllers for Coupled Bunch Instabilities Using Optimal Control Theory And Numerical Simulation: Predictions for PEP II

We present a technique for the design and verification of efficient bunch-by-bunch controllers for damping longitudinal multibunch instabilities. The controllers attempt to optimize the use of available feedback amplifier power - one of the most expensive components of a feedback system - and define the limits of the closed loop system performance. Our design technique alternates between analytic computation of single bunch optimal controllers and verification on a multibunch numerical simulator. The simulator uses PEP-II parameters and identifies unstable coupled bunch modes, their growth rates and their damping rates with feedback. The results from the simulator are shown to be in reasonable agreement with analytical calculations based on the single bunch model. The technique is then used to evaluate the performance of a variety of controllers proposed for PEP-II.

43 PARTICLE ACCELERATORS↗

Optimizing the G/T ratio of the DSS-13 34-meter beam-waveguide antenna

Calculations using Physical Optics computer software were done to optimize the gain-to-noise-temperature (G/T) ratio of Deep Space Station (DSS)-13, the Deep Space Network's (DSN's) 34-m beam-waveguide antenna, at X-band for operation with the ultra-low-noise amplifier maser system. A better G/T value was obtained by using a 24.2-dB far-field-gain smooth-wall dual-mode horn than by using the standard X-band 22.5-dB-gain corrugated horn.

Esquivel, M. S.↗

Parallel DTFE Surface Density Field Reconstruction

We improve the interpolation accuracy and efficiency of the Delaunay tessellation field estimator (DTFE) for surface density field reconstruction by proposing an algorithm that takes advantage of the adaptive triangular mesh for line-of-sight integration. The costly computation of an intermediate 3D grid is completely avoided by our method and only optimally chosen interpolation points are computed, thus, the overall computational cost is significantly reduced. The algorithm is implemented as a parallel shared-memory kernel for large-scale grid rendered field reconstructions in our distributed-memory framework designed for N-body gravitational lensing simulations in large volumes. We also introduce a load balancing scheme to optimize the efficiency of processing a large number of field reconstructions. Our results show our kernel outperforms existing software packages for volume weighted density field reconstruction, achieving ~ 10x speedup, and our load balancing algorithm gains an additional ~ 3.6x speedup at scales with ~ 16k processes.

97 MATHEMATICS AND COMPUTING↗

Image processing and reconstruction [Slides]

This talk will examine some mathematical methods for image processing and the solution of underdetermined, linear inverse problems. The talk will have a tutorial flavor, mostly accessible to undergraduates, while still presenting research results. The primary approach is the use of optimization problems. We will find that relaxing the usual assumption of convexity will give us much better results.

97 MATHEMATICS AND COMPUTING↗

Optimization Algorithms for Hierarchical Problems, with Applications to Nanoporous Materials

The aim of the overall project was research to formulate and solve multi-scale optimization problems for energy storage applications. More specifically, we formulated multi-scale models for optimizing the internal structure of nanoporous materials, with the goal of developing models for related energy applications associated with sustainable sources of energy. The applications include supercapacitors, hydrogen storage, catalytic beds, and filters. The optimization algorithms we have developed can be applied to general hierarchical design problems arising from complex systems.

97 MATHEMATICS AND COMPUTING↗

Modeling Time-Dependent Surrogates of Additive-Manufactured Nuclear Fuels Processes

Additive manufacturing (AM) technology is being increasingly adopted in a wide variety of application areas for its ability to rapidly produce, prototype, and customize designs. Recently, a hybrid AM technique was successfully developed at Idaho National Laboratory (INL) to manufacture nuclear fuels [1]. Despite the advantages, this AM technique needs optimization due to defects from a highly complex melting and sintering process. The complex metallurgical phenomena during AM processes are strongly related to parameters such as applied laser power, traveling speed, and scan style, which could lead to differences in density, residual stress, crystallographic texture, and mechanical properties. In addition, stochastic variations in laser energy interaction and associated multiscale/multiphysics phenomena cause variations in microstructure evolution and mechanical properties. Currently, researchers at INL are focusing on developing a comprehensive modeling framework, leveraging INL’s simulation tools MOOSE/MARMOT/BISON/RAVEN [2-4] to describe all steps of this AM process across multiple length scales. Although this advanced framework plays a critical role in enabling enhancements to traditional trial and error approaches for design and optimization of nuclear fuel materials, it remains computationally intense, limiting its use in sensitivity and optimization analysis. In this case, an accurate and inexpensive surrogate becomes an effective tool for providing a tractable approximation of the underlying underline physics. Surrogate models generally not based on the physics of a system are purely mathematical models used to capture the relationships between specific system inputs and outputs. Popular approaches, including neural networks [5], response surfaces [6], and subspace-based reduced order models [7], have been applied to a wide range of disciplines, such as nuclear reactor design, aerospace design and automotive design. In this summary, we employ advanced time-dependent surrogate models such as high-dimensional model representation (HDMR) [8] and physics-informed deep neural network (PINNs) [9] to accelerate the design and optimization of AM process.

42 ENGINEERING↗

SU-D-BRD-01: Cloud-Based Radiation Treatment Planning: Performance Evaluation of Dose Calculation and Plan Optimization

Purpose: To report the first experience on the development of a cloud-based treatment planning system and investigate the performance improvement of dose calculation and treatment plan optimization of the cloud computing platform. Methods: A cloud computing-based radiation treatment planning system (cc-TPS) was developed for clinical treatment planning. Three de-identified clinical head and neck, lung, and prostate cases were used to evaluate the cloud computing platform. The de-identified clinical data were encrypted with 256-bit Advanced Encryption Standard (AES) algorithm. VMAT and IMRT plans were generated for the three de-identified clinical cases to determine the quality of the treatment plans and computational efficiency. All plans generated from the cc-TPS were compared to those obtained with the PC-based TPS (pc-TPS). The performance evaluation of the cc-TPS was quantified as the speedup factors for Monte Carlo (MC) dose calculations and large-scale plan optimizations, as well as the performance ratios (PRs) of the amount of performance improvement compared to the pc-TPS. Results: Speedup factors were improved up to 14.0-fold dependent on the clinical cases and plan types. The computation times for VMAT and IMRT plans with the cc-TPS were reduced by 91.1% and 89.4%, respectively, on average of the clinical cases compared to those with pc-TPS. The PRs were mostly better for VMAT plans (1.0 ≤ PRs ≤ 10.6 for the head and neck case, 1.2 ≤ PRs ≤ 13.3 for lung case, and 1.0 ≤ PRs ≤ 10.3 for prostate cancer cases) than for IMRT plans. The isodose curves of plans on both cc-TPS and pc-TPS were identical for each of the clinical cases. Conclusion: A cloud-based treatment planning has been setup and our results demonstrate the computation efficiency of treatment planning with the cc-TPS can be dramatically improved while maintaining the same plan quality to that obtained with the pc-TPS. This work was supported in part by the National Cancer Institute (1R01 CA133474) and by Leading Foreign Research Institute Recruitment Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (MSIP) (Grant No.2009-00420)

60 APPLIED LIFE SCIENCES↗

Efficient Ensemble-Based Stochastic Gradient Methods for Optimization Under Geological Uncertainty

Ensemble-based stochastic gradient methods, such as the ensemble optimization (EnOpt) method, the simplex gradient (SG) method, and the stochastic simplex approximate gradient (StoSAG) method, approximate the gradient of an objective function using an ensemble of perturbed control vectors. These methods are increasingly used in solving reservoir optimization problems because they are not only easy to parallelize and couple with any simulator but also computationally more efficient than the conventional finite-difference method for gradient calculations. In this work, we show that EnOpt may fail to achieve sufficient improvement of the objective function when the differences between the objective function values of perturbed control variables and their ensemble mean are large. On the basis of the comparison of EnOpt and SG, we propose a hybrid gradient of EnOpt and SG to save on the computational cost of SG. We also suggest practical ways to reduce the computational cost of EnOpt and StoSAG by approximating the objective function values of unperturbed control variables using the values of perturbed ones. We first demonstrate the performance of our improved ensemble schemes using a benchmark problem. Results show that the proposed gradients saved about 30–50% of the computational cost of the same optimization by using EnOpt, SG, and StoSAG. As a real application, we consider pressure management in carbon storage reservoirs, for which brine extraction wells need to be optimally placed to reduce reservoir pressure buildup while maximizing the net present value. Results show that our improved schemes reduce the computational cost significantly.

58 GEOSCIENCES↗

Assessment of Model-Based Schemes for Accelerating Optimization by RAVEN

Nuclear-Renewable Hybrid Energy Systems (N-R HES) combine different energy technologies in a synergistic way with the objective of achieving a more economical energy production. In this report the particular hybrid system dealt with includes a PWR nuclear reactor, the associated Rankine-based energy conversion cycle (Balance of Plant, BOP), an Industrial Process (IP) for hydrogen production, a gas turbine (Second Energy Source, SES), and a battery (Energy Storage, ES). The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the N-R HES. HYBRID solves the coupled capacity planning-economic and dispatch optimization problem with the objective of minimizing the Levelized Cost of Electricity (LCOE). In the optimization of the power dispatch strategy, the HYBRID framework takes into account the time-dependent dynamics of each subsystem by including a Dymola object-oriented model of the process dynamics. To ease the computational burden of the optimization process, an initial guess for the dispatch optimization problem is provided by a preconditioner. The solution guess is calculated by means of a least-marginal cost approach which applies the same criterion behind the screening curve method. Though this algorithm allows evaluating an economically adapted generation mix for a target load duration curve within a few seconds, it neglects the constraints due to the single component dynamics, and it is not able to adequately represent the ES. An improved treatment of the pre-conditioner problem was addressed by introducing a Monte Carlo based optimization algorithm. The new approach takes into account limits on power rates for the system subcomponents, which was not previously done. Additionally, this new Monte-Carlo based preconditioner addresses the problem with the ES component through improved modeling of that component. The new algorithm has been implemented in the HYBRID framework and tested to assess its performance. The results obtained with the new Monte Carlobased preconditioner were benchmarked against those obtained through the reference deterministic approach. The comparison shows that the Monte-Carlo based approach provides improved solution accuracy to the power dispatch optimization problem. Also in this report, the treatment of the penalty function on LCOE is discussed, and an improved penalty function for missed demand is suggested and tested.

Maronati, Giovanni↗

Modeling error analysis of stationary linear discrete-time filters

The performance of Kalman-type, linear, discrete-time filters in the presence of modeling errors is considered. The discussion is limited to stationary performance, and bounds are obtained for the performance index, the mean-squared error of estimates for suboptimal and optimal (Kalman) filters. The computation of these bounds requires information on only the model matrices and the range of errors for these matrices. Consequently, a design can easily compare the performance of a suboptimal filter with that of the optimal filter, when only the range of errors in the elements of the model matrices is available.

Patel, R.↗

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

Variable-Metric Algorithm For Constrained Optimization

Variable Metric Algorithm for Constrained Optimization (VMACO) is nonlinear computer program developed to calculate least value of function of n variables subject to general constraints, both equality and inequality. First set of constraints equality and remaining constraints inequalities. Program utilizes iterative method in seeking optimal solution. Written in ANSI Standard FORTRAN 77.

Frick, James D.↗

Sensitivity analysis in multipole-accelerated panel methods for potential flow

In the design of an airframe, the effect of changing the geometry on resulting computations is necessary for design optimization. The geometry is defined in terms of a series of design variables, including design variables to define the wing planform, tail, canard, pylon, and nacelle. Design optimization in this research is based on how these design variable affect the potential flow. The potential flow is computed as a function of the geometry and location of a series of panels describing the airframe, which are in turn a function of the design variables. Multipole accelerated panel methods improve the computational complexity of the problem and thus are an attractive approach. To utilize the methods in design optimization, it was necessary to define the appropriate sensitivity derivatives. The overhead incurred from finding the sensitivity derivatives in conjunction with the original computation should be small. This research developed the background for multipole-accelerated panel methods and the framework for finding sensitivity derivatives in the methods. Potential flow panel codes are commonly used for powered-lift aerodynamic predictions for three dimensional geometries. Given an airframe which has been discretized into a series of panels to define the airframe geometry, potential is computed as a function of the influence of all panels on all other panels. This is a computationally intensive problem for which efficient solutions are desired to improve the computational time and to allow greater resolution by use of more panels. One such solution is the use of hierarchical multipole methods which entail approximations of the effects of far-field terms. Hierarchical multipole methods have become prevalent in molecular dynamics and gravitational physics, and have been introduced into the fields of capacitance calculations, computational fluid dynamics, and electromagnetics. The methods utilize multipole expansions to describe the effect of bodies (i.e. particles, astrophysical bodies, panels, etc.) within a sphere on points distant from the sphere, where the influence diminishes as a function of distance. The expansions are exact with infinite series, however, for practical computations, the series are truncated and accuracy is selected based on the number of terms retained in the expansions. A hierarchical tree structure groups bodies together based on proximity to allow definition of multipole expansions for each group. The multipole expansions are then used to compute the effect of the bodies in a group on distant bodies.

Leathrum, James F., Jr.↗