Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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 937 records · Page 52

MISR-GOES 3D Winds: Implications for Future LEO-GEO and LEO-LEO Winds

Global wind observations are fundamental for studying weather and climate dynamics and for operational forecasting. Most wind measurements come from atmospheric motion vectors (AMVs) by tracking the displacement of cloud or water vapor features. These AMVs generally rely on thermal infrared (IR) techniques for their height assignments, which are subject to large uncertainties in the presence of weak or reversed vertical temperature gradients near the planetary boundary layer (PBL)and tropopause folds. Stereo imaging can overcome the height assignment problem using geometric parallax for feature height determination. In this study we develop a stereo 3D-Wind algorithm to simultaneously retrieve AMV and height from geostationary (GEO) and low Earth orbit (LEO) satellite imagery and apply it to collocated Geostationary Operational Environmental Satellite (GOES)and Multi-angle Imaging SpectroRadiometer (MISR) imagery. The new algorithm improves AMV and height relative to products from GOES or MISR alone, with an estimated accuracy of <0.5 m/s in AMV and <200 m in height with 2.2 km sampling. The algorithm can be generalized to other LEO-GEO or LEO-LEO combinations for greater spatiotemporal coverage. The technique demonstrated with MISR and GOES has important implications for future high-quality AMV observations, for which a low-cost constellation of CubeSats can play a vital role.

MISR↗

Integrated risk/cost planning models for the US Air Traffic system

A prototype network planning model for the U.S. Air Traffic control system is described. The model encompasses the dual objectives of managing collision risks and transportation costs where traffic flows can be related to these objectives. The underlying structure is a network graph with nonseparable convex costs; the model is solved efficiently by capitalizing on its intrinsic characteristics. Two specialized algorithms for solving the resulting problems are described: (1) truncated Newton, and (2) simplicial decomposition. The feasibility of the approach is demonstrated using data collected from a control center in the Midwest. Computational results with different computer systems are presented, including a vector supercomputer (CRAY-XMP). The risk/cost model has two primary uses: (1) as a strategic planning tool using aggregate flight information, and (2) as an integrated operational system for forecasting congestion and monitoring (controlling) flow throughout the U.S. In the latter case, access to a supercomputer is required due to the model's enormous size.

Mulvey, J. M.↗

Quotient-difference type generalizations of the power method and their analysis

The recursion relations that were proposed by W. F. Ford and A. Sidi (Appl. Numer. Math, 4 (1988), pp. 477-489) for implementing vector extrapolation methods are used for devising generalizations of the power method for linear operators. These generalizations are shown to produce approximations to largest eigenvalues of a linear operator under certain conditions. They are similar in form to the quotient-difference algorithm and share similar convergence properties with the latter. These convergence properties also resemble those obtained for the basic LR and QR algorithms. Finally, it is shown that the convergence rate produced by one fo these generalizations is twice as fast for normal operators as it is for nonnormal operators.

Sidi, Avram↗

Error control techniques for satellite and space communications

The unequal error protection capabilities of convolutional and trellis codes are studied. In certain environments, a discrepancy in the amount of error protection placed on different information bits is desirable. Examples of environments which have data of varying importance are a number of speech coding algorithms, packet switched networks, multi-user systems, embedded coding systems, and high definition television. Encoders which provide more than one level of error protection to information bits are called unequal error protection (UEP) codes. In this work, the effective free distance vector, d, is defined as an alternative to the free distance as a primary performance parameter for UEP convolutional and trellis encoders. For a given (n, k), convolutional encoder, G, the effective free distance vector is defined as the k-dimensional vector d = (d(sub 0), d(sub 1), ..., d(sub k-1)), where d(sub j), the j(exp th) effective free distance, is the lowest Hamming weight among all code sequences that are generated by input sequences with at least one '1' in the j(exp th) position. It is shown that, although the free distance for a code is unique to the code and independent of the encoder realization, the effective distance vector is dependent on the encoder realization.

Costello, Daniel J., Jr.↗

Wire Detection Algorithms for Navigation

In this research we addressed the problem of obstacle detection for low altitude rotorcraft flight. In particular, the problem of detecting thin wires in the presence of image clutter and noise was studied. Wires present a serious hazard to rotorcrafts. Since they are very thin, their detection early enough so that the pilot has enough time to take evasive action is difficult, as their images can be less than one or two pixels wide. Two approaches were explored for this purpose. The first approach involved a technique for sub-pixel edge detection and subsequent post processing, in order to reduce the false alarms. After reviewing the line detection literature, an algorithm for sub-pixel edge detection proposed by Steger was identified as having good potential to solve the considered task. The algorithm was tested using a set of images synthetically generated by combining real outdoor images with computer generated wire images. The performance of the algorithm was evaluated both, at the pixel and the wire levels. It was observed that the algorithm performs well, provided that the wires are not too thin (or distant) and that some post processing is performed to remove false alarms due to clutter. The second approach involved the use of an example-based learning scheme namely, Support Vector Machines. The purpose of this approach was to explore the feasibility of an example-based learning based approach for the task of detecting wires from their images. Support Vector Machines (SVMs) have emerged as a promising pattern classification tool and have been used in various applications. It was found that this approach is not suitable for very thin wires and of course, not suitable at all for sub-pixel thick wires. High dimensionality of the data as such does not present a major problem for SVMs. However it is desirable to have a large number of training examples especially for high dimensional data. The main difficulty in using SVMs (or any other example-based learning method) is the need for a very good set of positive and negative examples since the performance depends on the quality of the training set.

Kasturi, Rangachar↗

Constrained low-thrust guidance.

Constrained low thrust guidance algorithms for three axis and spin-stabilized, constant power, solar electric propelled spacecraft on fixed time rendezvous missions are developed. A 'bang-bang' type of minimum-propellant thrust program is used. Control constraints arise from the specification that the thrust vector must remain fixed relative to the solar panels. The guidance law is derived from deterministic linear perturbation theory and is controllable to first order on trajectories containing at least two thrust arcs. The number and timing of guidance updates and the effectiveness of the guidance law in compensating for state and control estimation biases and uncertainties are discussed. Numerical comparisons between the optimal control and the restricted control case are presented on a Encke comet rendezvous.

Ungs, M. J.↗

Investigation of electrodynamic stabilization and control of long orbiting tethers

An algorithm for using electric currents to control pendular oscillations induced by various perturbing forces on the Skyhook wire is considered. Transverse and vertical forces on the tether; tether instability modes and causes during retrieval by space shuttle; simple and spherical pendulum motion and vector damping; and current generation and control are discussed. A computer program for numerical integration of the in-plane and out-of-plane displacements of the tether vs time was developed for heuristic study. Some techniques for controlling instabilities during payload retrieval and methods for employing the tether for launching satellites from the space shuttle are considered. Derivations and analyses of a general nature used in all of the areas studied are included.

Arnold, D. A.↗

Advances in information extraction techniques

Sundry recent developments are presented which show some potential for affecting the automatic extraction of information from remotely sensed data. Pattern representations more abstract than Euclidean vector spaces offer some hope of unifying structural and decision theoretical approaches. The estimation of expected classification error rates is becoming more sophisticated and rigorous, but useful finite-sample results for nonparametric distributions appear unobtainable. Focus on computational complexity allows comparison of algorithms, while software engineering techniques reduce the effort necessary to develop and maintain complex image processing systems. Advances in computer systems architecture, commercial database technology, and man-machine communications should be closely monitored by the remote sensing community. A NASA-sponsored recommendation for research directions in mathematical pattern recognition are offered.

Nagy, G.↗

Embedding of attitude determination in n-dimensional spaces

The problem of attitude determination in n-dimensional spaces is addressed. The proper parameters are found, and it is shown that not all three-dimensional methods have useful extensions to higher dimensions. It is demonstrated that Rodriguez parameters are conveniently extendable to other dimensions. An algorithm for using these parameters in the general n-dimensional case is developed and tested with a four-dimensional example. The correct mathematical description of angular velocities is addressed, showing that angular velocity in n dimensions cannot be represented by a vector but rather by a tensor of the second rank. Only in three dimensions can the angular velocity be described by a vector.

Bar-Itzhack, Itzhack Y.↗

An orthogonal coordinate grid following the three-dimensional viscous flow over a concave surface

Swept wings designed for laminar flow control exhibit both centrifugal and crossflow instabilities which produce streamwise vortices that can lead to early transition from laminar to turbulent flow in the presence of Tollmien-Schlichting waves. This paper outlines an iterative algorithm for generation of an orthogonal, curvilinear, coordinate grid following the streamlines of the three-dimensional viscous flow over a swept, concave surface. The governing equations for the metric tensor are derived from the Riemann-Christoffel tensor for an Euclidian geometry. Unit vectors along streamline, normal and binormal directions are determined. The governing equations are not solved directly, but are employed only as compatibility equations. The scale factor for the streamline coordinate is obtained by an iterative integration scheme on a 200 x 100 x 5 grid, while the other two scale factors are determined from definitions. Sample results are obtained which indicate that the compatibility equation error decreases linearly with grid step size. Grids smaller than 200 x 100 x 5 are found to be inadequate to resolve the grid curvature.

Dagenhart, J. R↗

A VLSI Processor Engine to Support Calculation of the Vector Wave Equation

The development of a VLSI processor engine tailored to support computation of the near-field vector wave equation (VWE) is presented. Calculation of the near field is essential for evaluation of the electromagnetic fields generated by a complex radiating structure. The processor engine presented is optimized such that it takes advantage of the extensive parallelism inherent in the computational algorithm. The utilization of very large scale integration (VLSI) circuit technology and a customized reduced instruction set computer (RISC) architecture support development of a system of these processor engines, each of which is capable of performing the VWE algorithm calculation. By taking maximum advantage of the parallelism present in the calculation and dividing the problem among an array of these processor engines, the calculation can be computed in a realistic time frame.

J W Degroat↗

Representation and display of vector field topology in fluid flow data sets

The visualization of physical processes in general and of vector fields in particular is discussed. An approach to visualizing flow topology that is based on the physics and mathematics underlying the physical phenomenon is presented. It involves determining critical points in the flow where the velocity vector vanishes. The critical points, connected by principal lines or planes, determine the topology of the flow. The complexity of the data is reduced without sacrificing the quantitative nature of the data set. By reducing the original vector field to a set of critical points and their connections, a representation of the topology of a two-dimensional vector field that is much smaller than the original data set but retains with full precision the information pertinent to the flow topology is obtained. This representation can be displayed as a set of points and tangent curves or as a graph. Analysis (including algorithms), display, interaction, and implementation aspects are discussed.

Helman, James↗

A predictor-corrector scheme for vortex identification

A new algorithm for identifying and characterizing vortices in complex flows is presented. The scheme uses both the vorticity and pressure fields. A skeleton line along the center of a vortex is produced by a two-step predictor-corrector scheme. The technique uses the vector field to move in the direction of the skeleton line and the scalar field to correct the location in the plane perpendicular to the skeleton line. A general vortex cross section can be concisely defined with five parameters at each point along the skeleton line. The details of the method and examples of its use are discussed.

Singer, Bart A.↗

Generating CAHV and CAHVOR Images with Shadows in ROAMS

Part of the Rover Analysis, Modeling and Simulation (ROAMS) software that synthesizes images of terrain has been augmented to make the images more realistic. [ROAMS was described in "Simulating Operation of a Planetary Rover" (NPO-30722), NASA Tech Briefs, Vol. 28, No. 9 (September 2004), page 52. ROAMS simulates the operation of a robotic vehicle (rover) exploring terrain on a remote planet.] The images are needed for modeling responses of rover cameras that provide sensory inputs for machine-vision-based algorithms for controlling the motion of the rover. The augmented image-synthesizing part of the ROAMS software supports terrain geometry and texture specifiable by the user, CAHV and CAHVOR camera models, and more-realistic shadowing (see figure). (The letters in "CAHV" represent vectors in a standard photogrammetric model of a pinhole camera. Letters O and R in "CAHVOR" represent vectors used to model distortions.) A contemplated future version of ROAMS would support the CAHVORE model, which represents more-general cameras, including those having fish-eye or other wide-field-of-view lenses. (Letter E in "CAHVORE" represents a vector used to model apparent motion of a camera entrance pupil.)

Madison, Richard↗

An Error Analysis of the Phased Array Antenna Pointing Algorithm for STARS Flight Demonstration No. 2

STARS is a multicenter NASA project to determine the feasibility of using space-based assets, such as the Tracking and Data Relay Satellite System (TDRSS) and Global Positioning System (GPS), to increase flexibility (e.g. increase the number of possible launch locations and manage simultaneous operations) and to reduce operational costs by decreasing the need for ground-based range assets and infrastructure. The STARS project includes two major systems: the Range Safety and Range User systems. The latter system uses broadband communications (125 kbps to 500 kbps) for voice, video, and vehicle/payload data. Flight Demonstration #1 revealed the need to increase the data rate of the Range User system. During Flight Demo #2, a Ku-band antenna will generate a higher data rate and will be designed with an embedded pointing algorithm to guarantee that the antenna is pointed directly at TDRS. This algorithm will utilize the onboard position and attitude data to point the antenna to TDRS within a 2-degree full-angle beamwidth. This report investigates how errors in aircraft position and attitude, along with errors in satellite position, propagate into the overall pointing vector.

Carney, Michael P.↗

Assessing the Performance Limits of Internal Coronagraphs Through End-to-End Modeling

As part of the NASA ROSES Technology Demonstrations for Exoplanet Missions (TDEM) program, we conducted a numerical modeling study of three internal coronagraphs (PIAA, vector vortex, hybrid bandlimited) to understand their behaviors in realistically-aberrated systems with wavefront control (deformable mirrors). This investigation consisted of two milestones: (1) develop wavefront propagation codes appropriate for each coronagraph that are accurate to 1% or better (compared to a reference algorithm) but are also time and memory efficient, and (2) use these codes to determine the wavefront control limits of each architecture. We discuss here how the milestones were met and identify some of the behaviors particular to each coronagraph. The codes developed in this study are being made available for community use. We discuss here results for the HBLC and VVC systems, with PIAA having been discussed in a previous proceeding.

Inner working angle (IWA)↗

A model of asynchronous iterative algorithms for solving large, sparse, linear systems

Solving large, sparse, linear systems of equations is one of the fundamental problems in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. This model is then analyzed to determine the expected intertask data transfer and task computational complexity as functions of the number of tasks. Based on the analysis, recommendations for task partitioning are made. These recommendations are a function of the sparseness of the linear system, its structure (i.e., randomly sparse or banded), and dimension.

Reed, D. A.↗

Parallel Implicit Algorithms for CFD

The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.

Keyes, David E.↗