SEARCH · Search NASA

Results for “CONNECT 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

NASA NTRS1993

A new procedure for dynamic adaption of three-dimensional unstructured grids

A new procedure is presented for the simultaneous coarsening and refinement of three-dimensional unstructured tetrahedral meshes. This algorithm allows for localized grid adaption that is used to capture aerodynamic flow features such as vortices and shock waves in helicopter flowfield simulations. The mesh-adaption algorithm is implemented in the C programming language and uses a data structure consisting of a series of dynamically-allocated linked lists. These lists allow the mesh connectivity to be rapidly reconstructed when individual mesh points are added and/or deleted. The algorithm allows the mesh to change in an anisotropic manner in order to efficiently resolve directional flow features. The procedure has been successfully implemented on a single processor of a Cray Y-MP computer. Two sample cases are presented involving three-dimensional transonic flow. Computed results show good agreement with conventional structured-grid solutions for the Euler equations.

Biswas, Rupak↗

NASA NTRS1988

Parallel algorithms for interactive manipulation of digital terrain models

Interactive three-dimensional graphics applications, such as terrain data representation and manipulation, require extensive arithmetic processing. Massively parallel machines are attractive for this application since they offer high computational rates, and grid connected architectures provide a natural mapping for grid based terrain models. Presented here are algorithms for data movement on the massive parallel processor (MPP) in support of pan and zoom functions over large data grids. It is an extension of earlier work that demonstrated real-time performance of graphics functions on grids that were equal in size to the physical dimensions of the MPP. When the dimensions of a data grid exceed the processing array size, data is packed in the array memory. Windows of the total data grid are interactively selected for processing. Movement of packed data is needed to distribute items across the array for efficient parallel processing. Execution time for data movement was found to exceed that for arithmetic aspects of graphics functions. Performance figures are given for routines written in MPP Pascal.

Davis, E. W.↗

NASA NTRS1989

A computational fluid dynamics algorithm on a massively parallel computer

The implementation and performance of a finite-difference algorithm for the compressible Navier-Stokes equations in two or three dimensions on the Connection Machine are described. This machine is a single-instruction multiple-data machine with up to 65536 physical processors. The implicit portion of the algorithm is of particular interest. Running times and megadrop rates are given for two- and three-dimensional problems. Included are comparisons with the standard codes on a Cray X-MP/48.

Jespersen, Dennis C.↗

NASA NTRS2005

At-Least Version of the Generalized Minimum Spanning Tree Problem: Optimization Through Ant Colony System and Genetic Algorithms

The At-Least version of the Generalized Minimum Spanning Tree Problem (L-GMST) is a problem in which the optimal solution connects all defined clusters of nodes in a given network at a minimum cost. The L-GMST is NPHard; therefore, metaheuristic algorithms have been used to find reasonable solutions to the problem as opposed to computationally feasible exact algorithms, which many believe do not exist for such a problem. One such metaheuristic uses a swarm-intelligent Ant Colony System (ACS) algorithm, in which agents converge on a solution through the weighing of local heuristics, such as the shortest available path and the number of agents that recently used a given path. However, in a network using a solution derived from the ACS algorithm, some nodes may move around to different clusters and cause small changes in the network makeup. Rerunning the algorithm from the start would be somewhat inefficient due to the significance of the changes, so a genetic algorithm based on the top few solutions found in the ACS algorithm is proposed to quickly and efficiently adapt the network to these small changes.

Janich, Karl W.↗

NASA NTRS1973

Recent advances in numerical analysis of structural eigenvalue problems

A wide range of eigenvalue problems encountered in practical structural engineering analyses is defined, in which the structures are assumed to be discretized by any suitable technique such as the finite-element method. A review of the usual numerical procedures for the solution of such eigenvalue problems is presented and is followed by an extensive account of recently developed eigenproblem solution procedures. Particular emphasis is placed on the new numerical algorithms and associated computer programs based on the Sturm sequence method. Eigenvalue algorithms developed for efficient solution of natural frequency and buckling problems of structures are presented, as well as some eigenvalue procedures formulated in connection with the solution of quadratic matrix equations associated with free vibration analysis of structures. A new algorithm is described for natural frequency analysis of damped structural systems.

Gupta, K. K.↗

NASA NTRS1993

Domain connectivity among systems of overset grids

This progress report describes research performed to achieve algorithmic improvements in the use of overset grids for the computation of unsteady flowfields about geometrically complex and moving component configurations. A hole-map computational method is detailed that reduces computational demand and corresponding demand on human resources. Results indicate that the method is both efficient and flexible for use in complex simulation cases. Tests were performed on shuttle orbiter/external tank, wing/store, and V-22 tilt-rotor configurations. The number of simulated points and the corresponding time on a SGI 4D-210 workstation are presented.

Meakin, Robert L.↗

NASA NTRS1988

Parallel algorithm for determining motion vectors in ice floe images by matching edge features

A parallel algorithm is described to determine motion vectors of ice floes using time sequences of images of the Arctic ocean obtained from the Synthetic Aperture Radar (SAR) instrument flown on-board the SEASAT spacecraft. Researchers describe a parallel algorithm which is implemented on the MPP for locating corresponding objects based on their translationally and rotationally invariant features. The algorithm first approximates the edges in the images by polygons or sets of connected straight-line segments. Each such edge structure is then reduced to a seed point. Associated with each seed point are the descriptions (lengths, orientations and sequence numbers) of the lines constituting the corresponding edge structure. A parallel matching algorithm is used to match packed arrays of such descriptions to identify corresponding seed points in the two images. The matching algorithm is designed such that fragmentation and merging of ice floes are taken into account by accepting partial matches. The technique has been demonstrated to work on synthetic test patterns and real image pairs from SEASAT in times ranging from .5 to 0.7 seconds for 128 x 128 images.

Manohar, M.↗

NASA NTRS1980

A new method for optimizing multiple flyby trajectories

A new procedure has been developed which minimizes total impulsive Delta V for multiple flyby trajectories with constraints on flyby parameters and maneuver times. The method involves solving a bounds-constrained parameter optimization problem with a Newton algorithm utilizing analytic first and second derivatives. Each trajectory segment connecting consecutive maneuver points is found by first targeting from the preceding maneuver point to the parameters of the upcoming flyby and then propagating the resulting trajectory to the next maneuver point. Multi-conic techniques are used for trajectory propagation and for computation of the state transition matrix. This procedure has successfully optimized Galileo satellite tours containing up to 11 flybys.

Damario, L. A.↗

NASA NTRS1983

A chimera grid scheme

A mesh system composed of multiple overset body-conforming grids is described for adapting finite-difference procedures to complex aircraft configurations. In this so-called 'chimera mesh,' a major grid is generated about a main component of the configuration and overset minor grids are used to resolve all other features. Methods for connecting overset multiple grids and modifications of flow-simulation algorithms are discussed. Computational tests in two dimensions indicate that the use of multiple overset grids can simplify the task of grid generation without an adverse effect on flow-field algorithms and computer code complexity.

Steger, J. L.↗

NASA NTRS1985

Algorithmic and theoretical results on computation of incompressible viscous flows by finite element methods

Primitive variable as well as streamfunction-vorticity and pure streamfunction formulations are discussed. For the primitive variable case alternative choices of the viscous stress term are shown to produce natural boundary conditions which are well suited for matching to various far field conditions. For the other cases recent analytical results, including error estimates are described, and an optical algorithm for pressure recovery as well as treatment for multiply connected domains are given.

Gunzburger, M. D.↗

NASA NTRS1990

Measurement and exploitation of mesh structure on the Connection Machine

A four-node shell element has been implemented on the Connection Machine using the direct vector method and an exchange algorithm previously used with a simpler element. It is shown that the method retains a large measure of its speed in the more complicated setting of a shell element. A hybrid interprocessor communication scheme for the exchange algorithm which uses NEWS within structured subdomains is described.

Plaskacz, Edward J.↗

NASA NTRS1993

A Software Package for Neural Network Applications Development

Original Backprop (Version 1.2) is an MS-DOS package of four stand-alone C-language programs that enable users to develop neural network solutions to a variety of practical problems. Original Backprop generates three-layer, feed-forward (series-coupled) networks which map fixed-length input vectors into fixed length output vectors through an intermediate (hidden) layer of binary threshold units. Version 1.2 can handle up to 200 input vectors at a time, each having up to 128 real-valued components. The first subprogram, TSET, appends a number (up to 16) of classification bits to each input, thus creating a training set of input output pairs. The second subprogram, BACKPROP, creates a trilayer network to do the prescribed mapping and modifies the weights of its connections incrementally until the training set is leaned. The learning algorithm is the 'back-propagating error correction procedures first described by F. Rosenblatt in 1961. The third subprogram, VIEWNET, lets the trained network be examined, tested, and 'pruned' (by the deletion of unnecessary hidden units). The fourth subprogram, DONET, makes a TSR routine by which the finished product of the neural net design-and-training exercise can be consulted under other MS-DOS applications.

Baran, Robert H.↗

NASA NTRS1991

Expert systems for assembly sequence evaluation

The objective is to identify delivered orbital subassemblies derived from a phase A conceptual space vehicle design while minimizing on-orbit assembly complexity. The topics covered are presented in viewgraph form and include the following: an orbital assembly scenario; subassemblies; subassembly identification and simulation model; estimating subassembly interfaces by engineering functional allocation using MBR; representative data base of interface connections; vehicle decomposition model; connection interface estimation model results; knowledge-source 1 and 2 results; knowledge-source 3 -- connection-index results (Boeing NTR-2016 CI-profile); KS3 algorithm, and KS3 flight manifest results.

Jolly, Steve↗

NASA NTRS1995

Dominant takeover regimes for genetic algorithms

The genetic algorithm (GA) is a machine-based optimization routine which connects evolutionary learning to natural genetic laws. The present work addresses the problem of obtaining the dominant takeover regimes in the GA dynamics. Estimated GA run times are computed for slow and fast convergence in the limits of high and low fitness ratios. Using Euler's device for obtaining partial sums in closed forms, the result relaxes the previously held requirements for long time limits. Analytical solution reveal that appropriately accelerated regimes can mark the ascendancy of the most fit solution. In virtually all cases, the weak (logarithmic) dependence of convergence time on problem size demonstrates the potential for the GA to solve large N-P complete problems.

Noever, David↗

NASA NTRS1996

Ideas for Future GPS Timing Improvements

Having recently met stringent criteria for full operational capability (FOC) certification, the Global Positioning System (GPS) now has higher customer expectations than ever before. In order to maintain customer satisfaction, and the meet the even high customer demands of the future, the GPS Master Control Station (MCS) must play a critical role in the process of carefully refining the performance and integrity of the GPS constellation, particularly in the area of timing. This paper will present an operational perspective on several ideas for improving timing in GPS. These ideas include the desire for improving MCS - US Naval Observatory (USNO) data connectivity, an improved GPS-Coordinated Universal Time (UTC) prediction algorithm, a more robust Kalman Filter, and more features in the GPS reference time algorithm (the GPS composite clock), including frequency step resolution, a more explicit use of the basic time scale equation, and dynamic clock weighting. Current MCS software meets the exceptional challenge of managing an extremely complex constellation of 24 navigation satellites. The GPS community will, however, always seek to improve upon this performance and integrity.

Hutsell, Steven T.↗

NASA NTRS2012

Aerosol Remote Sensing

This book gives a much needed explanation of the basic physical principles of radia5tive transfer and remote sensing, and presents all the instruments and retrieval algorithms in a homogenous manner. For the first time, an easy path from theory to practical algorithms is available in one easily accessible volume, making the connection between theoretical radiative transfer and individual practical solutions to retrieve aerosol information from remote sensing. In addition, the specifics and intercomparison of all current and historical methods are explained and clarified.

Lenoble, Jacqueline↗

NASA NTRS2012

Operator Interface and Control Software for the Reconfigurable Surface System Tri-ATHLETE

Graphical operator interface methods have been developed for modular, reconfigurable articulated surface systems in general, and a specific instantiation thereof for JPL's Tri-ATHLETE. The All- Terrain Hex-Limbed Extra-Terrestrial Explorer Robot (ATHLETE) has six limbs with six kinematic degrees of freedom each. The core advancement of this work was the development of a novel set of algorithms for dynamically maintaining a reduced coordinate model of any connected assembly of robot modules.

Norris, Jeffrey S.↗

NASA NTRS2018

Probabilistic Guidance of a Swarm Deployed from the Back Shell of the Mars Spacecraft

This paper presents a probabilistic guidance algorithm for a swarm of assets deployed from the back shell of the Mars spacecraft. Such a swarm could provide valuable science data, with large spatiotemporal variation, from the Martian surface. Our probabilistic swarm guidance algorithm maximizes the coverage area of the swarm while uniformly distributing the assets on the Martian surface and guaranteeing strong connectivity of the swarm’s communication network topology. Numerical simulations demonstrate the eﬀectiveness and versatility of our probabilistic swarm guidance algorithm.

Hadaegh, Fred↗