Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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 397 records · Page 22

Reentry-Vehicle Shape Optimization Using a Cartesian Adjoint Method and CAD Geometry

A DJOINT solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (e.g., geometric parameters that control the shape). Classic aerodynamic applications of gradient-based optimization include the design of cruise configurations for transonic and supersonic flow, as well as the design of high-lift systems. are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric computer-aided design (CAD). In previous work on Cartesian adjoint solvers, Melvin et al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the two-dimensional Euler equations using a ghost-cell method to enforce the wall boundary conditions. In Refs. 18 and 19, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm were the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The accuracy of the gradient computation was verified using several three-dimensional test cases, which included design variables such as the free stream parameters and the planform shape of an isolated wing. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Factors under consideration include the computation of mesh sensitivities that provide a reliable approximation of the objective function gradient, as well as the computation of surface shape sensitivities based on a direct-CAD interface. We present detailed gradient verification studies and then focus on a shape optimization problem for an Apollo-like reentry vehicle. The goal of the optimization is to enhance the lift-to-drag ratio of the capsule by modifying the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design.

Nemec, Marian↗

Hyperspectral Imager-Tracker

The Hyperspectral Imager-Tracker (HIT) is a technique for visualization and tracking of low-contrast, fast-moving objects. The HIT architecture is based on an innovative and only recently developed concept in imaging optics. This innovative architecture will give the Light Prescriptions Innovators (LPI) HIT the possibility of simultaneously collecting the spectral band images (hyperspectral cube), IR images, and to operate with high-light-gathering power and high magnification for multiple fast- moving objects. Adaptive Spectral Filtering algorithms will efficiently increase the contrast of low-contrast scenes. The most hazardous parts of a space mission are the first stage of a launch and the last 10 kilometers of the landing trajectory. In general, a close watch on spacecraft operation is required at distances up to 70 km. Tracking at such distances is usually associated with the use of radar, but its milliradian angular resolution translates to 100- m spatial resolution at 70-km distance. With sufficient power, radar can track a spacecraft as a whole object, but will not provide detail in the case of an accident, particularly for small debris in the onemeter range, which can only be achieved optically. It will be important to track the debris, which could disintegrate further into more debris, all the way to the ground. Such fragmentation could cause ballistic predictions, based on observations using high-resolution but narrow-field optics for only the first few seconds of the event, to be inaccurate. No optical imager architecture exists to satisfy NASA requirements. The HIT was developed for space vehicle tracking, in-flight inspection, and in the case of an accident, a detailed recording of the event. The system is a combination of five subsystems: (1) a roving fovea telescope with a wide 30 field of regard; (2) narrow, high-resolution fovea field optics; (3) a Coude optics system for telescope output beam stabilization; (4) a hyperspectral-mutispectral imaging assembly; and (5) image analysis software with effective adaptive spectral filtering algorithm for real-time contrast enhancement.

Agurok, Llya↗

Effect of Surface Traffic Count on Taxi Time at Dallas-Fort Worth (DFW) International Airport

As the amount of air traffic increases over the years, most airports simply do not have the means of expanding to handle the intensified traffic on the surface that will ensue. Precise surveillance equipment and automation concepts, as well as advanced surface traffic algorithms are being developed to improve airport efficiency. These surface algorithms require inputs unique to each airport to ensure maximum efficiency, and minimal taxi delay. This study analyzes surface traffic at Dallas-Fort Worth International Airport (DFW) to determine the effect of the number of aircraft on the surface and the amount of stop and go situations they experience to the amount of additional taxi time encountered. If the surface capacity of an airport is known, minimal delay can be accomplished by limiting the number of taxiing aircraft to that capacity. This concept is related to highways, where traffic flow drastically decreases as more cars occupy the road. An attempt to minimize this effect on highways is seen with the use of metering lights at freeway on-ramps. Since the surface traffic at airports is highly regulated, and aircraft are less mobile on the ground, limiting the surface count to a certain number can greatly reduce the amount of additional taxi time encountered, as well as reduce hazardous emissions. This study will also find the regions of an airport that encounter the most additional taxi time when the number of aircraft in that area is increased. This could help surface traffic algorithms avoid congesting that area, or re-route aircraft to different runways when that area reaches its capacity. The relationship between the amount of stop and go situations an aircraft encounters and their effect on the taxi time of that aircraft will also be investigated. This will help to determine the effect of holding an aircraft on the taxiway as opposed to re-routing it. The lesser of the two should be used when developing surface traffic algorithms to further minimize the delay encountered. The fields investigated in this study include taxi time, the number of aircraft on the surface, the number of stop and go situations, and the time stopped for each aircraft. Taxi time is defined as spot to runway for departures, and runway to spot for arrivals. It does not include ramp area taxi time because the ramp area is controlled differently, and surface traffic schedulers do not currently incorporate them. Taxi time is found by finding the difference between take-off time (OFF) and spot crossing time for departures, and spot crossing time and landing time (ON) for arrivals. All surface data was either found directly using the Surface Operations Data Analysis and Adaptation (SODAA), a tool to analyze the Surface Management System (SMS) generated log files, or indirectly from SODAA using Matlab to derive values from SODAA data. The number of aircraft on the surface is found by looping through the ON times, OFF times, and spot times for each aircraft during a particular day. For each departure aircraft, surface counts are taken at its spot crossing and OFF time. The average of these two is used as the surface count for that aircraft. For arrivals, surface counts are taken at its ON time and its spot crossing time. The average of these two is used.

Kistler, Matthew Stephen↗

Solution of linear inequalities

Consistent and inconsistent linear inequalities evaluating speed and efficiency of algorithm for pattern recognition problems

Mengert, P. H.↗

Digital processing of stereoscopic image pairs.

The problem under consideration is concerned with scene analysis during robot navigation on the surface of Mars. In this mode, the world model of the robot must be continuously updated to include sightings of new obstacles and scientific samples. In order to describe the content of a particular scene, it is first necessary to segment it into known objects. One technique for accomplishing this segmentation is by analyzing the pair of images produced by the stereoscopic cameras mounted on the robot. A heuristic method is presented for determining the range for each point in the two-dimensional scene under consideration. The method is conceptually based on a comparison of corresponding points in the left and right images of the stereo pair. However, various heuristics which are adaptive in nature are used to make the algorithm both efficient and accurate. Examples are given of the use of this so-called range picture for the purpose of scene segmentation.

Levine, M. D.↗

Transfer-function-parameter estimation from frequency response data: A FORTRAN program

A FORTRAN computer program designed to fit a linear transfer function model to given frequency response magnitude and phase data is presented. A conjugate gradient search is used that minimizes the integral of the absolute value of the error squared between the model and the data. The search is constrained to insure model stability. A scaling of the model parameters by their own magnitude aids search convergence. Efficient computer algorithms result in a small and fast program suitable for a minicomputer. A sample problem with different model structures and parameter estimates is reported.

Seidel, R. C.↗

Eigenproblem solution of damped structural systems

This article presents an efficient numerical algorithm and a complete listing of the associated computer program, developed for the eigenproblem solution of discrete damped structures, including spinning ones. The numerically stable procedure is based on a combined Sturm sequence and inverse iteration technique, which fully exploits the banded form of the relevant matrices and proves to be most substantially economical when compared to similar existing softwares. Numerical results are presented for representative structures, solved by the present computer program written in FORTRAN V for the JPL UNIVAC 1108 computer.

Gupta, K. K.↗

On several aspects and applications of the multigrid method for solving partial differential equations

Several aspects of multigrid methods are briefly described. The main subjects include the development of very efficient multigrid algorithms for systems of elliptic equations (Cauchy-Riemann, Stokes, Navier-Stokes), as well as the development of control and prediction tools (based on local mode Fourier analysis), used to analyze, check and improve these algorithms. Preliminary research on multigrid algorithms for time dependent parabolic equations is also described. Improvements in existing multigrid processes and algorithms for elliptic equations were studied.

Dinar, N.↗

An information matrix approach for aircraft parameter-insensitive control

The Fisher Information Matrix provides the nucleus of a design procedure for obtaining parameter-insensitive feedback gains in Linear-Quadratic-Gaussian problems. The procedure minimizes a sum of performance and closed-loop sensitivity costs, the latter being related to the information content of the system response. Analytical expressions for the appended cost functional and its gradient with respect to the feedback gains are derived. These derivatives serve as the basis of a computationally efficient iterative algorithm that finds the optimal gains. Application of the technique is made to determine low sensitivity feedback gains for a C-5A wing loading alleviation system that has 15 states and three uncertain parameters.

Kleinman, D. L.↗

The simultaneous inference of stratospheric trace gases with overlapping spectral signatures using limb sounding radiometry

An inversion algorithm has been developed to simultaneously infer the concentrations of two gases with overlapping spectral signatures using limb emission measurements. The algorithm is efficient and provides a solution in two or three iterations. It has been applied in a simulation study to the inference of stratospheric NO2-H2O and HNO3-CF2Cl2. Existing satellite instrumentation was the basis for errors used in the calculations. It is estimated that concentrations of all four gases can be determined with errors of about 20 percent. This assumes an estimated 1980 CF2Cl2 level. Also, other error sources due to contaminant gas, aerosol emission, and the temperature profile must be included to obtain a better estimate of experimental accuracies.

Russell, J. M., III↗

An 'adding' algorithm for the Markov chain formalism for radiation transfer

An adding algorithm is presented, that extends the Markov chain method and considers a preceding calculation as a single state of a new Markov chain. This method takes advantage of the description of the radiation transport as a stochastic process. Successive application of this procedure makes calculation possible for any optical depth without increasing the size of the linear system used. It is determined that the time required for the algorithm is comparable to that for a doubling calculation for homogeneous atmospheres. For an inhomogeneous atmosphere the new method is considerably faster than the standard adding routine. It is concluded that the algorithm is efficient, accurate, and suitable for smaller computers in calculating the diffuse intensity scattered by an inhomogeneous planetary atmosphere.

Esposito, L. W.↗

Grid and metric generation on the assembly of locally bi-quadratic coordinate transformations

The generation of metric coefficients of the coordinate transformation from a generally curved-sided domain boundary to the unit square (cube) is required for efficient solution algorithms in computational fluid mechanics. An algebraic procedure is presented for establishment of these data on the union of arbitrarily selected sub-domains of the global solution domain. A uniformly smooth progression of grid refinement is readily generated, including multiple specification of refined grids for a given macro-element domain discretization. The procedure is illustrated as generally applicable to non-simply connected domains in two and three dimensions.

Baker, A. J.↗

Theoretical study of network design methodologies for the aerial relay system

The aerial relay system network design problem is discussed. A generalized branch and bound based algorithm is developed which can consider a variety of optimization criteria, such as minimum passenger travel time and minimum liner and feeder operating costs. The algorithm, although efficient, is basically useful for small size networks, due to its nature of exponentially increasing computation time with the number of variables.

Rivera, J. M.↗

A search for equilibrium states

An efficient search algorithm is described for the location of equilibrium states in a search set of states which differ from one another only by the choice of pure phases. The algorithm has three important characteristics: (1) it ignores states which have little prospect for being an improved approximation to the true equilibrium state; (2) it avoids states which lead to singular iteration equations; (3) it furnishes a search history which can provide clues to alternative search paths.

Zeleznik, F. J.↗