Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast algorithm”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

CAS2D: FORTRAN program for nonrotating blade-to-blade, steady, potential transonic cascade flows

An exact, full-potential-equation (FPE) model for the steady, irrotational, homentropic and homoenergetic flow of a compressible, homocompositional, inviscid fluid through two dimensional planar cascades of airfoils was derived, together with its appropriate boundary conditions. A computer program, CAS2D, was developed that numerically solves an artificially time-dependent form of the actual FPE. The governing equation was discretized by using type-dependent, rotated finite differencing and the finite area technique. The flow field was discretized by providing a boundary-fitted, nonuniform computational mesh. The mesh was generated by using a sequence of conforming mapping, nonorthogonal coordinate stretching, and local, isoparametric, bilinear mapping functions. The discretized form of the FPE was solved iteratively by using successive line overrelaxation. The possible isentropic shocks were correctly captured by adding explicitly an artificial viscosity in a conservative form. In addition, a three-level consecutive, mesh refinement feature makes CAS2D a reliable and fast algorithm for the analysis of transonic, two dimensional cascade flows.

Dulikravich, D. S.↗
NASA NTRS1980

Fast Generation of body conforming grids for 3-D

A fast algorithm was developed for accurately generating boundary conforming, three dimensional, consecutively refined, computational grids applicable to arbitrary axial turbomachinery geometry. The method is based on using a single analytic function to generate two dimensional grids on a number of coaxial axisymmetric surfaces positioned between the hub and the shroud. These grids are of the "O" type and are characterized by quasi-orthogonality, geometric periodicity, and an adequate resolution throughout the flowfield. Due to the built in additional nonorthogonal coordinate stretching and shearing, the grid lines leaving the trailing of the blade end at downstream infinity, thus simplifying the numerical treatment of the three dimensional trailing vortex sheet.

Dulikravich, O.↗
NASA NTRS1981

GRID3O: Computer program for fast generation of multilevel, three-dimensional boundary-conforming O-type computational grids

A fast algorithm was developed for accurately generating boundary-conforming, three-dimensional, consecutively refined computational grids applicable to arbitrary wing-body and axial turbomachinery geometries. The method is based on using an analytic function to generate two-dimensional grids on a number of coaxial axisymmetric surfaces positioned between the centerbody and the outer radial boundary. These grids are of the O-type and are characterized by quasi-orthogonality, geometric periodicity, and an adequate resolution throughout the flow field. Because the built-in nonorthogonal coordinate stretching and shearing cause the grid lines leaving the blade or wing trailing edge to end at downstream infinity, the numerical treatment of the three-dimensional trailing vortex sheets is simplified.

Dulikravich, D. S.↗
NASA NTRS1984

Techniques of isophotometry

The expected performance of the Minnesota automated dual-plate scanner (APS) is discussed with regard to photometry, position measurement accuracy, and ability to classify images. In addition, a fast algorithm for calculating image parameters is described.

Ghigo, F. D.↗
NASA NTRS1986

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗
NASA NTRS1986

Orthographic terrain views using data derived from digital elevation models

A fast algorithm for producing three-dimensional orthographic terrain views uses digital elevation data and co-registered imagery. These views are created using projective geometry and are designed for display on high-resolution raster graphics devices. The algorithm's effectiveness is achieved by (1) the implementation of two efficient gray-level interpolation routines that offer the user a choice between speed and smoothness, and (2) a unique visible surface determination procedure based on horizon angles derived from the elevation data set.

Dubayah, R. O.↗
NASA NTRS1988

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗
NASA NTRS1987

IECON '87: Industrial applications of control and simulation; Proceedings of the 1987 International Conference on Industrial Electronics, Control, and Instrumentation, Cambridge, MA, Nov. 3, 4, 1987

Recent advances in control-system design and simulation are discussed in reviews and reports. Among the topics considered are fast algorithms for generating near-optimal binary decision programs, trajectory control of robot manipulators with compensation of load effects via a six-axis force sensor, matrix integrators for real-time simulation, a high-level control language for an autonomous land vehicle, and a practical engineering design method for stable model-reference adaptive systems. Also addressed are the identification and control of flexible-limb robots with unknown loads, adaptive control and robust adaptive control for manipulators with feedforward compensation, adaptive pole-placement controllers with predictive action, variable-structure strategies for motion control, and digital signal-processor-based variable-structure controls.

Hartley, Tom T.↗
NASA NTRS1990

An implicit finite element method for high speed flows

A fast algorithm is presented for constructing continuous lines, consisting of element sides, on general unstructured two-dimensional triangular meshes. The lines must pass through each node of the mesh once and only once. The discussion focuses on the use of these lines in a relaxation method for the solution of the equation system arising from an implicit algorithm for the solution of two-dimensional Euler and Navier-Stokes equations on general unstructured grids. It is also shown that the method can be used for solving three-dimensional Navier-Stokes equations on a grid composed of both structured and unstructured regions.

Hassan, O.↗
NASA NTRS1991

Efficient Computation Of Manipulator Inertia Matrix

Improved method for computation of manipulator inertia matrix developed, based on concept of spatial inertia of composite rigid body. Required for implementation of advanced dynamic-control schemes as well as dynamic simulation of manipulator motion. Motivated by increasing demand for fast algorithms to provide real-time control and simulation capability and, particularly, need for faster-than-real-time simulation capability, required in many anticipated space teleoperation applications.

Fijany, Amir↗
NASA NTRS1991

Exact and approximate solutions to the oblique shock equations for real-time applications

The derivation of exact solutions for determining the characteristics of an oblique shock wave in a supersonic flow is investigated. Specifically, an explicit expression for the oblique shock angle in terms of the free stream Mach number, the centerbody deflection angle, and the ratio of the specific heats, is derived. A simpler approximate solution is obtained and compared to the exact solution. The primary objectives of obtaining these solutions is to provide a fast algorithm that can run in a real time environment.

Hartley, T. T.↗
NASA NTRS1990

Decentralized digital adaptive control of robot motion

A decentralized model reference adaptive scheme is developed for digital control of robot manipulators. The adaptation laws are derived using hyperstability theory, which guarantees asymptotic trajectory tracking despite gross robot parameter variations. The control scheme has a decentralized structure in the sense that each local controller receives only its joint angle measurement to produce its joint torque. The independent joint controllers have simple structures and can be programmed using a very simple and computationally fast algorithm. As a result, the scheme is suitable for real-time motion control.

Tarokh, M.↗
NASA NTRS1992

Estimation of the absolute position of mobile systems by an optoelectronic processor

A method that determine the absolute position of a mobile system with a hybrid optoelectronic processor has been developed. Position estimates are based on an analysis of circular landmarks that are detected by a TV camera attached to the mobile system. The difference between the known shape of the landmark and its image provides the information needed to determine the absolute position of the mobile system. For robust operation, the parameters of the landmark image are extracted at high speeds using an optical processor that performs an optical Hough transform. The coordinates of the mobile system are computed from these parameters in a digital co-processor using fast algorithms. Different sources of position estimation errors have also been analyzed, and consequent algorithms to improve the navigation performance of the mobile system have been developed and evaluated by both computer simulation and experiments.

Feng, Liqiang↗
NASA NTRS1992

Principled halftoning based on human vision models

When models of human vision adequately measure the relative quality of candidate halftonings of an image, the problem of halftoning the image becomes equivalent to the search problem of finding a halftone that optimizes the quality metric. Because of the vast number of possible halftones, and the complexity of image quality measures, this principled approach has usually been put aside in favor of fast algorithms that seem to perform well. We find that the principled approach can lead to a range of useful halftoning algorithms, as we trade off speed for quality by varying the complexity of the quality measure and the thoroughness of the search. High quality halftones can be obtained reasonably quickly, for example, by using as a measure the vector length of the error image filtered by a contrast sensitivity function, and, as the search procedure, the sequential adjustment of individual pixels to improve the quality measure. If computational resources permit, simulated annealing can find nearly optimal solutions.

Mulligan, Jeffrey B.↗
NASA NTRS1993

Generating local addresses and communication sets for data-parallel programs

Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance FORTRAN. We show that, for an array A affinely aligned to a template that is distributed across p processors with a cyclic(k) distribution and a computation involving the regular section A(l:h:s), the local memory access sequence for any processor is characterized by a finite state machine of at most k states. We present fast algorithms for computing the essential information about these state machines, and extend the framework to handle multidimensional arrays. We also show how to generate communication sets using the state machine approach. Performance results show that this solution requires very little run-time overhead and acceptable preprocessing time.

Chatterjee, Siddhartha↗
NASA NTRS1993

Generating local addresses and communication sets for data-parallel programs

Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance Fortran. We show that for an array A affinely aligned to a template that is distributed across p processors with a cyclic(k) distribution, and a computation involving the regular section A, the local memory access sequence for any processor is characterized by a finite state machine of at most k states. We present fast algorithms for computing the essential information about these state machines, and extend the framework to handle multidimensional arrays. We also show how to generate communication sets using the state machine approach. Performance results show that this solution requires very little runtime overhead and acceptable preprocessing time.

Chatterjee, Siddhartha↗
NASA NTRS1992

Reduction of blocking effects for the JPEG baseline image compression standard

Transform coding has been chosen for still image compression in the Joint Photographic Experts Group (JPEG) standard. Although transform coding performs superior to many other image compression methods and has fast algorithms for implementation, it is limited by a blocking effect at low bit rates. The blocking effect is inherent in all nonoverlapping transforms. This paper presents a technique for reducing blocking while remaining compatible with the JPEG standard. Simulations show that the system results in subjective performance improvements, sacrificing only a marginal increase in bit rate.

Zweigle, Gregary C.↗
NASA NTRS1995

SeaWiFS technical report series. Volume 31: Stray light in the SeaWiFS radiometer

Some of the measurements from the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) will not be useful as ocean measurements. For the ocean data set, there are procedures in place to mask the SeaWiFS measurements of clouds and ice. Land measurements will also be masked using a geographic technique based on each measurment's latitude and longitude. Each of these masks involves a source of light much brighter than the ocean. Because of stray light in the SeaWiFS radiometer, light from these bright sources can contaminate ocean measurements located a variable number of pixels away from a bright source. In this document, the sources of stray light in the sensor are examined, and a method is developed for masking measurements near bright targets for stray light effects. In addition, a procedure is proposed for reducing the effects of stray light in the flight data from SeaWiFS. This correction can also reduce the number of pixels masked for stray light. Without these corrections, local area scenes must be masked 10 pixels before and after bright targets in the along-scan direction. The addition of these corrections reduces the along-scan masks to four pixels before and after bright sources. In the along-track direction, the flight data are not corrected, and are masked two pixels before and after. Laboratory measurements have shown that stray light within the instrument changes in a direct ratio to the intensity of the bright source. The measurements have also shown that none of the bands show peculiarities in their stray light response. In other words, the instrument's response is uniform from band to band. The along-scan correction is based on each band's response to a 1 pixel wide bright sources. Since these results are based solely on preflight laboratory measurements, their successful implementation requires compliance with two additional criteria. First, since SeaWiFS has a large data volume, the correction and masking procedures must be such that they can be converted into computationally fast algorithms. Second, they must be shown to operate properly on flight data. The laboratory results, and the corrections and masking procedures that derive from them, should be considered as zeroeth order estimates of the effects that will be found on orbit.

Hooker, Stanford B.↗