Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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 325 records · Page 18

Optimization of laminated stacking sequence for buckling load maximization by genetic algorithm

The use of a genetic algorithm to optimize the stacking sequence of a composite laminate for buckling load maximization is studied. Various genetic parameters including the population size, the probability of mutation, and the probability of crossover are optimized by numerical experiments. A new genetic operator - permutation - is proposed and shown to be effective in reducing the cost of the genetic search. Results are obtained for a graphite-epoxy plate, first when only the buckling load is considered, and then when constraints on ply contiguity and strain failure are added. The influence on the genetic search of the penalty parameter enforcing the contiguity constraint is studied. The advantage of the genetic algorithm in producing several near-optimal designs is discussed.

Le Riche, Rodolphe↗

Approximate optimal guidance for the advanced launch system

A real-time guidance scheme for the problem of maximizing the payload into orbit subject to the equations of motion for a rocket over a spherical, non-rotating earth is presented. An approximate optimal launch guidance law is developed based upon an asymptotic expansion of the Hamilton - Jacobi - Bellman or dynamic programming equation. The expansion is performed in terms of a small parameter, which is used to separate the dynamics of the problem into primary and perturbation dynamics. For the zeroth-order problem the small parameter is set to zero and a closed-form solution to the zeroth-order expansion term of Hamilton - Jacobi - Bellman equation is obtained. Higher-order terms of the expansion include the effects of the neglected perturbation dynamics. These higher-order terms are determined from the solution of first-order linear partial differential equations requiring only the evaluation of quadratures. This technique is preferred as a real-time, on-line guidance scheme to alternative numerical iterative optimization schemes because of the unreliable convergence properties of these iterative guidance schemes and because the quadratures needed for the approximate optimal guidance law can be performed rapidly and by parallel processing. Even if the approximate solution is not nearly optimal, when using this technique the zeroth-order solution always provides a path which satisfies the terminal constraints. Results for two-degree-of-freedom simulations are presented for the simplified problem of flight in the equatorial plane and compared to the guidance scheme generated by the shooting method which is an iterative second-order technique.

Feeley, T. S.↗

A multiple-impulse function for orbital transfer and its derivatives

A multiple-impulse function is represented as a sequence of single-impulse functions. The single-impulse transfer which yields the velocity change required to transfer from a specified initial orbit to a partially specified final orbit is developed. Analytic derivatives of the function are obtained for use in optimization techniques. A four-impulse transfer is outlined. The analytic derivatives may allow more efficient optimization than numerical derivatives do.

Kibler, J. F.↗

Measurement updating using the U-D factorization

A new mechanization of the Kalman updating algorithm based on a U-D factorization of the estimate error covariance is introduced. Efficient and stable updating recursions are developed for the unit upper triangular factor U and the diagonal factor D, treating only the parameter estimation problem. Properties of the factorization update performed here include efficient one point at a time processing that requires little more computation than the optimal but numerically unstable conventional Kalman measurement update algorithm, and stability that compares with the square root filter.

Bierman, G. J.↗

Inversion of vegetation canopy reflectance models for estimating agronomic variables. I - Problem definition and initial results using the Suits model

An important but relatively uninvestigated problem in remote sensing is the inversion of vegetative canopy reflectance models to obtain agrophysical parameters, given measured reflectances. The problem is here formally defined and its solution outlined. Numerical nonlinear optimization techniques are used to implement this inversion to obtain the leaf area index using Suits' canopy reflectance model. The results for a variety of cases indicate that this can be done successfully using infrared reflectances at different views or azimuth angles or a combination thereof. The other parameters of the model must be known, although reasonable measurement errors can be tolerated without seriously degrading the accuracy of the inversion. The application of the technique to ground based remote-sensing experiments is potentially useful, but is limited to the degree to which the canopy reflectance model can accurately predict observed reflectances.

Goel, N.↗

A study of methods to predict and measure the transmission of sound through the walls of light aircraft. Numerical method for analyzing the optimal performance of active noise controllers

An optimal active noise controller is formulated and analyzed for three different active noise control problems. The first problem formulated is the active control of enclosed or partially enclosed harmonic sound fields where the noise source strengths and enclosure boundary description are known. The enclosure boundary is described by either pressure, velocity, or impedance boundary conditions. The second problem formulated is the active control of the free field power radiated from a distributed noise source with a known time harmonic surface velocity. The third problem formulated is the active control of enclosed or partially enclosed harmonic sound field where the noise source strengths of enclosure boundary description may not be known. All three formulations are derived using an indirect boundary element technique. Formulation and verification of an indirect boundary element method is presented. The active noise controller formulations for enclosures are capable of analyzing systems with generalized enclosure shapes, point noise sources, and/or locally reacting impedance boundary conditions. For each formulation, representative results of optimal active noise controller case studies are presented, and some general conclusions are drawn.

Mollo, Christopher G.↗

Chebyshev polynomials are not always optimal

The problem is that of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. It is shown that this is not true in general. Moreover, sufficient conditions are derived which guarantee that Chebyshev polynomials are optimal. Some numerical examples are also presented.

Fischer, Bernd↗

Guidance algorithms for a free-flying space robot

Robotics is a promising technology for assembly, servicing, and maintenance of platforms in space. Several aspects of planning and guidance for telesupervised and fully autonomous robotic servicers are investigated. Guidance algorithms for proximity operation of a free flyer are described. Numeric trajectory optimization is combined with artificial intelligence based obstacle avoidance. An initial algorithm and the results of its simulating platform servicing scenario are discussed. A second algorithm experiment is then proposed.

Brindle, A. F.↗

Optimization methods for passive damper placement and tuning

The effectiveness of viscous elements in introducing damping in a structure is a function of several variables, including their number, their location in the structure, and their physical properties. In this paper several optimization problems are posed to optimize these variables. The paper investigates various metrics to define the optimization problem, and compares the damping profiles that are obtained. Both discrete and continuous optimization problems are formulated and solved, corresponding, respectively, to the problems of placement of damping elements and to the tuning of their parameters. The paper particularly emphasizes techniques to make feasible the large scale problems resulting from the optimization formulations. Numerical results involving a lightly damped tested structure are presented.

Milman, M. H.↗

Image segmentation using fuzzy LVQ clustering networks

In this note we formulate image segmentation as a clustering problem. Feature vectors extracted from a raw image are clustered into subregions, thereby segmenting the image. A fuzzy generalization of a Kohonen learning vector quantization (LVQ) which integrates the Fuzzy c-Means (FCM) model with the learning rate and updating strategies of the LVQ is used for this task. This network, which segments images in an unsupervised manner, is thus related to the FCM optimization problem. Numerical examples on photographic and magnetic resonance images are given to illustrate this approach to image segmentation.

Tsao, Eric Chen-Kuo↗

Computational issues in optimal tuning and placement of passive dampers

The effectiveness of viscous elements in introducing damping in a structure is a function of several variables including their number, their location in the structure, and their physical properties. In this paper, the optimal damper placement and tuning problem is posed to optimize these variables. Both discrete and continuous optimization problems are formulated and solved corresponding, respectively, to the problems of placement of passive elements and to the tuning of their parameters. The paper particularly emphasizes the critical computational issues resulting from the optimization formulations. Numerical results involving a lightly damped testbed structure are presented.

Chu, C. C.↗

Low-Storage, Explicit Runge-Kutta Schemes for the Compressible Navier-Stokes Equations

The derivation of storage explicit Runge-Kutta (ERK) schemes has been performed in the context of integrating the compressible Navier-Stokes equations via direct numerical simulation. Optimization of ERK methods is done across the broad range of properties, such as stability and accuracy efficiency, linear and nonlinear stability, error control reliability, step change stability, and dissipation/dispersion accuracy, subject to varying degrees of memory economization. Following van der Houwen and Wray, 16 ERK pairs are presented using from two to five registers of memory per equation, per grid point and having accuracies from third- to fifth-order. Methods have been assessed using the differential equation testing code DETEST, and with the 1D wave equation. Two of the methods have been applied to the DNS of a compressible jet as well as methane-air and hydrogen-air flames. Derived 3(2) and 4(3) pairs are competitive with existing full-storage methods. Although a substantial efficiency penalty accompanies use of two- and three-register, fifth-order methods, the best contemporary full-storage methods can be pearl), matched while still saving two to three registers of memory.

Kennedy, Chistopher A.↗

Discontinuous dual-primal mixed finite elements for elliptic problems

We propose a novel discontinuous mixed finite element formulation for the solution of second-order elliptic problems. Fully discontinuous piecewise polynomial finite element spaces are used for the trial and test functions. The discontinuous nature of the test functions at the element interfaces allows to introduce new boundary unknowns that, on the one hand enforce the weak continuity of the trial functions, and on the other avoid the need to define a priori algorithmic fluxes as in standard discontinuous Galerkin methods. Static condensation is performed at the element level, leading to a solution procedure based on the sole interface unknowns. The resulting family of discontinuous dual-primal mixed finite element methods is presented in the one and two-dimensional cases. In the one-dimensional case, we show the equivalence of the method with implicit Runge-Kutta schemes of the collocation type exhibiting optimal behavior. Numerical experiments in one and two dimensions demonstrate the order accuracy of the new method, confirming the results of the analysis.

Bottasso, Carlo L.↗

Simulation of Propellant Loading System Senior Design Implement in Computer Algorithm

Propellant loading from the Storage Tank to the External Tank is one of the very important and time consuming pre-launch ground operations for the launch vehicle. The propellant loading system is a complex integrated system involving many physical components such as the storage tank filled with cryogenic fluid at a very low temperature, the long pipe line connecting the storage tank with the external tank, the external tank along with the flare stack, and vent systems for releasing the excess fuel. Some of the very important parameters useful for design purpose are the prediction of pre-chill time, loading time, amount of fuel lost, the maximum pressure rise etc. The physics involved for mathematical modeling is quite complex due to the fact the process is unsteady, there is phase change as some of the fuel changes from liquid to gas state, then conjugate heat transfer in the pipe walls as well as between solid-to-fluid region. The simulation is very tedious and time consuming too. So overall, this is a complex system and the objective of the work is student's involvement and work in the parametric study and optimization of numerical modeling towards the design of such system. The students have to first become familiar and understand the physical process, the related mathematics and the numerical algorithm. The work involves exploring (i) improved algorithm to make the transient simulation computationally effective (reduced CPU time) and (ii) Parametric study to evaluate design parameters by changing the operational conditions

Bandyopadhyay, Alak↗