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,405 records · Page 78

Global Surface Temperature Change and Uncertainties Since 1861

The objective of this talk is to analyze the warming trend and its uncertainties of the global and hemi-spheric surface temperatures. By the method of statistical optimal averaging scheme, the land surface air temperature and sea surface temperature observational data are used to compute the spatial average annual mean surface air temperature. The optimal averaging method is derived from the minimization of the mean square error between the true and estimated averages and uses the empirical orthogonal functions. The method can accurately estimate the errors of the spatial average due to observational gaps and random measurement errors. In addition, quantified are three independent uncertainty factors: urbanization, change of the in situ observational practices and sea surface temperature data corrections. Based on these uncertainties, the best linear fit to annual global surface temperature gives an increase of 0.61 +/- 0.16 C between 1861 and 2000. This lecture will also touch the topics on the impact of global change on nature and environment. as well as the latest assessment methods for the attributions of global change.

Shen, Samuel S. P.↗

Reconciling Scientific Aspirations and Engineering Constraints for a Lunar Mission via Hyperdimensional Interpolation

Virtually every NASA space-exploration mission represents a compromise between the interests of two expert, dedicated, but very different communities: scientists, who want to go quickly to the places that interest them most and spend as much time there as possible conducting sophisticated experiments, and the engineers and designers charged with maximizing the probability that a given mission will be successful and cost-effective. Recent work at NASA's Jet Propulsion Laboratory (JPL) seeks to enhance communication between these two groups, and to help them reconcile their interests, by developing advanced modeling capabilities with which they can analyze the achievement of science goals and objectives against engineering design and operational constraints. The analyses conducted prior to this study have been point-design driven. Each analysis has been of one hypothetical case which addresses the question: Given a set of constraints, how much science can be done? But the constraints imposed by the architecture team-e.g., rover speed, time allowed for extravehicular activity (EVA), number of sites at which science experiments are to be conducted- are all in early development and carry a great deal of uncertainty. Variations can be incorporated into the analysis, and indeed that has been done in sensitivity studies designed to see which constraint variations have the greatest impact on results. But if a very large number of variations can be analyzed all at once, producing a table that includes virtually the entire trade space under consideration, then we have a tool that enables scientists and mission architects to ask the inverse question: For a given desired level of science (or any other objective), what is the range of constraints that would be needed? With this tool, mission architects could determine, for example, what combinations of rover speed, EVA duration, and other constraints produce the desired results. Further, this tool would help them identify which technology-improvement investments would be likely to produce the largest or most important return. However, the number of variations that need to be considered for such analysis quickly balloons to an unwieldy size. If three variations are considered for each of six constraints-a very modest example-there are a total of 243 variations to consider. If it takes 40 minutes to compute each variation, as it does with HURON, our automated optimization system, then it would take 162 hours or nearly 7 days of round-the-clock computing to calculate the results. Adding further constraints or variations exponentially increases the amount of time that is needed.

Weisbin, Charles R.↗

A parallel variable metric optimization algorithm

An algorithm, designed to exploit the parallel computing or vector streaming (pipeline) capabilities of computers is presented. When p is the degree of parallelism, then one cycle of the parallel variable metric algorithm is defined as follows: first, the function and its gradient are computed in parallel at p different values of the independent variable; then the metric is modified by p rank-one corrections; and finally, a single univariant minimization is carried out in the Newton-like direction. Several properties of this algorithm are established. The convergence of the iterates to the solution is proved for a quadratic functional on a real separable Hilbert space. For a finite-dimensional space the convergence is in one cycle when p equals the dimension of the space. Results of numerical experiments indicate that the new algorithm will exploit parallel or pipeline computing capabilities to effect faster convergence than serial techniques.

Straeter, T. A.↗

Resupply Scheduler Program Using Integer Optimization

Resupply Scheduling Modeler (RSM) fully menu-driven computer program using integer programming techniques to determine optimum schedule for replacing components on or before ends of fixed replacement periods. Written to analyze electrical power system on Space Station Freedom, also used to model resupply of almost any system subject to user-defined constraints on resources. Lifetimes of components, assembly schedules, and other constraints taken into account. Written in APL2(R).

Viterna, L. A.↗

Integrated Arrival and Departure Schedule Optimization Under Uncertainty

In terminal airspace, integrating arrivals and departures with shared waypoints provides the potential of improving operational efficiency by allowing direct routes when possible. Incorporating stochastic evaluation as a post-analysis process of deterministic optimization, and imposing a safety buffer in deterministic optimization, are two ways to learn and alleviate the impact of uncertainty and to avoid unexpected outcomes. This work presents a third and direct way to take uncertainty into consideration during the optimization. The impact of uncertainty was incorporated into cost evaluations when searching for the optimal solutions. The controller intervention count was computed using a heuristic model and served as another stochastic cost besides total delay. Costs under uncertainty were evaluated using Monte Carlo simulations. The Pareto fronts that contain a set of solutions were identified and the trade-off between delays and controller intervention count was shown. Solutions that shared similar delays but had different intervention counts were investigated. The results showed that optimization under uncertainty could identify compromise solutions on Pareto fonts, which is better than deterministic optimization with extra safety buffers. It helps decision-makers reduce controller intervention while achieving low delays.

stochastic optimization↗

Integrated analysis and applications

An overview is presented of current research activities which, in a broad context, are focused on the development and verification of integrated structural analysis and optimal design capabilities for advanced aerospace propulsion and power systems. The overview encompasses a variety of subject areas including: (1) composite materials; (2) advanced structural analysis; (3) constitutive modeling; (4) computational simulation; (5) probabilistic analysis; and (6) multidisciplinary optimization. Typical results are presented which illustrate the benefit and utility of the emerging technologies as applied to propulsion and power system structures.

Hopkins, Dale A.↗

Numerical experience with a class of algorithms for nonlinear optimization using inexact function and gradient information

For optimization problems associated with engineering design, parameter estimation, image reconstruction, and other optimization/simulation applications, low accuracy function and gradient values are frequently much less expensive to obtain than high accuracy values. Here, researchers investigate the computational performance of trust region methods for nonlinear optimization when high accuracy evaluations are unavailable or prohibitively expensive, and confirm earlier theoretical predictions when the algorithm is convergent even with relative gradient errors of 0.5 or more. The proper choice of the amount of accuracy to use in function and gradient evaluations can result in orders-of-magnitude savings in computational cost.

Carter, Richard G.↗

Numerical Investigation and Optimization of a Flushwall Injector for Scramjet Applications at Hypervelocity Flow Conditions

An investigation utilizing Reynolds-averaged simulations (RAS) was performed in order to demonstrate the use of design and analysis of computer experiments (DACE) methods in Sandia’s DAKOTA software package for surrogate modeling and optimization. These methods were applied to a flow- path fueled with an interdigitated flushwall injector suitable for scramjet applications at hyper- velocity conditions and ascending along a constant dynamic pressure flight trajectory. The flight Mach number, duct height, spanwise width, and injection angle were the design variables selected to maximize two objective functions: the thrust potential and combustion efficiency. Because the RAS of this case are computationally expensive, surrogate models are used for optimization. To build a surrogate model a RAS database is created. The sequence of the design variables comprising the database were generated using a Latin hypercube sampling (LHS) method. A methodology was also developed to automatically build geometries and generate structured grids for each design point. The ensuing RAS analysis generated the simulation database from which the two objective functions were computed using a one-dimensionalization (1D) of the three-dimensional simulation data. The data were fitted using four surrogate models: an artificial neural network (ANN), a cubic polynomial, a quadratic polynomial, and a Kriging model. Variance-based decomposition showed that both objective functions were primarily driven by changes in the duct height. Multiobjective design optimization was performed for all four surrogate models via a genetic algorithm method. Optimal solutions were obtained at the upper and lower bounds of the flight Mach number range. The Kriging model predicted an optimal solution set that exhibited high values for both objective functions. Additionally, three challenge points were selected to assess the designs on the Pareto fronts. Further sampling among the designs of the Pareto fronts may be required to lower the surrogate model errors and perform more accurate surrogate-model-based optimization.

Shenoy, Rajiv R.↗

Low thrust space vehicle trajectory optimization using regularized variables

Optimizing the trajectory of a low thrust space vehicle usually means solving a nonlinear two point boundary value problem. In general, accuracy requirements necessitate extensive computation times. In celestial mechanics, regularizing transformations of the equations of motion are used to eliminate computational and analytical problems that occur during close approaches to gravitational force centers. It was shown in previous investigations that regularization in the formulation of the trajectory optimization problem may reduce the computation time. In this study, a set of regularized equations describing the optimal trajectory of a continuously thrusting space vehicle is derived. The computational characteristics of the set are investigated and compared to the classical Newtonian unregularized set of equations. The comparison is made for low thrust, minimum time, escape trajectories and numerical calculations of Keplerian orbits. The comparison indicates that in the cases investigated for bad initial guesses of the known boundary values a remarkable reduction in the computation time was achieved. Furthermore, the investigated set of regularized equations shows high numerical stability even for long duration flights and is less sensitive to errors in the guesses of the unknown boundary values.

Schwenzfeger, K. J.↗

A Comparison of Metallic, Composite and Nanocomposite Optimal Transonic Transport Wings

Current and future composite material technologies have the potential to greatly improve the performance of large transport aircraft. However, the coupling between aerodynamics and structures makes it challenging to design optimal flexible wings, and the transonic flight regime requires high fidelity computational models. We address these challenges by solving a series of high-fidelity aerostructural optimization problems that explore the design space for the wing of a large transport aircraft. We consider three different materials: aluminum, carbon-fiber reinforced composites and an hypothetical composite based on carbon nanotubes. The design variables consist of both aerodynamic shape (including span), structural sizing, and ply angle fractions in the case of composites. Pareto fronts with respect to structural weight and fuel burn are generated. The wing performance in each case is optimized subject to stress and buckling constraints. We found that composite wings consistently resulted in lower fuel burn and lower structural weight, and that the carbon nanotube composite did not yield the increase in performance one would expect from a material with such outstanding properties. This indicates that there might be diminishing returns when it comes to the application of advanced materials to wing design, requiring further investigation.

Kennedy, Graeme J.↗

Automated design of spacecraft systems power subsystems

This paper discusses the application of evolutionary computing to a dynamic space vehicle power subsystem resource and performance simulation in a parallel processing environment. Our objective is to demonstrate the feasibility, application and advantage of using evolutionary computation techniques for the early design search and optimization of space systems.

optimzation space designs↗

Optimization Study of the Ames 0.5 Two-Stage Light Gas Gun

There is a need for more faithful simulation of space debris impacts on various space vehicles. Space debris impact velocities can range up to 14 km/sec and conventional two-stage light gas guns with moderately heavy saboted projectiles are limited to launch velocities of 7-8 km/sec. Any increases obtained in the launch velocities will result in more faithful simulations of debris impacts. It would also be valuable to reduce the maximum gun and projectile base pressures and the gun barrel erosion rate. In this paper, the results of a computational fluid dynamics (CFD) study designed to optimize the performance of the NASA Ames 0.5' gun by systematically varying seven gun operating parameters are reported. Particularly beneficial effects were predicted to occur if (1) the piston mass was decreased together with the powder mass and the hydrogen fill pressure and (2) the pump tube length was decreased. The optimum set of changes in gun operating conditions were predicted to produce an increase in muzzle velocity of 0.7-1.0 km/sec, simultaneously with a substantial decrease in gun erosion. Preliminary experimental data have validated the code predictions. Velocities of up to 8.2 km/sec with a 0.475 cm diameter saboted aluminum sphere have been obtained, along with large reductions in gun erosion rates.

Bogdanoff, D. W.↗

General purpose optimization software for engineering design

The author has developed several general purpose optimization programs over the past twenty years. The earlier programs were developed as research codes and served that purpose reasonably well. However, in taking the formal step from research to industrial application programs, several important lessons have been learned. Among these are the importance of clear documentation, immediate user support, and consistent maintenance. Most important has been the issue of providing software that gives a good, or at least acceptable, design at minimum computational cost. Here, the basic issues developing optimization software for industrial applications are outlined and issues of convergence rate, reliability, and relative minima are discussed. Considerable feedback has been received from users, and new software is being developed to respond to identified needs. The basic capabilities of this software are outlined. A major motivation for the development of commercial grade software is ease of use and flexibility, and these issues are discussed with reference to general multidisciplinary applications. It is concluded that design productivity can be significantly enhanced by the more widespread use of optimization as an everyday design tool.

Vanderplaats, G. N.↗

Guidance analysis of the aeroglide plane change maneuver as a turning point problem

The development of guidance approximations for the atmospheric (aeroglide) portion of the minimum fuel, orbital plane change, trajectory optimization problem is described. Asymptotic methods are used to reduce the two point, boundary value, optimization problem to a turning point problem from the bank angle control. The turning point problem solution, which yields an approximate optimal control policy, is given in terms of parabolic cylinder functions, which are tabulated, and integral expressions, which must be numerically computed. Comparisons of the former, over their region of validity, with optimal control solutions show good qualitative agreement. Additional work and analysis is needed to compute the guidance approximation work.

Gracey, Christopher↗

A Parallel Multigrid Solver for Viscous Flows on Anisotropic Structured Grids

This paper presents an efficient parallel multigrid solver for speeding up the computation of a 3-D model that treats the flow of a viscous fluid over a flat plate. The main interest of this simulation lies in exhibiting some basic difficulties that prevent optimal multigrid efficiencies from being achieved. As the computing platform, we have used Coral, a Beowulf-class system based on Intel Pentium processors and equipped with GigaNet cLAN and switched Fast Ethernet networks. Our study not only examines the scalability of the solver but also includes a performance evaluation of Coral where the investigated solver has been used to compare several of its design choices, namely, the interconnection network (GigaNet versus switched Fast-Ethernet) and the node configuration (dual nodes versus single nodes). As a reference, the performance results have been compared with those obtained with the NAS-MG benchmark.

Prieto, Manuel↗

Wing shape optimization for maximum cross-country speed, with mathematical programming

A computer program was developed to calculate numerically the speed and circling polars of an aircraft when the lift and drag characteristics of the wing airfoils are known. The planform of the wing is described by variables which are optimized so that the cross-country speed of the glider is maximum for the particular type of thermal model. Two thermal models are compared and shown that with a greater wing area than now normally used the performance can be increased.

Helwig, G.↗

Chandrasekhar equations and computational algorithms for distributed parameter systems

The Chandrasekhar equations arising in optimal control problems for linear distributed parameter systems are considered. The equations are derived via approximation theory. This approach is used to obtain existence, uniqueness, and strong differentiability of the solutions and provides the basis for a convergent computation scheme for approximating feedback gain operators. A numerical example is presented to illustrate these ideas.

Burns, J. A.↗