Search NASA⌕ Search

SEARCH · Search NASA

Results for “Value function”

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 37 records · Page 2

Design of a recursive vector processor using polynomial splines

The problem of obtaining smoothed estimates of function values, particularly their derivatives, from a finite set of inaccurate measurements is considered. A recursive two-dimensional vector processor is introduced as an approximation to the nonrecursive constrained least-squares estimation. Here, piecewise bicubic Hermite polynomials are extensively used as approximating functions, and the smoothing integral is converted to a discrete quadratic form. This makes it possible to convert the problem of fitting an approximating function to one of estimating the function values and derivatives at the nodes.

Kim, C. S.↗

On Optimal Control of Non-Autonomous Switched Systems with a Fixed Mode Sequence

We consider differentiability with respect to the switch times of the value function of an optimal control problem for a non-autonomous switched system. The control variables are the switch times between the modes and the input in each mode. We provide a method to compute the derivative of the cost function given a nominal input. Then, we view the optimal control problem as a parametrized optimization problem in which the switch times are the parameters and the optimization is over the set of feasible inputs of each mode. From this point of view, we provide conditions under which the continuity and differentiability of the optimal value function, that is the cost function optimized over the inputs, can be guaranteed.

Kamgarpour, Maryam↗

Multidisciplinary design optimization using genetic algorithms

Multidisciplinary design optimization (MDO) is an important step in the conceptual design and evaluation of launch vehicles since it can have a significant impact on performance and life cycle cost. The objective is to search the system design space to determine values of design variables that optimize the performance characteristic subject to system constraints. Gradient-based optimization routines have been used extensively for aerospace design optimization. However, one limitation of gradient based optimizers is their need for gradient information. Therefore, design problems which include discrete variables can not be studied. Such problems are common in launch vehicle design. For example, the number of engines and material choices must be integer values or assume only a few discrete values. In this study, genetic algorithms are investigated as an approach to MDO problems involving discrete variables and discontinuous domains. Optimization by genetic algorithms (GA) uses a search procedure which is fundamentally different from those gradient based methods. Genetic algorithms seek to find good solutions in an efficient and timely manner rather than finding the best solution. GA are designed to mimic evolutionary selection. A population of candidate designs is evaluated at each iteration, and each individual's probability of reproduction (existence in the next generation) depends on its fitness value (related to the value of the objective function). Progress toward the optimum is achieved by the crossover and mutation operations. GA is attractive since it uses only objective function values in the search process, so gradient calculations are avoided. Hence, GA are able to deal with discrete variables. Studies report success in the use of GA for aircraft design optimization studies, trajectory analysis, space structure design and control systems design. In these studies reliable convergence was achieved, but the number of function evaluations was large compared with efficient gradient methods. Applicaiton of GA is underway for a cost optimization study for a launch-vehicle fuel-tank and structural design of a wing. The strengths and limitations of GA for launch vehicle design optimization is studied.

Unal, Resit↗

Mariner 10 mission analysis - Application of a black art

A major accomplishment of the mission analysis performed for Mariner 10 was the selection of a trajectory which optimized science return from the mission. The analysis utilized simple, unweighted 'science value functions' which allowed the relative values of each candidate trajectory, for each of the seven science experiments, to be calculated. A total relative value for each trajectory was determined by a simple averaging process and sensitivities were revealed by multiplying individual values. This showed a clear scientific preference for launching in early November and was used to support deferral of the launch from early October to November 3, 1973.

Shirley, D. L.↗

Finite difference grid generation by multivariate blending function interpolation

The General Interpolants Method (GIM) code which solves the multidimensional Navier-Stokes equations for arbitrary geometric domains is described. The geometry module in the GIM code generates two and three dimensional grids over specified flow regimes, establishes boundary condition information and computes finite difference analogs for use in the GIM code numerical solution module. The technique can be classified as an algebraic equation approach. The geometry package uses multivariate blending function interpolation of vector-values functions which define the shapes of the edges and surfaces bounding the flow domain. By employing blending functions which conform to the cardinality conditions the flow domain may be mapped onto a unit square (2-D) or unit cube (3-D), thus producing an intrinsic coordinate system for the region of interest. The intrinsic coordinate system facilitates grid spacing control to allow for optimum distribution of nodes in the flow domain.

Anderson, P. G.↗

Six-degree-of-freedom aircraft simulation with mixed-data structure using the applied dynamics simulation language, ADSIM

A realistic simulation of an aircraft in the flight using the AD 100 digital computer is presented. The implementation of three model features is specifically discussed: (1) a large aerodynamic data base (130,00 function values) which is evaluated using function interpolation to obtain the aerodynamic coefficients; (2) an option to trim the aircraft in longitudinal flight; and (3) a flight control system which includes a digital controller. Since the model includes a digital controller the simulation implements not only continuous time equations but also discrete time equations, thus the model has a mixed-data structure.

Savaglio, Clare↗

Three-dimensional potential flows from functions of a 3D complex variable

Potential, or ideal, flow velocities can be found from the gradient of an harmonic function. An ordinary complex valued analytic function can be written as the sum of two real valued functions, both of which are harmonic. Thus, 2D complex valued functions serve as a source of functions that describe two-dimensional potential flows. However, this use of complex variables has been limited to two-dimensions. Recently, a new system of three-dimensional complex variables has been developed at the NASA Ames Research Center. As a step toward application of this theory to the analysis of 3D potential flow, several functions of a three-dimensional complex variable have been investigated. The results for two such functions, the 3D exponential and 3D logarithm, are presented in this paper. Potential flows found from these functions are investigated. Important characteristics of these flows fields are noted.

Kelly, Patrick↗

AutoClass: A Bayesian Approach to Classification

We describe a Bayesian approach to the untutored discovery of classes in a set of cases, sometimes called finite mixture separation or clustering. The main difference between clustering and our approach is that we search for the "best" set of class descriptions rather than grouping the cases themselves. We describe our classes in terms of a probability distribution or density function, and the locally maximal posterior probability valued function parameters. We rate our classifications with an approximate joint probability of the data and functional form, marginalizing over the parameters. Approximation is necessitated by the computational complexity of the joint probability. Thus, we marginalize w.r.t. local maxima in the parameter space. We discuss the rationale behind our approach to classification. We give the mathematical development for the basic mixture model and describe the approximations needed for computational tractability. We instantiate the basic model with the discrete Dirichlet distribution and multivariant Gaussian density likelihoods. Then we show some results for both constructed and actual data.

Stutz, John↗

Improved mapping of radio sources from VLBI data by least-square fit

A method is described for producing improved mapping of radio sources from Very Long Base Interferometry (VLBI) data. The method described is more direct than existing Fourier methods, is often more accurate, and runs at least as fast. The visibility data is modeled here, as in existing methods, as a function of the unknown brightness distribution and the unknown antenna gains and phases. These unknowns are chosen so that the resulting function values are as near as possible to the observed values. If researchers use the radio mapping source deviation to measure the closeness of this fit to the observed values, they are led to the problem of minimizing a certain function of all the unknown parameters. This minimization problem cannot be solved directly, but it can be attacked by iterative methods which we show converge automatically to the minimum with no user intervention. The resulting brightness distribution will furnish the best fit to the data among all brightness distributions of given resolution.

Rodemich, E. R.↗

Numerical Optimization Using Computer Experiments

Engineering design optimization often gives rise to problems in which expensive objective functions are minimized by derivative-free methods. We propose a method for solving such problems that synthesizes ideas from the numerical optimization and computer experiment literatures. Our approach relies on kriging known function values to construct a sequence of surrogate models of the objective function that are used to guide a grid search for a minimizer. Results from numerical experiments on a standard test problem are presented.

Trosset, Michael W.↗

Beta distributions: A computer program for probabilities and fractile points

A beta distribution is specified by range parameters a b, and two shape parameters alpha and beta 0. The computer program presented calculates any desired probability and/or fractile point for specified values of a, b, alpha, and beta. This program additionally computes gamma function values for integer and noninteger arguments.

Brownlow, J. D.↗

Transition operators in acoustic-wave diffraction theory. I - General theory. II - Short-wavelength behavior, dominant singularities of Zk0 and Zk0 exp -1

A formal theory of the scattering of time-harmonic acoustic scalar waves from impenetrable, immobile obstacles is established. The time-independent formal scattering theory of nonrelativistic quantum mechanics, in particular the theory of the complete Green's function and the transition (T) operator, provides the model. The quantum-mechanical approach is modified to allow the treatment of acoustic-wave scattering with imposed boundary conditions of impedance type on the surface (delta-Omega) of an impenetrable obstacle. With k0 as the free-space wavenumber of the signal, a simplified expression is obtained for the k0-dependent T operator for a general case of homogeneous impedance boundary conditions for the acoustic wave on delta-Omega. All the nonelementary operators entering the expression for the T operator are formally simple rational algebraic functions of a certain invertible linear radiation impedance operator which maps any sufficiently well-behaved complex-valued function on delta-Omega into another such function on delta-Omega. In the subsequent study, the short-wavelength and the long-wavelength behavior of the radiation impedance operator and its inverse (the 'radiation admittance' operator) as two-point kernels on a smooth delta-Omega are studied for pairs of points that are close together.

Hahne, G. E.↗

An Active Subspace Method for Accelerating Convergence in Delaunay-Based Optimization via Dimension Reduction

Delaunay-based derivative-free optimization, ∆DOGS, is an efficient and provably-convergent global optimization method for the problems which has computationally expensive objection function and the analytical expression for the objective function is not available. ∆-DOGS is a novel optimization scheme in the family of response surface methods (RSMs); however, it suffers from the curse of dimensionality since the computational cost increases dramatically as the number of design parameters increases. As a result, the number of design parameters in ∆-DOGS algorithm is relatively low (n.10). To avoid such problems, this paper proposes a combination of derivative-free optimization, seeking the global minimizer of an expensive and nonconvex objective function f(x) and active subspace method, detecting the directions of the most variability using evaluations of the gradient. The contribution of other directions to the objective function is bounded by a sufficiently small constant. This new algorithm iteratively applied Delaunay-based derivative-free optimization to seek the minimizer on the d-dimensional active subspace that has most function variation. Inverse mapping is needed to project data from active subspace to full-model for evaluating function values. This task is overcome by solving an inequality constrained problem that curves the response surface of the objective function. The test results show that this strategy is effective on a handful of optimization problems.

Bewley, Thomas R.↗

Extinction-to-Backscatter Ratios of Lofted Aerosol Layers Observed During the First Three Months of CALIPSO Measurements

Case studies from the first three months of the Cloud and Aerosol Lidar and Infrared Pathfinder Spaceborne Observations (CALIPSO) measurements of lofted aerosol layers are analyzed using transmittance [Young, 1995] and two-wavelength algorithms [Vaughan et al., 2004] to determine the aerosol extinction-to-backscatter ratios at 532 and 1064 nm. The transmittance method requires clear air below the layer so that the transmittance through the layer can be determined. Suitable scenes are selected from the browse images and clear air below features is identified by low 532 nm backscatter signal and confirmed by low depolarization and color ratios. The transmittance and two-wavelength techniques are applied to a number of lofted layers and the extinction-to-backscatter ratios are compared with values obtained from the CALIPSO aerosol models [Omar et al., 2004]. The results obtained from these studies are used to adjust the aerosol models and develop observations based extinction-to-backscatter ratio look-up tables and phase functions. Values obtained by these techniques are compared to Sa determinations using other independent methods with a goal of developing probability distribution functions of aerosol type-specific extinction to backscatter ratios. In particular, the results are compared to values determined directly by the High Spectral Resolution Lidar (HSRL) during the CALIPSO CloudSat Validation Experiments (CCVEX) and Sa determined by the application of the two-wavelength lidar Constrained Ratio Aerosol Model-fit (CRAM) retrieval approach [Cattrall et al., 2005; Reagan et al., 2004] to the HSRL data. The results are also compared to values derived using the empirical relationship between the multiple-scattering fraction and the linear depolarization ratio by using Monte Carlo simulations of water clouds [Hu et al., 2006].

Omar, Ali H.↗

System trades for the SEOS telescope

The Synchronous Earth Observation Satellite (SEOS) is a geostationary system which provides unique possibilities for earth surveillance. Questions of SEOS applications are considered, taking into account the employment of the Large Earth Survey Telescope. Aspects of performance and costs are examined. The generation of a value function in connection with a quantitative ranking of the applications is discussed along with an analysis performed to determine those parameter values which will maximize mission performance capability at given levels of system cost.

Ritter, M.↗

Diminiode thermionic conversion with 111-iridium electrodes

Preliminary data indicating thermionic-conversion potentialities for a 111-iridium emitter and collector spaced 0.2 mm apart are presented. These results comprise output densities of current and of power as functions of voltage for three sets of emitter, collector, and reservoir temperatures: 1553, 944, 561 K; 1605, 898, 533 K; and 1656, 1028, 586 K. For the 1605 K evaluation, estimates produced work-function values of 2.22 eV for the emitter and 1.63 eV for the collector with a 2.0-eV barrier index (collector work function plus interelectrode voltage drop) corresponding to the maximum output of 5.5 W/sq cm at 0.24 volt. The current, voltage curve for the 1656 K 111-iridium diminiode yields a 6.2 W/sq cm maximum at 0.25 volt and is comparable with the 1700 K envelope for a diode with an etched-rhenium emitter and a 0.025-mm electrode gap made by TECO and evaluated by NASA.

Koeger, E. W.↗

Equilibrium fluid interface behavior under low- and zero-gravity conditions

We describe here some of our recent mathematical work, which forms a basis for the Interface Configuration Experiment scheduled for USML-2. The work relates to the design of apparatus that exploits microgravity conditions for accurate determination of contact angle. The underlying motivation for the procedures rests on a discontinuous dependence of the capillary free surface interface S on the contact angle gamma, in a cylindrical capillary tube whose section (base) omega contains a protruding corner with opening angle 2 alpha. Specifically, in a gravity-free environment, omega can be chosen so that, for all sufficiently large fluid volume, the height of S is uniquely determined as a (single-valued) function mu(x,y) entirely covering the base; the height mu is bounded over omega uniformly in gamma throughout the range absolute value of (gamma -(pion/2)) less than or equal to alpha, while for absolute value of (gamma - (pion/2)) greater than alpha fluid will necessarily move to the corner and uncover the base, rising to infinity (or falling to negative infinity) at the vertex, regardless of volume. We mention here only that procedures based on the phenomenon promise excellent accuracy when gamma is close pion/2 but may be subject to experimental error when gamma is close to zero (orpion), as the 'singular' part of the domain over which the fluid accumulates (or disappears) when a critical angle gamma theta is crossed then becomes very small and may be difficult to observe. We ignore the trivial case gamma is equal to pion/2 (planar free surface), to simplify the discussion.

Concus, Paul↗

A mesh gradient technique for numerical optimization

A class of successive-improvement optimization methods in which directions of descent are defined in the state space along each trial trajectory are considered. The given problem is first decomposed into two discrete levels by imposing mesh points. Level 1 consists of running optimal subarcs between each successive pair of mesh points. For normal systems, these optimal two-point boundary value problems can be solved by following a routine prescription if the mesh spacing is sufficiently close. A spacing criterion is given. Under appropriate conditions, the criterion value depends only on the coordinates of the mesh points, and its gradient with respect to those coordinates may be defined by interpreting the adjoint variables as partial derivatives of the criterion value function. In level 2, the gradient data is used to generate improvement steps or search directions in the state space which satisfy the boundary values and constraints of the given problem.

Willis, E. A., Jr.↗