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 847 records · Page 47

A grid-scale study of demand bidding by large industrial users

A demand bidding mechanism for engaging large industrial electricity users in the operation of the power grid is presented. Demand bidding is formulated as an optimization problem based on a modified version of the alternating current optimal power flow problem, and can be interpreted as a tâtonnement process between the grid operator and electricity users. Here, the work provides the first – to the authors’ knowledge – grid-scale case study of demand bidding, using a synthetic grid structure in the footprint of the grid of Texas. Results reveal that the demand bidding lowers overall power generation costs, but economic benefits plateau as the number of participants increases. Transmission line and transformer capacity constraints become the limiting factors, revealing that expanding and fortifying the transmission infrastructure is key to expanding demand-side participation. Demand bidding does not substantially alter the optimal operation of existing bidding entities when the number of bidders increases, thereby supporting existing bidders to stay in the system and encouraging new ones to join.

Chlor-alkali plant↗

Approximate Latent Factor Algorithm for Scenario Selection and Weighting in Transmission Expansion Planning

One major difficulty in transmission expansion planning is selecting the representative scenarios to use to evaluate candidate transmission networks. The variability in demand and renewable generation makes the inclusion of several scenarios critical when calculating reliability and cost, but including too many scenarios in an optimization is computationally intractable. To reduce the number of representative operating conditions needed to obtain an accurate approximation of the system, we propose a method rooted in multivariate statistics that exploits the latent correlative structure between different scenarios and network configurations. The proposed algorithm includes an objective and rigorous way to select a subset of scenarios that provide as much information about the system as possible, and a method to accurately approximate the system cost from that scenario subset. The result is a set of scenarios and weights that are easily incorporated into traditional transmission expansion planning formulations. We apply this to a 312-bus WECC model with 8,736 distinct operating conditions. The transmission plans found with the proposed method are more reliable and have a lower total cost than those from other scenario reduction techniques, as well as a smaller error between the expected system performance from the optimization objective and the actual system performance.

42 ENGINEERING↗

Regression Analysis of Top of Descent Location for Idle-thrust Descents

In this paper, multiple regression analysis is used to model the top of descent (TOD) location of user-preferred descent trajectories computed by the flight management system (FMS) on over 1000 commercial flights into Melbourne, Australia. The independent variables cruise altitude, final altitude, cruise Mach, descent speed, wind, and engine type were also recorded or computed post-operations. Both first-order and second-order models are considered, where cross-validation, hypothesis testing, and additional analysis are used to compare models. This identifies the models that should give the smallest errors if used to predict TOD location for new data in the future. A model that is linear in TOD altitude, final altitude, descent speed, and wind gives an estimated standard deviation of 3.9 nmi for TOD location given the trajec- tory parameters, which means about 80% of predictions would have error less than 5 nmi in absolute value. This accuracy is better than demonstrated by other ground automation predictions using kinetic models. Furthermore, this approach would enable online learning of the model. Additional data or further knowl- edge of algorithms is necessary to conclude definitively that no second-order terms are appropriate. Possible applications of the linear model are described, including enabling arriving aircraft to fly optimized descents computed by the FMS even in congested airspace. In particular, a model for TOD location that is linear in the independent variables would enable decision support tool human-machine interfaces for which a kinetic approach would be computationally too slow.

trajectory prediction↗

Optimal control model of technology transition.

This paper discusses the use of optimization software to solve an optimal control problem arising in the modeling of technology transition. We set up a series of increasingly complex models with such features as learning-by-doing, adjustment cost, and capital investment. The models are written in continuous time and then discretized by using different methods to transform them into large-scale nonlinear programs. We use a modeling language and numerical optimization methods to solve the optimization problem. Our results are consistent with findings in the literature and highlight the impact the discretization choice has on the solution and accuracy. The primary goal of this paper is to develop solution methods for use in policy work. To do this, we will need to expand the model to include realistic features such as additional technologies and capital conversion. Our modeling approach allows us to add new technologies with minimal effort. For example, Figure 5 presents the solution to the capital model that includes a third technology, say, nuclear fusion, that is emission free but even more expensive (A{sub 3} > A{sub n}). We observe that industry first transitions to the intermediate technology but eventually adopts the cleanest one. We note that our solutions have few areas of large curvature and are relatively smooth elsewhere. On such smooth segments, we can achieve adequate precision with relatively large periods, which means fewer variables and increased computation speed. But we still need a small step length during the transition period. Adaptive mesh refinement methods have been developed to automatically identify the areas where extra precision is needed. Betts (2001) describes how the computation time can be reduced by a factor of 2.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Optimal Allocation Of Tasks In Hypercube Computers

Uniform tasks distributed uniformly or else assigned to one processor. Investigation in theory of scheduling yielded optimal scheme for allocation of tasks among digital data processors in hypercube ensemble. Applies to tasks that require equal time to execute, performed in any order, and between any two of which equal amounts of communication required. Reduces overall processing time for given set of computational tasks.

Salama, Moktar A.↗

Flow and Heat Transfer Experimental Study for 3D-Printed Solar Receiving Tubes With Helical Fins at Internal Surface

3D-printing technology was applied to fabricate novel solar thermal collection tubes that have internal heat transfer enhancement fins and external surfaces with high solar absorptivity and low emissivity due to the ability to use different materials in one tube. Helical fins were selected to introduce circumferential flow and thus minimize the circumferential temperature difference of the tube that receives sunlight on one side. The structures of the helical fins were previously optimized from computational fluid dynamics (CFD) analysis with the objective of low entropy production rate by looking for high heat transfer coefficient and relatively lower pressure loss. High-temperature alloy, Inconel-718, was used to 3D print the tubes, which can resist corrosion for the potential application of molten chloride salts as heat transfer fluid. Experimental tests were carried out using water as the heat transfer fluid with the high heat flux provided by a tubular furnace heater. The tested Reynolds number ranges from 3.9 × 10 3 to 6.1 × 10 4 . Heat transfer coefficients of up to 2.8 times that of the smooth tube could be obtained with the expense of increased pressure loss compared to that of the smooth tube. The total system entropy generation can be significantly reduced due to the benefit of heat transfer enhancement that is greater than the expenses of the increased pressure loss. The experimental results of the 3D-printed heat transfer tubes confirmed the CFD-based results of fin optimization. Furthermore, the novel heat transfer tube is recommended for application in concentrating solar power systems.

14 SOLAR ENERGY↗

Linear shaped-charge jet optimization using machine learning methods

Linear shaped charges are used to focus energy into rapidly creating a deep linear incision. The general design of a shaped charge involves detonating a confined mass of high explosive (HE) with a metal-lined concave cavity on one side to produce a high velocity jet for the purpose of striking and penetrating a given material target. This jetting effect occurs due to the interaction of the detonation wave with the cavity geometry, which produces an unstable fluid phenomenon known as the Richtmyer–Meshkov instability and results in the rapid growth of a long narrow jet. We apply machine learning and optimization methods to hydrodynamics simulations of linear shaped charges to improve the simulated jet characteristics. The designs that we propose and investigate in this work generally involve modifying the behavior of the detonation waves prior to interaction with the liner material. These designs include the placement of multiple detonators and the use of metal inclusions within the HE. In conclusion, we are able to produce a linear shaped-charge design with a higher penetration depth than the baseline case that we consider and accomplish this using the same amount of or less HE.

36 MATERIALS SCIENCE↗

Quantum dot ternary-valued full-adder: Logic synthesis by a multiobjective design optimization based on a genetic algorithm

A methodology is proposed for designing a low-energy consuming ternary-valued full adder based on a quantum dot (QD) electrostatically coupled with a single electron transistor operating as a charge sensor. The methodology is based on design optimization: the values of the physical parameters of the system required for implementing the logic operations are optimized using a multiobjective genetic algorithm. The searching space is determined by elements of the capacitance matrix describing the electrostatic couplings in the entire device. The objective functions are defined as the maximal absolute error over actual device logic outputs relative to the ideal truth tables for the sum and the carry-out in base 3. The logic units are implemented on the same device: a single dual-gate quantum dot and a charge sensor. Their physical parameters are optimized to compute either the sum or the carry out outputs and are compatible with current experimental capabilities. The outputs are encoded in the value of the electric current passing through the charge sensor, while the logic inputs are supplied by the voltage levels on the two gate electrodes attached to the QD. The complex logic ternary operations are directly implemented on an extremely simple device, characterized by small sizes and low-energy consumption compared to devices based on switching single-electron transistors. The design methodology is general and provides a rational approach for realizing non-switching logic operations on QD devices.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Parallel Computation of Sensitivity Derivatives with Application to Aerodynamic Optimization of a Wing

This paper focuses on the parallel computation of aerodynamic derivatives via automatic differentiation of the Euler/Navier-Stokes solver CFL3D. The comparison with derivatives obtained by finite differences is presented and the scaling of the time required to obtain the derivatives relative to the number of processors employed for the computation is shown. Finally, the derivative computations are coupled with an optimizer and surface/volume grid deformation tools to perform an optimization to reduce the drag of a three-dimensional wing.

Biedron, Robert T.↗

Molecular concentration field design using closed-form steady-state solutions

Control over spatial concentration fields represents a fundamental challenge in designing synthetic biological systems and programmable soft materials. While nature creates morphogen gradients that orchestrate complex developmental processes, synthetic approaches have largely relied on empirical optimization and computationally intensive simulations. Here, we present an analytical framework for steady-state concentration fields generated by finite-sized localized sources in diffusion–degradation systems and derive closed-form solutions for one-, two-, and three-dimensional geometries. By expressing these solutions in dimensionless form, we show that gradient steepness and spatial structure are organized by the Thiele modulus, which captures the competition between diffusion and degradation length scales. The analysis reveals distinct design regimes: in degradation-dominated systems, gradient shape is governed by exponential decay and becomes dimension-independent, whereas in diffusion-dominated systems, gradient magnitude and extent follow dimension-dependent power-law scaling. Building on these results, we introduce a quantitative design strategy that uses threshold-based criteria to program concentration ranges by tuning physically accessible parameters, most directly the production rate, while holding transport and degradation properties fixed. Comparisons with numerical solutions and reported experimental systems demonstrate consistency with the predicted scaling behavior. Together, this work provides a generalizable and physically transparent framework for designing steady-state concentration fields in synthetic biological and soft matter systems, enabling predictive control of gradient-mediated organization without reliance on extensive numerical optimization.

Kim, Dong Woo [Johns Hopkins University, Baltimore↗

Generalized and efficient algorithm for computing multipole energies and gradients based on Cartesian tensors

Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A software library based on this algorithm has been implemented in C++11 and has been released.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Accurate and Efficient Parametric Model-Order Reduction for Turbulent Thermal Transport

This project produced new algorithms and software for low-cost exploration of turbulent thermal-fluids behavior under parametric variation by using reduced-order models (ROMs). The ROMs numerically solve the governing equations for fluid motion by using a small set of basis functions (typically, N=20-200 modes) to represent the solution. The base modes are computed as optimal combinations of solutions from expensive high-fidelity "anchor-point" solutions involving millions of unknowns, which are typically generated by solving the full Navier-Stokes equations on a supercomputer. The ROM solution is itself a combination of the base modes, where the basis coefficients are determined by evolving an NxN system of nonlinear equations. The overarching idea is to use the inexpensive ROM to predict solutions under conditions where the parameters differ from the anchor-point conditions. Several ingredients are required to make ROMs useful for thermal hydraulics analysis. These include: a stable and accurate ROM that is capable of reproducing the large-scale dynamics of turbulent flow, error indicators than can guide the choice of anchor points, and low-cost mechanisms for evaluating nonlinear terms in the reduced equations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Effects of surface vacancy-adatom pair formation on PFC tungsten surface morphological response

Abstract We report a simulation study of the effect of He-irradiation-induced surface vacancy-adatom pair formation on the surface morphological evolution of plasma-facing component (PFC) tungsten and examine a number of factors that impact such evolution. Our analysis is based on self-consistent dynamical simulations according to an atomistically-informed, continuum-scale surface evolution model that has been developed following a hierarchical multiscale modeling strategy and can access the spatiotemporal scales of relevance to fuzz formation. The model accounts for the flux of surface adatoms generated as a result of the surface vacancy-adatom pair formation effect upon He implantation, which contributes to the anisotropic growth of surface nanostructural features due to the different rates of adatom diffusion along and across step edges of islands on the tungsten surface. We have carried out atomic-scale computations of optimal diffusion pathways along and across island step edges on the W(110) surface and calculated Ehrlich–Schwoebel (ES) barriers in adatom diffusion along and across such step edges. This aspect of surface adatom diffusion contributes to anisotropic surface atomic fluxes, terrace and step diffusive currents, and has been incorporated into our PFC surface evolution model, which predicts the formation of preferentially aligned nanoridge stripe patterns on the PFC surface. We establish that these anisotropic diffusive currents accelerate nanotendril growth on the PFC surface and the onset of surface nanostructure pattern formation. We also explore systematically the dependence of the PFC surface morphological response on the surface temperature and He ion incident flux, characterize in detail the resulting surface topographies and growth kinetics, and compare the predicted surface morphologies with experimental observations. Our simulation predictions for the emerging surface nanostructure patterns under certain plasma exposure conditions are consistent with experimental findings in the literature.

36 MATERIALS SCIENCE↗

Succinate Overproduction: A Case Study of Computational Strain Design Using a Comprehensive Escherichia coli Kinetic Model

Computational strain-design prediction accuracy has been the focus for many recent efforts through the selective integration of kinetic information into metabolic models. In general, kinetic model prediction quality is determined by the range and scope of genetic and/or environmental perturbations used during parameterization. Here, we apply the k-OptForce procedure on a kinetic model of E. coli core metabolism constructed using the Ensemble Modeling (EM) method and parameterized using multiple mutant strains data under aerobic respiration with glucose as the carbon source. Minimal interventions are identified that improve succinate yield under both aerobic and anaerobic conditions to test the fidelity of model predictions under both genetic and environmental perturbations. Under aerobic condition, k-OptForce identifies interventions that match existing experimental strategies while pointing at a number of unexplored flux re-directions such as routing glyoxylate flux through the glycerate metabolism to improve succinate yield. Many of the identified interventions rely on the kinetic descriptions that would not be discoverable by a purely stoichiometric description. In contrast, under fermentative (anaerobic) condition, k-OptForce fails to identify key interventions including up-regulation of anaplerotic reactions and elimination of competitive fermentative products. This is due to the fact that the pathways activated under anaerobic condition were not properly parameterized as only aerobic flux data were used in the model construction. This study shed light on the importance of condition-specific model parameterization and provides insight on how to augment kinetic models so as to correctly respond to multiple environmental perturbations.

59 BASIC BIOLOGICAL SCIENCES↗

Cognition at the Point of Sensing

Over the last 15 years, compressive sensing techniques have been developed which have the potential to greatly reduce the amount of data collected by systems while preserving the amount of information obtained. A cost of this efficiency is that a computationally-intensive optimization routine must be used to put the sensed data into a form that a person can interpret. At the same time, machine learning techniques have experienced tremendous growth as well. Machines have demonstrated the ability learn how to effectively perform tasks such as detection and classification at speeds much faster than humanly possible. Our goal in this project was to study the feasibility of using compressive sensing systems "at the edge." That is, how can compressive sensing sensors be deployed such that information is created at the remote sensor rather than sending raw data to a central processing location? Studies were performed to analyze whether machine learning could be done on the compressively sensed data in its raw form. If a machine is performing the task, is it possible to do so without putting the data into a human interpretable form? We show that this is possible for some systems, in particular a compressive sensing snapshot imaging spectrometer. Machine learning tasks were demonstrated to be more effective and more robust to noise when the machine learning algorithm worked on data in its raw form. This system is shown to outperform a traditional spectrometer. Techniques for reducing the complexity of the reconstruction routine were also analyzed. Techniques for such as data regularization, deep neural networks, and matrix completion were studied and shown to have benefits over traditional reconstruction techniques. In this project we showed that compressive sensing sensors are indeed feasible at the edge. As always, sensors and algorithms must be carefully tuned to work in the constrained environment. In this project we developed tools and techniques to enable those analyses.

47 OTHER INSTRUMENTATION↗

Optimal discrimination of M coherent states with a small quantum computer

The ability to distinguish between coherent states optimally plays in important role in the efficient usage of quantum resources for classical communication and sensing applications. While it has been known since the early 1970’s how to optimally distinguish between two coherent states, generalizations to larger sets of coherent states have so far failed to reach optimality. In this work we outline how optimality can be achieved by using a small quantum computer, building on recent proposals for optimal qubit state discrimination with multiple copies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Wave drag as the objective function in transonic fighter wing optimization

The original computational method for determining wave drag in a three dimensional transonic analysis method was replaced by a wave drag formula based on the loss in momentum across an isentropic shock. This formula was used as the objective function in a numerical optimization procedure to reduce the wave drag of a fighter wing at transonic maneuver conditions. The optimization procedure minimized wave drag through modifications to the wing section contours defined by a wing profile shape function. A significant reduction in wave drag was achieved while maintaining a high lift coefficient. Comparisons of the pressure distributions for the initial and optimized wing geometries showed significant reductions in the leading-edge peaks and shock strength across the span.

Phillips, P. S.↗