Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized 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 865 records · Page 48

Aligning parallel arrays to reduce communication

Axis and stride alignment is an important optimization in compiling data-parallel programs for distributed-memory machines. We previously developed an optimal algorithm for aligning array expressions. Here, we examine alignment for more general program graphs. We show that optimal alignment is NP-complete in this setting, so we study heuristic methods. This paper makes two contributions. First, we show how local graph transformations can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. Second, we give a heuristic that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. Our algorithms have been implemented; we present experimental results showing their effect on the performance of some example programs running on the CM-5.

Sheffler, Thomas J.↗

Wheat forecast economics effect study

A model to assess the value of improved information regarding the inventories, productions, exports, and imports of crop on a worldwide basis is discussed. A previously proposed model is interpreted in a stochastic control setting and the underlying assumptions of the model are revealed. In solving the stochastic optimization problem, the Markov programming approach is much more powerful and exact as compared to the dynamic programming-simulation approach of the original model. The convergence of a dual variable Markov programming algorithm is shown to be fast and efficient. A computer program for the general model of multicountry-multiperiod is developed. As an example, the case of one country-two periods is treated and the results are presented in detail. A comparison with the original model results reveals certain interesting aspects of the algorithms and the dependence of the value of information on the incremental cost function.

Mehra, R. K.↗

Modeling and measurement of error propagation in a multimodule computing system

An error propagation model has been developed for multimodule computing systems in which the main parameters are the distribution functions of error propagation times. A digraph model is used to represent a multimodule computing system, and error propagation in the system is modeled by general distributions of error propagation times between all pairs of modules. Two algorithms are developed to compute systematically and efficiently the distributions of error propagation times. Experiments are also conducted to measure the distributions of error propagation times with the fault-tolerant microprocessor (FTMP). Statistical analysis of experimental data shows that the error propagation times in FTMP do not follow a well-known distribution, thus justifying the use of general distributions in the present model.

Shin, Kang G.↗

Fast, Safe, Propellant-Efficient Spacecraft Motion Planning Under Clohessy-Wiltshire-Hill Dynamics

This paper presents a sampling-based motion planning algorithm for real-time and propellant-optimized autonomous spacecraft trajectory generation in near-circular orbits. Specifically, this paper leverages recent algorithmic advances in the field of robot motion planning to the problem of impulsively actuated, propellant- optimized rendezvous and proximity operations under the Clohessy-Wiltshire-Hill dynamics model. The approach calls upon a modified version of the FMT* algorithm to grow a set of feasible trajectories over a deterministic, low-dispersion set of sample points covering the free state space. To enforce safety, the tree is only grown over the subset of actively safe samples, from which there exists a feasible one-burn collision-avoidance maneuver that can safely circularize the spacecraft orbit along its coasting arc under a given set of potential thruster failures. Key features of the proposed algorithm include 1) theoretical guarantees in terms of trajectory safety and performance, 2) amenability to real-time implementation, and 3) generality, in the sense that a large class of constraints can be handled directly. As a result, the proposed algorithm offers the potential for widespread application, ranging from on-orbit satellite servicing to orbital debris removal and autonomous inspection missions.

spacecraft relative motio↗

A theoretical study of mixing downstream of transverse injection into a supersonic boundary layer

A theoretical and analytical study was made of mixing downstream of transverse hydrogen injection, from single and multiple orifices, into a Mach 4 air boundary layer over a flat plate. Numerical solutions to the governing three-dimensional, elliptic boundary layer equations were obtained using a general purpose computer program. Founded upon a finite element solution algorithm. A prototype three-dimensional turbulent transport model was developed using mixing length theory in the wall region and the mass defect concept in the outer region. Excellent agreement between the computed flow field and experimental data for a jet/freestream dynamic pressure ratio of unity was obtained in the centerplane region of the single-jet configuration. Poorer agreement off centerplane suggests an inadequacy of the extrapolated two-dimensional turbulence model. Considerable improvement in off-centerplane computational agreement occured for a multi-jet configuration, using the same turbulent transport model.

Baker, A. J.↗

An analysis of GDOP in global positioning system navigation

The accuracy of user navigation fix based on the NAVSTAR global positioning system is described. The trace of this matrix serves as a convenient navigation performance index and the square root of the trace is called geometric dilution of precision (GDOP). Certain theoretical results concerning the general properties of the navigation performance are derived. An efficient algorithm for the computation of GDOP is given. Applications of the results are illustrated by numerical examples.

Fang, B. T.↗

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.↗

An analysis of the multibeam altimeter

The design concept and computer simulations of a multibeam altimeter (MA) to provide satellite-based oceanographic-feature data for map construction within relatively short times are presented. The limitations of the pulse-limited radar altimeter used on GEOS-3 and SEASAT-A, in particular the narrow swath of each measurement pass, are characterized. The MA uses interferometry with two 1.2-m dish antennas separated by an 11-m boom to cover a total swath width of 100 km at satellite altitude 800 km, nominal repetition rate 6 kp/sec, and nominal integration time 2.5 sec. Simulation analysis of antenna element pattern, echo shape, tracking algorithms, tracking noise, and measurement accuracy was performed, and the general feasibility of ocean-current mapping with a one-week time delay, using two MA-equipped satellites, was demonstrated.

Bush, G. B.↗

Qualitative evaluation of a flush air data system at transonic speeds and high angles of attack

Flight tests were performed on an F-14 aircraft to evaluate the use of flush pressure orifices on the nose section for obtaining air data at transonic speeds over a large range of flow angles. This program was part of a flight test and wind tunnel program to assess the accuracies of such systems for general use on aircraft. It also provided data to validate algorithms developed for the shuttle entry air data system designed at NASA Langley. Data were obtained for Mach numbers between 0.60 and 1.60, for angles of attack up to 26.0 deg, and for sideslip angles up to 11.0 deg. With careful calibration, a flush air data system with all flush orifices can provide accurate air data information over a large range of flow angles. Several orificies on the nose cap were found to be suitable for determination of stagnation pressure. Other orifices on the nose section aft of the nose cap were shown to be suitable for determination of static pressure. Pairs of orifices on the nose cap provided the most sensitive measurements for determining angles of attack and sideslip, although orifices located farther aft on the nose section could also be used.

Larson, Terry J.↗

Structural optimization of framed structures using generalized optimality criteria

The application of a generalized optimality criteria to framed structures is presented. The optimality conditions, Lagrangian multipliers, resizing algorithm, and scaling procedures are all represented as a function of the objective and constraint functions along with their respective gradients. The optimization of two plane frames under multiple loading conditions subject to stress, displacement, generalized stiffness, and side constraints is presented. These results are compared to those found by optimizing the frames using a nonlinear mathematical programming technique.

Kolonay, R. M.↗

Piloted simulation of a ground-based time-control concept for air traffic control

A concept for aiding air traffic controllers in efficiently spacing traffic and meeting scheduled arrival times at a metering fix was developed and tested in a real time simulation. The automation aid, referred to as the ground based 4-D descent advisor (DA), is based on accurate models of aircraft performance and weather conditions. The DA generates suggested clearances, including both top-of-descent-point and speed-profile data, for one or more aircraft in order to achieve specific time or distance separation objectives. The DA algorithm is used by the air traffic controller to resolve conflicts and issue advisories to arrival aircraft. A joint simulation was conducted using a piloted simulator and an advanced concept air traffic control simulation to study the acceptability and accuracy of the DA automation aid from both the pilot's and the air traffic controller's perspectives. The results of the piloted simulation are examined. In the piloted simulation, airline crews executed controller issued descent advisories along standard curved path arrival routes, and were able to achieve an arrival time precision of + or - 20 sec at the metering fix. An analysis of errors generated in turns resulted in further enhancements of the algorithm to improve the predictive accuracy. Evaluations by pilots indicate general support for the concept and provide specific recommendations for improvement.

Davis, Thomas J.↗

Satellite mapping of Nile Delta coastal changes

Multitemporal, multispectral scanner (MSS) landsat data have been used to monitor erosion and sedimentation along the Rosetta Promontory of the Nile Delta. These processes have accelerated significantly since the completion of the Aswan High Dam in 1964. Digital differencing of four MSS data sets, using standard algorithms, show that changes observed over a single year period generally occur as strings of single mixed pixels along the coast. Therefore, these can only be used qualitatively to indicate areas where changes occur. Areas of change recorded over a multi-year period are generally larger and thus identified by clusters of pixels; this reduces errors introduced by mixed pixels. Satellites provide a synoptic perspective utilizing data acquired at frequent time intervals. This permits multiple year monitoring of delta evolution on a regional scale.

Blodget, H. W.↗

Compiling global name-space programs for distributed execution

Distributed memory machines do not provide hardware support for a global address space. Thus programmers are forced to partition the data across the memories of the architecture and use explicit message passing to communicate data between processors. The compiler support required to allow programmers to express their algorithms using a global name-space is examined. A general method is presented for analysis of a high level source program and along with its translation to a set of independently executing tasks communicating via messages. If the compiler has enough information, this translation can be carried out at compile-time. Otherwise run-time code is generated to implement the required data movement. The analysis required in both situations is described and the performance of the generated code on the Intel iPSC/2 is presented.

Koelbel, Charles↗

Application of a novel multi-stage signal parameter estimator to high dynamic GPS receivers

The performance of a novel multistage estimator when applied to the estimation of the position, velocity, and acceleration of high dynamic Global Positioning System (GPS) receivers is discussed. For the present application, a two-stage specialization of the more general estimation scheme is considered, wherein the first-stage algorithm is selected to be a modified least-squares algorithm operating upon the differential signal model and referred to as differential least-squares (DLS) and the second stage is simply an extended Kalman filter (EKF). In terms of the threshold on received carrier power-to-noise power spectral density ratio (CNR), when compared to the single-stage EKF algorithm, the DLS-EKF algorithm is about 1.5-2.0 dB better in terms of threshold and outperforms the crossproduct AFC (automatic frequency control) loop by 2-5 dB. For the case when data modulation is present, the proposed scheme provides an improvement of about 6 dB in terms of CNR compared to an earlier approximate MLE (maximum likelihood estimation) scheme. There are also very significant improvements in terms of other performance measures.

Kumar, R.↗

Compiling global name-space parallel loops for distributed execution

Distributed memory machines do not provide hardware support for a global address space. Thus programmers are forced to partition the data across the memories of the architecture and use explicit message passing to communicate data between processors. The compiler support required to allow programmers to express their algorithms using a global name-space is examined. A general method is presented for analysis of a high level source program and its translation into a set of independently executing tasks communicating via messages. If the compiler has enough information, this translation can be carried out at compile time. Otherwise, run-time code is generated to implement the required data movement. The analysis required in both situations is described and the performance of the generated code on the Intel iPSC/2 is presented.

Koelbel, Charles↗

Conditions for continuation of the efficient curve for multi-objective control-structure optimization

The paper describes the conditions for continuation of the efficient curve for bi-objective control-structure optimization of a ten-bar truss with two collocated sensors and actuators. The curve has been obtained with an active set algorithm using a homotopy method. The curve is discontinuous. A general stability theory has been implemented to determine sufficient conditions for the persistence of minima, and bifurcation theory has been used to characterize the possible points of discontinuity of the path.

Rakowska, Joanna↗

The computation of three-dimensional flows using unstructured grids

A general method is described for automatically discretizing, into unstructured assemblies of tetrahedra, the three-dimensional solution domains of complex shape which are of interest in practical computational aerodynamics. An algorithm for the solution of the compressible Euler equations which can be implemented on such general unstructured tetrahedral grids is described. This is an explicit cell-vertex scheme which follows a general Taylor-Galerkin philosophy. The approach is employed to compute a transonic inviscid flow over a standard wing and the results are shown to compare favorably with experimental observations. As a more practical demonstration, the method is then applied to the analysis of inviscid flow over a complete modern fighter configuration. The effect of using mesh adaptivity is illustrated when the method is applied to the solution of high speed flow in an engine inlet.

Morgan, K.↗

Progressive wave equations and algorithms for sonic boom propagation

Raspet, Bass, and others have carried out a number of studies of sonic boom propagation using algorithms that can be traced back to a 1973 doctoral thesis written by Pestorius at the University of Texas. The algorithm was originally set forth without a formal derivation from a governing set of partial differential equations. Perusal of Pestorius's report and of subsequent reports from the Texas nonlinear accoustics group suggests that such a derivation has not yet appeared in the archival literature. The author and his colleagues, on the other hand, have been working with an explicit set of approximate partial differential equations analogous to Burgers' equation. The present paper traces through the pertinent statements in the Pestorius reports and shows that the derived algorithm, at least in the limit of sufficiently short steps, is equivalent to the numerical solution of a similar (and nearly equivalent) explicit set of partial differential equations. The tying-together of the two approaches is important because it is possible that some of the basic ideas embodied in the Pestorius algorithm may be incorporated in other contexts where more nearly general models of sonic boom propagation through realistic atmospheres are to be solved numerically.

Pierce, Allan D.↗