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 199 records · Page 11

Optimal control of systems with discontinuous differential equations.

In this paper we discuss the problem of verifying and computing optimal controls of systems whose dynamics is governed by differential systems with a discontinuous right-hand side. In our work, we are motivated by optimal control of mechanical systems with Coulomb friction, which exhibit such a right-hand side. Notwithstanding the impressive development of nonsmooth and set-valued analysis, these systems have not been closely studied either computationally or analytically. We show that even when the solution crosses and does not stay on the discontinuity, differentiating the results of a simulation gives gradients that have errors of a size independent of the stepsize. This means that the strategy of 'optimize the discretization' will usually fail for problems of this kind. We approximate the discontinuous right-hand side for the differential equations or inclusions by a smooth right-hand side. For these smoothed approximations, we show that the resulting gradients approach the true gradients provided that the start and end points of the trajectory do not lie on the discontinuity and that Euler's method is used where the step size is 'sufficiently small' in comparison with the smoothing parameter. Numerical results are presented for a crude model of car racing that involves Coulomb friction and slip showing that this approach is practical and can handle problems of moderate complexity.

97 MATHEMATICS AND COMPUTING↗

Towards computational materials design from first principles using alchemical changes and derivatives.

The design of new materials with specific physical, chemical, or biological properties is a central goal of much research in materials and medicinal sciences. Except for the simplest and most restricted cases brute-force computational screening of all possible compounds for interesting properties is beyond any current capacity due to the combinatorial nature of chemical compound space (set of stoichiometries and configurations). Consequently, when it comes to computationally optimizing more complex systems, reliable optimization algorithms must not only trade-off sufficient accuracy and computational speed of the models involved, they must also aim for rapid convergence in terms of number of compounds 'visited'. I will give an overview on recent progress on alchemical first principles paths and gradients in compound space that appear to be promising ingredients for more efficient property optimizations. Specifically, based on molecular grand canonical density functional theory an approach will be presented for the construction of high-dimensional yet analytical property gradients in chemical compound space. Thereafter, applications to molecular HOMO eigenvalues, catalyst design, and other problems and systems shall be discussed.

99 GENERAL AND MISCELLANEOUS↗

Performing aggressive code optimization with an ability to rollback changes made by the aggressive optimizations

Mechanisms for aggressively optimizing computer code are provided. With these mechanisms, a compiler determines an optimization to apply to a portion of source code and determines if the optimization as applied to the portion of source code will result in unsafe optimized code that introduces a new source of exceptions being generated by the optimized code. In response to a determination that the optimization is an unsafe optimization, the compiler generates an aggressively compiled code version, in which the unsafe optimization is applied, and a conservatively compiled code version in which the unsafe optimization is not applied. The compiler stores both versions and provides them for execution. Mechanisms are provided for switching between these versions during execution in the event of a failure of the aggressively compiled code version. Moreover, predictive mechanisms are provided for predicting whether such a failure is likely.

97 MATHEMATICS AND COMPUTING↗

Locally adaptive artificial viscosity strategies for Lagrangian hydrodynamics

To accurately model inviscid flow with shock waves using staggered-grid Lagrangian hydrodynamics, artificial viscosity is introduced to convert kinetic energy into internal energy, thereby providing a mechanism to generate the required entropy increase across shocks. In this paper, we propose a new method for constructing an adaptive, artificial viscosity in the context of one-dimensional, staggered-grid Lagrangian hydrodynamics. Our adaptive, artificial viscosity is defined in terms of two parameters that depend on density locally in a neighborhood around a shock, and hence, vary cell-by-cell. Our methodology is based on building a reference set of pre-computed optimal, globally constant artificial viscosity coefficients for a family of isolated shock test problems. For arbitrary flows, the evaluation of the unknown coefficients is automated by first estimating shock intensity locally, and second computing the corresponding adaptive parameter value via interpolation over the data from the pre-computed reference set of optimal, globally constant coefficient values. To illustrate the performance of our new approach, we compare our results against two existing methods. The first method is a limiter-based approach, which relies on estimating velocity gradients of the flow, and the second method is utilized in several commercial codes. Finally, we demonstrate that our new adaptive methodology produces more accurate results for a variety of tests with propagating shock waves, as well as for the aforementioned family of isolated shock problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational aerodynamics requirements: The future role of the computer and the needs of the aerospace industry

The commercial airplane builder's viewpoint on the important issues involved in the development of improved computational aerodynamics tools such as powerful computers optimized for fluid flow problems is presented. The primary user of computational aerodynamics in a commercial aircraft company is the design engineer who is concerned with solving practical engineering problems. From his viewpoint, the development of program interfaces and pre-and post-processing capability for new computational methods is just as important as the algorithms and machine architecture. As more and more details of the entire flow field are computed, the visibility of the output data becomes a major problem which is then doubled when a design capability is added. The user must be able to see, understand, and interpret the results calculated. Enormous costs are expanded because of the need to work with programs having only primitive user interfaces.

Rubbert, P. E.↗

Robust detection, isolation, and accommodation for sensor failures

Recent advances in multivariable robust control system design are extended to sensor failure, detection, isolation, and accommodation (FDIA) and estimator design. A new concept called threshold selector is introduced. It represents a significant and innovative tool for the analysis and synthesis of FDIA algorithms. Analytical results are obtained for the SISO case to compute optimal thresholds and size of minimum detectable failures, and a computer-aided technique is developed for the multivariable case. The techniques have been applied to sensor FDIA for an aircraft turbine engine control system.

Emami-Naeini, A.↗

Efficient Simulation Budget Allocation for Selecting an Optimal Subset

We consider a class of the subset selection problem in ranking and selection. The objective is to identify the top m out of k designs based on simulated output. Traditional procedures are conservative and inefficient. Using the optimal computing budget allocation framework, we formulate the problem as that of maximizing the probability of correc tly selecting all of the top-m designs subject to a constraint on the total number of samples available. For an approximation of this corre ct selection probability, we derive an asymptotically optimal allocat ion and propose an easy-to-implement heuristic sequential allocation procedure. Numerical experiments indicate that the resulting allocatio ns are superior to other methods in the literature that we tested, and the relative efficiency increases for larger problems. In addition, preliminary numerical results indicate that the proposed new procedur e has the potential to enhance computational efficiency for simulation optimization.

Chen, Chun-Hung↗

New reflective symmetry design capability in the JPL-IDEAS Structure Optimization Program

The JPL-IDEAS antenna structure analysis and design optimization computer program was modified to process half structure models of symmetric structures subjected to arbitrary external static loads, synthesize the performance, and optimize the design of the full structure. Significant savings in computation time and cost (more than 50%) were achieved compared to the cost of full model computer runs. The addition of the new reflective symmetry analysis design capabilities to the IDEAS program allows processing of structure models whose size would otherwise prevent automated design optimization. The new program produced synthesized full model iterative design results identical to those of actual full model program executions at substantially reduced cost, time, and computer storage.

Strain, D.↗

Field Programmable Gate Arrays for Enhancing the Speed and Energy Efficiency of Quantum Dynamics Simulations

We present the first application of field programmable gate arrays (FPGAs) as new, customizable hardware architectures for carrying out fast and energy-efficient quantum dynamics simulations of large chemical/material systems. Instead of tailoring the software to fixed hardware, which is the typical case for writing quantum chemistry code for central processing units (CPUs) and graphics processing units (GPUs), FPGAs allow us to directly customize the underlying hardware (even at the level of specific electrical signals in the circuit) to give a truly optimized computational performance for quantum dynamics calculations. By offloading the most intensive and repetitive calculations onto an FPGA, we show that the computational performance of our real-time electron dynamics calculations can even exceed that of optimized commercial mathematical libraries running on high-performance GPUs. In addition to this impressive computational speedup, we show that FPGAs are immensely energy-efficient and consume 4 times less energy than modern GPU or CPU architectures. These energy savings are a practical and important metric for supercomputing centers (many of which exceed over $1 million in power costs alone), as exascale computing capabilities become more widespread and commonplace. Taken together, the implementation techniques and performance metrics of our study demonstrate that FPGAs could play a promising role in upcoming quantum chemistry and materials science applications, particularly for the acceleration and energy-efficient execution of quantum dynamics calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spur-gear optimization using SPUROPT computer program

A computer program developed for optimizing spur gear designs, SPUROPT, was updated by installing a new subroutine that uses AGMA 908-B89 standards to calculate the J-factor for determining tooth-bending stress. The updated SPUROPT program was then used to optimize a spur gear set for maximum fatigue life, minimum dynamic load, or minimum weight. All calculations were made with constraints on as many as 13 parameters by using three design variables: the number of teeth, diametral pitch, and tooth-face width. Results depended largely on constraints values. When the limiting bending stress was set at a high value, the optimal solution was the highest allowable number of teeth. When the allowable bending stress was lowered, the optimal solution moved toward the fewest number of teeth permitted. Final results were also affected by the amount of transmission error. A lower error permitted a higher number of teeth.

Coe, Harold H.↗

Asymptotic continuation method for trajectory optimization

A continuation method is applied to a singular perturbation parameter to obtain a new numerical method for computing optimal trajectories. This method allows one to use simply calculated reduced order approximations as starting solutions and continue the perturbation parameter until the optimal full-order solution is obtained. The method does not require the calculation of higher order correction terms nor does it require the perturbation parameter to be small - thus, it has potentially superior convergence properties compared to conventional asymptotic expansions when the perturbation parameter is large. A simple trajectory optimization problem is considered to illustrate the method.

Washburn, R. B., Jr.↗

Optimizing Approximate Weighted Matching on Nvidia Kepler K40

Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand generally compute high quality solutions and are amenable to parallelization. In this paper, we present efficient implementations of the current best algorithm for half-approximate weighted matching, the Suitor algorithm, on Nvidia Kepler K-40 platform. We develop four variants of the algorithm that exploit hardware features to address key challenges for a GPU implementation. We also experiment with different combinations of work assigned to a warp. Using an exhaustive set of $269$ inputs, we demonstrate that the new implementation outperforms the previous best GPU algorithm by $10$ to $100\times$ for over $100$ instances, and from $100$ to $1000\times$ for $15$ instances. We also demonstrate up to $20\times$ speedup relative to $2$ threads, and up to $5\times$ relative to $16$ threads on Intel Xeon platform with $16$ cores for the same algorithm. The new algorithms and implementations provided in this paper will have a direct impact on several applications that repeatedly use matching as a key compute kernel. Further, algorithm designs and insights provided in this paper will benefit other researchers implementing graph algorithms on modern GPU architectures.

GPU↗

A scalable design of experiments framework for optimal sensor placement

Here, we present a scalable design of an experiments framework for sensor placement in systems described by partial differential equations (PDEs). In particular, we aim to compute optimal sensor locations by minimizing the uncertainty of parameters estimated from Bayesian inverse problems and where the system. The resulting problem is a computationally intractable mixed-integer nonlinear program constrained by PDEs. We approach this problem with two heuristics used in compressed sensing and optimal control literature: a sparsity-inducing approach and a sum-up rounding approach. We also investigate metrics to guide the design of experiments (the total flow variance and the A-optimal design criterion) and analyze the effect of different noise structures (white and colored). Using an application in natural gas pipelines, we conclude that the sum-up rounding approach approach gives the best results and produces shrinking gaps with increasing mesh resolution. We also observe that convergence for the white noise measurement error case is slower than for the colored noise case. For A-optimal design, the solution is close to a uniform distribution of sensors along the pipeline while for the flow variance design the distribution is unstructured.

42 ENGINEERING↗

An Approach to Reasoning Service Migration in Data and Reasoning Fabric (DRF) Implementation

In this paper we consider service migration problem for Data and Reasoning Fabric (DRF) enabled airspace operations assuming a fixed cloud/edge infrastructure with allocated computing, storage and power resources, where cloud/edge servers, and communication stations are in a wired connected network, while vehicles use a wireless network for communication. The objective is to automatically select the best location for the requested service execution, which achieves minimum cost while satisfying the user quality of service (QoS) and available resources constraints. To this end, estimates of the response time, consumed energy and total cost are defined for each potential compute location. A mixed-integer linear program is then formulated and solved to identify optimal compute locations given QoS constraints, network infrastructure limitations, with worst-case vehicle positioning. The approach is applied to trajectory re-planning use case to avoid a collision with an emergency vehicle in real time.

Air mobility↗

The Sizing and Optimization Language, (SOL): Computer language for design problems

The Sizing and Optimization Language, (SOL), a new high level, special purpose computer language was developed to expedite application of numerical optimization to design problems and to make the process less error prone. SOL utilizes the ADS optimization software and provides a clear, concise syntax for describing an optimization problem, the OPTIMIZE description, which closely parallels the mathematical description of the problem. SOL offers language statements which can be used to model a design mathematically, with subroutines or code logic, and with existing FORTRAN routines. In addition, SOL provides error checking and clear output of the optimization results. Because of these language features, SOL is best suited to model and optimize a design concept when the model consits of mathematical expressions written in SOL. For such cases, SOL's unique syntax and error checking can be fully utilized. SOL is presently available for DEC VAX/VMS systems. A SOL package is available which includes the SOL compiler, runtime library routines, and a SOL reference manual.

Lucas, Stephen H.↗