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 487 records · Page 27

Geometric dilution of precision in Global Positioning System navigation

The evaluation of the GPS navigation performance is essentially equivalent to the computation of the diagonal terms of the geometric dilution of precision (GDOP) matrix. Certain theoretical results concerning the general properties of the GDOP matrix are obtained. An efficient algorithm for the computation of the GDOP matrix and the navigation performance index is given; and applications of the results are illustrated by numerical examples.

Fang, B. T.↗

Development of advanced acreage estimation methods

The development of an accurate and efficient algorithm for analyzing the structure of MSS data, the application of the Akaiki information criterion to mixture models, and a research plan to delineate some of the technical issues and associated tasks in the area of rice scene radiation characterization are discussed. The AMOEBA clustering algorithm is refined and documented.

Guseman, L. F., Jr.↗

Texture functions in image analysis: A computationally efficient solution

A computationally efficient means for calculating texture measurements from digital images by use of the co-occurrence technique is presented. The calculation of the statistical descriptors of image texture and a solution that circumvents the need for calculating and storing a co-occurrence matrix are discussed. The results show that existing efficient algorithms for calculating sums, sums of squares, and cross products can be used to compute complex co-occurrence relationships directly from the digital image input.

Cox, S. C.↗

A two step linear statistical technique using leaps and bounds procedure for retrieval of geophysical parameters from microwave radiometric data

A linear statistical technique using a 'leaps and bounds' procedure (Furnival and Wilson, 1974) is developed for retrieving geophysical parameters from remote measurements. It is used for retrieving sea surface temperatures from the Scaning Multichannel Microwave Radiometer (SMMR) on Seasat. The technique uses an efficient algorithm to select the best fixed-size subset of the 10 SMMR channels for linearly retrieving a given geophysical parameter. The 5-channel subset (6.6V, 6.6H 10H, 18V, 21H), where V and H refer to, respectively, the vertical and horizontal polarizations and the numbers are the channel frequencies in gigahertz, gives the minimum rms error in estimating the sea surface temperature. A comparison with ground truth indicates that the algorithm infers the temperature with an rms accuracy of better than 1.5 K under most environmental conditions. A quality control procedure which is seen as holding promise for further improving the accuracy is proposed.

Kakar, R. K.↗

Automated preprocessing of spaceborne SAR data

An efficient algorithm has been developed for estimation of the echo phase delay in spaceborne synthetic aperture radar (SAR) data. This algorithm utilizes the spacecraft ephemeris data and the radar echo data to produce estimates of two parameters: (1) the centroid of the Doppler frequency spectrum f(d) and (2) the Doppler frequency rate. Results are presented from tests conducted with Seasat SAR data. The test data indicates that estimation accuracies of 3 Hz for f(d) and 0.3 Hz/sec for the Doppler frequency rate are attainable. The clutterlock and autofocus techniques used for estimation of f(d) and the Doppler frequency rate, respectively are discussed and the algorithm developed for optimal implementation of these techniques is presented.

Curlander, J. C.↗

Model development and statistical investigation of turbine blade mistuning

This paper discusses the development of an efficient algorithm which calculates the individual blade response of a bladed turbine disk, the subsequent statistical investigation to establish mistuning dependencies, and procedures which reduce the increase in blade amplitudes caused by mistuning.

Griffin, J. H.↗

Rectification of single and multiple frames of satellite scanner imagery using points and edges as control

Rectification of single and overlapping multiple scanner frames produced by such satellite-borne scanners as the LANDSAT MSS was carried out using a newly developed comprehensive parametric model. Tests with both simulated and real image data demonstrate conclusively that this model in general is superior to the widely used polynomial model, and that the simultaneous rectification of overlapping frames using least squares techniques yields a high accuracy than sngle frame rectification due to the inclusion of tie points between the image frames. Used to control, edges or lines, whic are much more likely to be found in images, can replace conventional control points and can easily be implemented into the least squares approach. An efficient algorithm for findng corresponding points in image paris was developed which can be used for determining tie points between image frames and thus increase the ecnomy of the whole rectification procedure.

Paderes, F. C., Jr.↗

Simulation of time-control procedures for the advanced air traffic control system

The problem of mixing four-dimensional (4D) equipped aircraft - aircraft equipped with on-board guidance systems that can predict and control the touchdown time of an aircraft to an accuracy of a few seconds throughout the descent - with unequipped aircraft in the terminal area has been investigated via a real-time air traffic control simulation study. The objective of this study was to examine the effect of time errors (at 120 n. mi. from touchdown) on touchdown time scheduling, and to develop efficient algorithms and procedures to null the initial time errors prior to reaching the final control sector (30 n. mi. from touchdown). Results indicate that initial random errors of up to + or - 2 min can be handled via a single speed advisory issued in the arrival control sector, and thus the time schedule is not disrupted.

Tobias, L.↗

Structural optimization using optimality criteria methods

Optimality criteria methods take advantage of some concepts as those of statically determinate or indeterminate structures, and certain variational principles of structural dynamics, to develop efficient algorithms for the sizing of structures that are subjected to stiffness-related constraints. Some of the methods and iterative strategies developed over the last decade for calculations of the Lagrange multipliers in stressand displacement-limited problems, as well as for satisfying the appropriate optimality criterion, are discussed. The application of these methods are illustrated by solving problems with stress and displacement constraints.

Khot, N. S.↗

Factorization and reduction methods for optimal control of distributed parameter systems

A Chandrasekhar-type factorization method is applied to the linear-quadratic optimal control problem for distributed parameter systems. An aeroelastic control problem is used as a model example to demonstrate that if computationally efficient algorithms, such as those of Chandrasekhar-type, are combined with the special structure often available to a particular problem, then an abstract approximation theory developed for distributed parameter control theory becomes a viable method of solution. A numerical scheme based on averaging approximations is applied to hereditary control problems. Numerical examples are given.

Burns, J. A.↗

Instability analysis procedure for 3-level multi-bearing rotor-foundation systems

A procedure for the instability analysis of a three-level multispan rotor systems is described. This procedure is based on a distributed mass elastic representation of the rotor system in several eight-coefficient bearings. Each bearing is supported from an elastic foundation on damped, elastic pedestals. The foundation is represented as a general distributed mass elastic structure on discrete supports, which may have different stiffness and damping properties in the horizontal and vertical directions. This system model is suited to studies of instability threshold conditions for multirotor turbomachines on either massive or flexible foundations. The instability conditions is found by obtaining the eigenvalues of the system determinant, which is obtained by the transfer matrix method from the three-level system model. The stability determinant is solved for the lowest rotational speed at which the system damping becomes zero in the complex eigenvalue, and for the whirl frequency corresponding to the natural frequency of the unstable mode. An efficient algorithm for achieving this is described. Application of this procedure to a rigid rotor in two damped-elastic bearings and flexible supports is described. A second example discusses a flexible rotor with four damped-elastic bearings. The third case compares the stability of a six-bearing 300 Mw turbine generator unit, using two different bearing types. These applications validate the computer program and various aspects of the analysis.

Zhou, S.↗

The efficient simulation of separated three-dimensional viscous flows using the boundary-layer equations

A simple and computationally efficient algorithm for solving the unsteady three-dimensional boundary-layer equations in the time-accurate or relaxation mode is presented. Results of the new algorithm are shown to be in quantitative agreement with detailed experimental data for flow over a swept infinite wing. The separated flow over a 6:1 ellipsoid at angle of attack, and the transonic flow over a finite-wing with shock-induced 'mushroom' separation are also computed and compared with available experimental data. It is concluded that complex, separated, three-dimensional viscous layers can be economically and routinely computed using a time-relaxation boundary-layer algorithm.

Van Dalsem, W. R.↗

Optimal Network-Topology Design

Candidate network designs tested for acceptability and cost. Optimal Network Topology Design computer program developed as part of study on topology design and analysis of performance of Space Station Information System (SSIS) network. Uses efficient algorithm to generate candidate network designs consisting of subsets of set of all network components, in increasing order of total costs and checks each design to see whether it forms acceptable network. Technique gives true cost-optimal network and particularly useful when network has many constraints and not too many components. Program written in PASCAL.

Li, Victor O. K.↗

Three dimensional mesh generation by triangulation of arbitrary point sets

A method for generating an unstructured mesh is described. The approach is quite general and joins an arbitrary set of points to produce a covering of three dimensional space by tetrahedra. After removing the tetrahedra that connect surface points, a mesh suitable for a finite element based flow solver is obtained. Details of the triangulation algorithm are provided together with an analysis of the algorithm efficiency and validity.

Baker, Timothy J.↗

Least squares linear lags and limited memory filters

Pure autoregressive (AR) models which are linear in the short term, that is when a variable can be predicted by linear regression on a limited number of past observations, are discussed. When evenly spaced observations are available, a fixed set of AR coefficients can be calculated independent of the data. For filtering purposes, such a lag structure can be implemented recursively with an efficient algorithm. The method of computing variance recursively is also derived. A complete algorithm is presented in the appendix.

Discenza, Joseph H.↗

A traveling-salesman-based approach to aircraft scheduling in the terminal area

An efficient algorithm is presented, based on the well-known algorithm for the traveling salesman problem, for scheduling aircraft arrivals into major terminal areas. The algorithm permits, but strictly limits, reassigning an aircraft from its initial position in the landing order. This limitation is needed so that no aircraft or aircraft category is unduly penalized. Results indicate, for the mix of arrivals investigated, a potential increase in capacity in the 3 to 5 percent range. Furthermore, it is shown that the computation time for the algorithm grows only linearly with problem size.

Luenberger, Robert A.↗

A variational dynamic programming approach to robot-path planning with a distance-safety criterion

An approach to robot-path planning is developed by considering both the traveling distance and the safety of the robot. A computationally-efficient algorithm is developed to find a near-optimal path with a weighted distance-safety criterion by using a variational calculus and dynamic programming (VCDP) method. The algorithm is readily applicable to any factory environment by representing the free workspace as channels. A method for deriving these channels is also proposed. Although it is developed mainly for two-dimensional problems, this method can be easily extended to a class of three-dimensional problems. Numerical examples are presented to demonstrate the utility and power of this method.

Suh, Suk-Hwan↗

Numerical Simulation of Flow Through an Artificial Heart

A solution procedure was developed that solves the unsteady, incompressible Navier-Stokes equations, and was used to numerically simulate viscous incompressible flow through a model of the Pennsylvania State artificial heart. The solution algorithm is based on the artificial compressibility method, and uses flux-difference splitting to upwind the convective terms; a line-relaxation scheme is used to solve the equations. The time-accuracy of the method is obtained by iteratively solving the equations at each physical time step. The artificial heart geometry involves a piston-type action with a moving solid wall. A single H-grid is fit inside the heart chamber. The grid is continuously compressed and expanded with a constant number of grid points to accommodate the moving piston. The computational domain ends at the valve openings where nonreflective boundary conditions based on the method of characteristics are applied. Although a number of simplifing assumptions were made regarding the geometry, the computational results agreed reasonably well with an experimental picture. The computer time requirements for this flow simulation, however, are quite extensive. Computational study of this type of geometry would benefit greatly from improvements in computer hardware speed and algorithm efficiency enhancements.

Rogers, Stuart E.↗