Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Convex functions”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

On the velocity distribution of ion jets during substorm recovery

The velocity distribution of earthward jetting ions that are observed principally during substorm recovery by satellites at approximately 15-35 earth radii in the magnetotail is quantitatively compared with two different theoretical models - the 'adiabatic deformation' of an initially flowing Maxwellian moving into higher magnetic field strength (model A) and the field-aligned electrostatic acceleration of an initially nonflowing isotropic Maxwellian including adiabatic deformation effects (model B). The assumption is made that the ions are protons or, more generally, that they consist of only one species. It is found that both models can explain the often observed concave-convex shape of isodensity contours of the distribution function.

Birn, J.↗
NASA NTRS1990

Large scale nonlinear numerical optimal control for finite element models of flexible structures

This paper discusses the development of large scale numerical optimal control algorithms for nonlinear systems and their application to finite element models of structures. This work is based on our expansion of the optimal control algorithm (DDP) in the following steps: improvement of convergence for initial policies in non-convex regions, development of a numerically accurate penalty function method approach for constrained DDP problems, and parallel processing on supercomputers. The expanded constrained DDP algorithm was applied to the control of a four-bay, two dimensional truss with 12 soft members, which generates geometric nonlinearities. Using an explicit finite element model to describe the structural system requires 32 state variables and 10,000 time steps. Our numerical results indicate that for constrained or unconstrained structural problems with nonlinear dynamics, the results obtained by our expanded constrained DDP are significantly better than those obtained using linear-quadratic feedback control.

Shoemaker, Christine A.↗
NASA NTRS1992

Recursive optimal pruning with applications to tree structured vector quantizers

A pruning algorithm of Chou et al. (1989) for designing optimal tree structures identifies only those codebooks which lie on the convex hull of the original codebook's operational distortion rate function. The authors introduce a modified version of the original algorithm, which identifies a large number of codebooks having minimum average distortion, under the constraint that, in each step, only modes having no descendents are removed from the tree. All codebooks generated by the original algorithm are also generated by this algorithm. The new algorithm generates a much larger number of codebooks in the middle- and low-rate regions. The additional codebooks permit operation near the codebook's operational distortion rate function without time sharing by choosing from the increased number of available bit rates. Despite the statistical mismatch which occurs when coding data outside the training sequence, these pruned codebooks retain their performance advantage over full search vector quantizers (VQs) for a large range of rates.

Kiang, Shei-Zein↗
NASA NTRS2004

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗
NASA NTRS2002

Comparing a Coevolutionary Genetic Algorithm for Multiobjective Optimization

We present results from a study comparing a recently developed coevolutionary genetic algorithm (CGA) against a set of evolutionary algorithms using a suite of multiobjective optimization benchmarks. The CGA embodies competitive coevolution and employs a simple, straightforward target population representation and fitness calculation based on developmental theory of learning. Because of these properties, setting up the additional population is trivial making implementation no more difficult than using a standard GA. Empirical results using a suite of two-objective test functions indicate that this CGA performs well at finding solutions on convex, nonconvex, discrete, and deceptive Pareto-optimal fronts, while giving respectable results on a nonuniform optimization. On a multimodal Pareto front, the CGA finds a solution that dominates solutions produced by eight other algorithms, yet the CGA has poor coverage across the Pareto front.

Lohn, Jason D.↗
NASA NTRS2014

Applying Workspace Limitations in a Velocity-Controlled Robotic Mechanism

A robotic system includes a robotic mechanism responsive to velocity control signals, and a permissible workspace defined by a convex-polygon boundary. A host machine determines a position of a reference point on the mechanism with respect to the boundary, and includes an algorithm for enforcing the boundary by automatically shaping the velocity control signals as a function of the position, thereby providing smooth and unperturbed operation of the mechanism along the edges and corners of the boundary. The algorithm is suited for application with higher speeds and/or external forces. A host machine includes an algorithm for enforcing the boundary by shaping the velocity control signals as a function of the reference point position, and a hardware module for executing the algorithm. A method for enforcing the convex-polygon boundary is also provided that shapes a velocity control signal via a host machine as a function of the reference point position.

Abdallah, Muhammad E.↗
NASA NTRS1989

CPU timing routines for a CONVEX C220 computer system

The timing routines available on the CONVEX C220 computer system in the Structural Mechanics Division (SMD) at NASA Langley Research Center are examined. The function of the timing routines, the use of the timing routines in sequential, parallel, and vector code, and the interpretation of the results from the timing routines with respect to the CONVEX model of computing are described. The timing routines available on the SMD CONVEX fall into two groups. The first group includes standard timing routines generally available with UNIX 4.3 BSD operating systems, while the second group includes routines unique to the SMD CONVEX. The standard timing routines described in this report are /bin/csh time,/bin/time, etime, and ctime. The routines unique to the SMD CONVEX are getinfo, second, cputime, toc, and a parallel profiling package made up of palprof, palinit, and palsum.

Bynum, Mary Ann↗
NASA NTRS1977

Variational energy principle for compressible, baroclinic flow. 1: First and second variations of total kinetic action

The case of a cold gas in the absence of external force fields is considered. Since the only energy involved is kinetic energy, the total kinetic action (i.e., the space-time integral of the kinetic energy density) should serve as the total free-energy functional in this case, and as such should be a local minimum for all possible fluctuations about stable flow. This conjecture is tested by calculating explicit, manifestly covariant expressions for the first and second variations of the total kinetic action in the context of Lagrangian kinematics. The general question of the correlation between physical stability and the convexity of any action integral that can be interpreted as the total free-energy functional of the flow is discussed and illustrated for the cases of rectillinear and rotating shearing flows.

Schmid, L. A.↗
NASA NTRS1985

First derivatives of flow quantities behind two-dimensional, nonuniform supersonic flow over a convex corner

A method of determining spatial derivatives of flow quantities behind an expansion fan as a function of the curvature of the streamline behind the fan is developed. Taylor series expansions of flow quantities within the fan are used and boundary conditions satisfied to the first and second order so that the curvature of the characteristics in the fan may be determined. A system of linear equations for the spatial derivatives is then developed. An application of the method to shock coalescence including asymmetric effects is described.

Darden, C. M.↗
NASA NTRS1989

First and second order convex approximation strategies in structural optimization

In this paper, various methods based on convex approximation schemes are discussed that have demonstrated strong potential for efficient solution of structural optimization problems. First, the convex linearization method (Conlin) is briefly described, as well as one of its recent generalizations, the method of moving asymptotes (MMA). Both Conlin and MMA can be interpreted as first-order convex approximation methods that attempt to estimate the curvature of the problem functions on the basis of semiempirical rules. Attention is next directed toward methods that use diagonal second derivatives in order to provide a sound basis for building up high-quality explicit approximations of the behavior constraints. In particular, it is shown how second-order information can be effectively used without demanding a prohibitive computational cost. Various first-order and second-order approaches are compared by applying them to simple problems that have a closed form solution.

Fleury, C.↗
NASA NTRS1976

Some existence and sufficient conditions of optimality

The role of the existence and sufficiency conditions in the field of optimal control was briefly described. The existence theorems are discussed for general nonlinear systems. However, the sufficiency conditions pertain to "nearly" linear systems with integral convex costs. Moreover, a brief discussion of linear systems with multiple-cost functions is presented.

Assefi, T.↗
NASA NTRS1979

Satellite drag coefficients calculated from measured distributions of reflected helium atoms

The primary objectives of this study were to obtain the necessary data and develop a calculation procedure that would facilitate predicting the atmospheric-helium contribution to the drag of a satellite having a predominantly convex exterior. Molecular-beam techniques were used to measure, for several incidence angles, the spatial and energy distributions of 7000 m/s helium atoms scattered from a 6061-T6 aluminum plate and an anodized 1235-0 aluminum surface. From these measured distributions, tangential and normal momentum accommodation coefficients were calculated as functions of incidence angle. Using these calculated accommodation coefficients, one can predict drag coefficients for satellites having predominantly convex exteriors. For spherical satellites, drag coefficients of 2.64 and 2.62 were predicted for the subject surfaces.

Liu, S.-M.↗
NASA NTRS1976

Structural optimization via a design space hierarchy

Mathematical programming techniques provide a general approach to automated structural design. An iterative method is proposed in which design is treated as a hierarchy of subproblems, one being locally constrained and the other being locally unconstrained. It is assumed that the design space is locally convex in the case of good initial designs and that the objective and constraint functions are continuous, with continuous first derivatives. A general design algorithm is outlined for finding a move direction which will decrease the value of the objective function while maintaining a feasible design. The case of one-dimensional search in a two-variable design space is discussed. Possible applications are discussed. A major feature of the proposed algorithm is its application to problems which are inherently ill-conditioned, such as design of structures for optimum geometry.

Vanderplaats, G. N.↗
NASA NTRS1990

Global optimization methods for engineering design

The problem is to find a global minimum for the Problem P. Necessary and sufficient conditions are available for local optimality. However, global solution can be assured only under the assumption of convexity of the problem. If the constraint set S is compact and the cost function is continuous on it, existence of a global minimum is guaranteed. However, in view of the fact that no global optimality conditions are available, a global solution can be found only by an exhaustive search to satisfy Inequality. The exhaustive search can be organized in such a way that the entire design space need not be searched for the solution. This way the computational burden is reduced somewhat. It is concluded that zooming algorithm for global optimizations appears to be a good alternative to stochastic methods. More testing is needed; a general, robust, and efficient local minimizer is required. IDESIGN was used in all numerical calculations which is based on a sequential quadratic programming algorithm, and since feasible set keeps on shrinking, a good algorithm to find an initial feasible point is required. Such algorithms need to be developed and evaluated.

Arora, Jasbir S.↗
NASA NTRS1993

Transition operators in electromagnetic-wave diffraction theory. II - Applications to optics

The theory developed by Hahne (1992) for the diffraction of time-harmonic electromagnetic waves from fixed obstacles is briefly summarized and extended. Applications of the theory are considered which comprise, first, a spherical harmonic expansion of the so-called radiation impedance operator in the theory, for a spherical surface, and second, a reconsideration of familiar short-wavelength approximation from the new standpoint, including a derivation of the so-called physical optics method on the basis of quasi-planar approximation to the radiation impedance operator, augmented by the method of stationary phase. The latter includes a rederivation of the geometrical optics approximation for the complete Green's function for the electromagnetic field in the presence of a smooth- and a convex-surfaced perfectly electrically conductive obstacle.

Hahne, G. E.↗
NASA NTRS2003

Icelandic Pseudocraters as Analogs to some Volcanic Cones on Mars

Pseudocraters are rootless vents formed by the interaction of lava flows with surface or near-surface water. This interaction can produce mild explosions and the accumulation of scoria and spatter into small constructs. Pseudocraters in several localities in Iceland were examined in the field and compared to similar appearing features observed on Mars. The Icelandic pseudocrater cones in this study range in size from 6 to 70 m in diameter, have summit craters which range from 2 to 28 m in diameter (many cones lack craters entirely), and have flanks that am either concave- up or convex-up. The size and spacing of Icelandic pseudo-craters might be a function of the availability of water, in which larger, closely spaced features result from efficient lava-water interaction, as suggested by the environments in which the features formed. Possible Martian pseudocrater cones in Amamnis Planitia range in diameter from 30 to 180 m and have craters 12 to 80 m in diameter. A numerical model for volcanic explosions was adapted to study the formation of pseudocraters under terrestrial and Martian conditions. The results suggest that explosions forming Martian cones require significantly less water (calculated masses am less by a factor of 4 to 16) than those forming Icelandic pseudokers, despite their larger sizes, This is attributed to the low gravity and atmospheric pressure in the Mars environment and is consistent with the likely lower abundance of water, which might be present as interstitial ice at shallow depths in the regolith. Locations of potential pseudocraters on Mars at latitudes as low as approximately 8 degrees N, imply the presence of crustal ice stores at the time of their formation.

Greeley, Ronald↗