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,657 records · Page 92

Design tradeoffs on engine-integrated hypersonic vehicles

Two classes of airbreathing hypersonic vehicle concepts, one for primarily cruise missions and the other for accelerator type missions, are presented. Both are designed with waverider airframes and hydrogen-fueled scramjet engine modules. Cruise configurations are optimized for the product of I(sp) and L/D while matching lift to weight and thrust to drag at some equivalence ratio. Accelerator configurations are optimized for effective specific impulse while matching lift to weight at an equivalence ratio of one. The method and computer code developed to optimize the configurations are discussed. The features and design tradeoffs for each class of vehicles are described. Recently available weight estimates for all-body waveriders have had a significant impact on the integrated configurations. Mach 8 vehicles at 40 km altitude optimized with the cruise objective function have L/Ds of 2.55 to 2.92 and I(sp)s of 2850 to 2940 sec. A Mach 14 vehicle at 40-km altitude optimized with the accelerator objective function has an I(sp) sub eff of 189 sec, and a Mach 10 vehicle an I(sp) sub eff of 880 sec.

O'Neill, Mary Kae L.↗

ODIN system technology module library, 1972 - 1973

ODIN/RLV is a digital computing system for the synthesis and optimization of reusable launch vehicle preliminary designs. The system consists of a library of technology modules in the form of independent computer programs and an executive program, ODINEX, which operates on the technology modules. The technology module library contains programs for estimating all major military flight vehicle system characteristics, for example, geometry, aerodynamics, economics, propulsion, inertia and volumetric properties, trajectories and missions, steady state aeroelasticity and flutter, and stability and control. A general system optimization module, a computer graphics module, and a program precompiler are available as user aids in the ODIN/RLV program technology module library.

Hague, D. S.↗

Wind Turbine Rotor Design Using High-Fidelity Aerostructural Optimization

Large wind turbines yield more energy but demand careful aeroelastic blade design. Coupled multiphysics design strategies can reduce wind energy costs by exploiting fluid-structure interactions. This work presents the first high-fidelity aerostructural optimization study of a large wind turbine rotor. We use blade-resolved fluid dynamics and structural solvers in a monolithic gradient-based optimization framework to explore steady-state torque and blade mass tradeoffs. The coupled-adjoint approach computes gradients efficiently, enabling the optimization of over 100 structural and geometric parameters simultaneously. Our optimization study modifies a DTU 10 MW benchmark with a simplified structure and isotropic material properties. The tightly coupled optimizations increase torque by 14% while reducing rotor mass by 9% or reduce blade mass by 27% while maintaining torque. Blade-resolved models provide greater design freedom, enabling 5% higher mass reductions than conventional parameterizations at equal torque. This framework paves the way for more detailed high-fidelity optimization studies to complement conventional design approaches.

17 WIND ENERGY↗

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗

Helicopter mission optimization study

The feasibility of using low-cost, portable computer technology to help a helicopter pilot optimize flight parameters to minimize fuel consumption and takeoff and landing noise was demonstrated. Eight separate computer programs were developed for use in the helicopter cockpit using a hand-held computer. The programs provide the helicopter pilot with the ability to calculate power required, minimum fuel consumption for both range and endurance, maximum speed and a minimum noise profile for both takeoff and landing. Each program is defined by a maximum of two magnetic cards. The helicopter pilot is required to key in the proper input parameter such as gross weight, outside air temperature or pressure altitude.

Olson, J. R.↗

Evaluating Proxy Apps with FPGAs

Field-programmable gate arrays (FPGAs) are becoming more promising for high performance computing (HPC). Unlike fixed hardware specialization, reconfigurability allows FPGAs to be customized for a wide variety of HPC workloads. Our ultimate goal is to understand the viability of FPGAs as accelerators for some of the key HPC codes at LLNL and identify application characteristics that can benefit from the reconfigurability of FPGAs. More specifically, this LDRD project conducted a detailed performance study of FPGAs using sparse matrix computations and identified key optimization techniques to effectively use FPGA hardware resources.

97 MATHEMATICS AND COMPUTING↗

Adiabatic quantum support vector machines

Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic quantum approach for training support vector machines. We show that the time complexity of our quantum approach is an order of magnitude better than the classical approach. Next, we compare the test accuracy of our quantum approach against a classical approach that uses the Scikit-learn library in Python across five benchmark datasets (Iris, Wisconsin Breast Cancer (WBC), Wine, Digits, and Lambeq). We show that our quantum approach obtains accuracies on par with the classical approach. Finally, we perform a scalability study in which we compute the total training times of the quantum approach and the classical approach with an increasing number of features and an increasing number of data points in the training dataset. In conclusion, our scalability results show that the quantum approach obtains a 3.5–4.5x speedup over the classical approach on datasets with many (millions of) features.

Computational Complexity↗

Machine learning-based surrogate models and transfer learning for derivative free optimization of HT-PEM fuel cells

Widespread adoption of high-temperature polymer electrolyte membrane electrochemical systems, such as fuel cells (HT-PEMFCs), requires models and computational tools for accurate optimization and guiding new materials for enhancing performance and durability. In this contribution, knowledge-based modelling and data-driven modelling are combined using Few-Shot Learning and implementing an Automated Machine Learning framework for the generation of Machine Learning-based surrogate models. Applicability of the resulting model for derivative-free optimization is demonstrated. Additionally, a way of considering extrapolation in the optimization task is presented. Results show that although extrapolation is needed to achieve better solutions during optimization, it can be monitored and managed. As a result, tuning the electrode ionomer binder's properties, such as ionic conductivity, in the fuel cell represents a promising pathway for improving HT-PEMFC performance.

08 HYDROGEN↗

Cohesive phase-field fracture and a PDE constrained optimization approach to fracture inverse problems

In recent years there has been a proliferation of modeling techniques for forward predictions of crack propagation in brittle materials, including: phase-field/gradient damage models, peridynamics, cohesive-zone models, and G/XFEM enrichment techniques. However, progress on the corresponding inverse problems has been relatively lacking. Taking advantage of key features of existing modeling approaches, we propose a parabolic regularization of Barenblatt cohesive models which borrows extensively from previous phase-field and gradient damage formulations. An efficient explicit time integration strategy for this type of nonlocal fracture model is then proposed and justified. In addition, we present a C++ computational framework for computing in- put parameter sensitivities efficiently for explicit dynamic problems using the adjoint method. This capability allows for solving inverse problems involving crack propagation to answer interesting engineering questions such as: 1) what is the optimal design topology and material placement for a heterogeneous structure to maximize fracture resistance, 2) what loads must have been applied to a structure for it to have failed in an observed way, 3) what are the existing cracks in a structure given various experimental observations, etc. In this work, we focus on the first of these engineering questions and demonstrate a capability to automatically and efficiently compute optimal designs intended to minimize crack propagation in structures.

97 MATHEMATICS AND COMPUTING↗

SMALE: Enhancing Scalability of Machine Learning Algorithms on Extreme-Scale Computing Platforms

Deployment and execution of machine learning tasks on extreme-scale computing platforms face several significant technical challenges: 1) High computing cost incurred by dense networks – The computing workload of deep networks with densely-connected topology increases rapidly with the network size, imposing a non-scalable computing model of extreme-scale computing platforms; 2) Non-optimized workload distribution – Many advanced deep learning algorithms, e.g., sparsification and irregular net-work topology, produce very unbalanced workload distribution on extreme-scale computing platforms. The computation efficiency is greatly hindered by the incurred data and computation redundancies as well as long tails of the node with extensive workload; 3) Constraints in data movement and I/O bottle-neck – Inter-node data movement in extreme-scale computing platforms are associated with high energy and latency costs, and subject to the constraints of I/O bandwidth; and 4) Generalization of algorithm realization and acceleration on computing platforms – The large varieties of machine learning algorithms and structures of extreme-scale computing platforms make the derivation of a generalized algorithm realization and acceleration method very challenging, which, however, is the requirement by domain scientists and interested users. We call the above challenges Smale’s Problems in Machine Learning and Understanding for High-Performance Computing Scientific Discovery. The objective of our three-year research project is to develop a holistic innovation set at structure, assembly, and acceleration layers of machine learning algorithms to address the above challenges in algorithm deployment and execution. Three tasks are particularly performed, including: At the algorithm structure level, we investigate the techniques that can structurally sparsify on the topology of deep networks for computing workload reduction. We also study clustering and pruning techniques that can optimize the workload distributions over the extreme-scale computing platforms; At the algorithm assembly level, we derive a unified learning framework for unsupervised transfer learning and dynamic growing capabilities. Novel training methods are also exploited to enhance the training efficiency of the proposed framework; At the algorithm acceleration level, we will develop a series of techniques that can accelerate the computation of sparse matrix operations, which are one of the core executions in deep learning and optimize memory access of the concerned platforms. Our proposed techniques attack the fundamental problems in machine learning algorithms running on extreme-scale computing platforms by vertically integrating the solutions at three closely entangled layers, paving the long-term scaling path of machine learning applications under DOE context. Three tasks corresponding to the above respective research orientations are performed during the three-year project period with our collaborators at ORNL. The outcome of the proposed project is anticipated to form a holistic solution set of novel algorithms and network topologies, efficient training techniques, and fast acceleration methods to promote the computing scalability of the machine learning applications of particular interest to DOE.

97 MATHEMATICS AND COMPUTING↗

Calibration of cloud and aerosol related parameters for solar irradiance forecasts in WRF-solar

Model parameters are a major source of uncertainty in numerical weather prediction. Recently, the Weather Research and Forecasting model with Solar extensions (WRF-Solar) has been upgraded by enhancing the treatment of sub-grid scale cloud and aerosols with augmentations of a sub-grid scale cloud scheme (CLD3) and an upgraded aerosol-aware Thompson-Eidhammer scheme (TE14). However, the value of model parameters associated with these parameterizations are assigned based on limited measurements or theoretical calculations. Calibrating the most sensitive parameters has the potential to improve solar irradiance predictions. Here, we adopted a multiobjective surrogate-based optimization (SBO) framework to calibrate nine parameters used in CLD3 and TE14 that lead to the largest sensitivity in simulated irradiance. The normalized mean-absolute-error (NMAE) of global horizontal irradiance (GHI) and direct normal irradiance (DNI) are minimized by calibrating WRF-Solar over two regions including the Southern Great Plains (SGP) and Central California, in order to focus on parameter calibration under cloudy conditions with different aerosol loading. The results show that generalized linear model (GLM)-based surrogate models approximate physical models well, particularly when the third order and three-way interaction terms are considered. The SBO framework efficiently searches the parameter space for optimal solutions with less computational costs than directly calibrating the physical model. We first calibrate CLD3 parameters over the less-polluted SGP region. Optimized CLD3 parameters alone result in NMAE reduction by 14% for the site-mean and up to 33% for individual cases over the SGP region. With further calibration of TE14 parameters over the Central California during active fire periods, the optimized parameters lead to over 20% reductions of NMAE. Our investigation reveals, however, that optimizing TE14 has a limited impact on irradiance simulations under less-polluted conditions in the SGP.

14 SOLAR ENERGY↗

Quantum Noise Mitigation: Introducing the Robust Quantum Circuit Scheduler for Enhanced Fidelity and Throughput

Undoubtedly, quantum computing offers valuable acceleration for solving intricate problems. One of the primary hurdles lies in executing large-scale quantum applications on backend machines. Qubit noise, among other factors, dramatically influences the execution process. Implementing effective scheduling techniques for quantum circuits is crucial for practical quantum computing and preventing excessive waiting times. The quantum realm is distinct from classical computing in terms of optimization, performance, utilization, and waiting periods. Consequently, the parameters and components of quantum circuit scheduling diverge from those of classical computing. This paper presents Quantum Noise Mitigation: Introducing the Robust Quantum Circuit Scheduler for Enhanced Fidelity and Throughput, a straightforward yet effective scheduling framework and policy that enhances noise resilience, throughput, and the fidelity of quantum circuits. Drawing inspiration from classical methods, our scheduling approach incorporates additional constraints tailored for quantum logic. The outcome demonstrates a substantial improvement in fidelity and resource management, which is vital for real-world quantum applications.

Baheri, Betis↗

A comparison of two types of structural optimization procedures for satisfying flutter requirements

A comparison is made of results obtained from mathematical programming and optimality criteria procedures for the minimum-mass design of typical aircraft wing structures to satisfy prescribed flutter requirements. The mathematical programming method is based on an interior penalty function approach. A rigorous optimality criterion and an intuitive optimality criterion based on uniform strain energy density are considered. An intuitive resizing procedure is used for both optimality criterion solutions. All results are calculated using the same computer program, changing only the optimization procedure. Both high- and low-aspect-ratio wings are examined. Finite elements are used for structural modeling, and the generalized coordinates for the flutter solution are based on the natural vibration modes of the structure.

Haftka, R. T.↗

Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study

Quantum computing is one of the most enticing computational paradigms with the potential to revolutionize diverse areas of future-generation computational systems. While quantum computing hardware has advanced rapidly, from tiny laboratory experiments to quantum chips that can outperform even the largest supercomputers on specialized computational tasks, these noisy- intermediate scale quantum (NISQ) processors are still too small and non-robust to be directly useful for any real-world applications. In this paper, we describe NASA’s work in assessing and advancing the potential of quantum computing. We discuss advances in algorithms, both near- and longer-term, and the results of our explorations on current hardware as well as with simulations, including illustrating the benefits of algorithm-hardware codesign in the NISQ era. This work also includes physics-inspired classical algorithms that can be used at application scale today. We discuss innovative tools supporting the assessment and advancement of quantum computing, and describe improved methods for simulating quantum systems of various types on high performance computing systems that incorporate realistic error models. We provide an overview of recent methods for benchmarking, evaluating, and characterizing quantum hardware for error mitigation, computational purposes.

quantum computing↗

A necessary condition of Pontryagin type for fuzzy control systems

In the present paper, we prove necessary optimality conditions of Pontryagin type for a class of fuzzy optimal control problems. The new results are illustrated by computing the extremals of two fuzzy optimal control systems, which improve recent results of Najariyan and Farahi.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimizing human activity patterns using global sensitivity analysis

Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule’s regularity for a population. We show how to tune an activity’s regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. Here we use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Finally, though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.

97 MATHEMATICS AND COMPUTING↗

Optimally placing photovoltaic arrays to maximize value of energy production based on peak power production, local solar radiation, weather, electricity market prices and rate structures

A method, system and computer program product for optimally placing photovoltaic arrays to maximize a value of energy production. Incident solar radiation for various placements of the photovoltaic arrays accommodating different azimuths and tilts is calculated. Alternating current solar photovoltaic electricity energy and power production is then estimated from the calculated solar radiation on a plane and weather data. Furthermore, a value of solar photovoltaic electricity energy and power produced by the photovoltaic arrays for the various placements is calculating using the estimated alternating current solar photovoltaic electricity production. A placement out of the various placements for the photovoltaic arrays is then selected corresponding to a highest value of the solar photovoltaic electricity produced by the photovoltaic arrays. In this manner, the appropriate placement for the photovoltaic arrays is determined that maximizes the value of energy production (where “value” may correspond to an economic value or a non-economic value).

Webber, Michael E.↗

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↗