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

Reducing On-Board Computer Propagation Errors Due to Omitted Geopotential Terms by Judicious Selection of Uploaded State Vector

Several future, and some current missions, use an on-board computer (OBC) force model that is very limited. The OBC geopotential force model typically includes only the J(2), J(3), J(4), C(2,2) and S(2,2) terms to model non-spherical Earth gravitational effects. The Tropical Rainfall Measuring Mission (TRMM), Wide-field Infrared Explorer (WIRE), Transition Region and Coronal Explorer (TRACE), Submillimeter Wave Astronomy Satellite (SWAS), and X-ray Timing Explorer (XTE) all plan to use this geopotential force model on-board. The Solar, Anomalous, and Magnetospheric Particle Explorer (SAMPEX) is already flying this geopotential force model. Past analysis has shown that one of the leading sources of error in the OBC propagated ephemeris is the omission of the higher order geopotential terms. However, these same analyses have shown a wide range of accuracies for the OBC ephemerides. Analysis was performed using EUVE state vectors that showed the EUVE four day OBC propagated ephemerides varied in accuracy from 200 m. to 45 km. depending on the initial vector used to start the propagation. The vectors used in the study were from a single EUVE orbit at one minute intervals in the ephemeris. Since each vector propagated practically the same path as the others, the differences seen had to be due to differences in the inital state vector only. An algorithm was developed that will optimize the epoch of the uploaded state vector. Proper selection can reduce the previous errors of anywhere from 200 m. to 45 km. to generally less than one km. over four days of propagation. This would enable flight projects to minimize state vector uploads to the spacecraft. Additionally, this method is superior to other methods in that no additional orbit estimates need be done. The definitive ephemeris generated on the ground can be used as long as the proper epoch is chosen. This algorithm can be easily coded in software that would pick the epoch within a specified time range that would minimize the OBC propagation error. This techniques should greatly improve the accuracy of the OBC propagation on-board future spacecraft such as TRMM, WIRE, SWAS, and XTE without increasing complexity in the ground processing.

Greatorex, Scott↗
NASA NTRS1991

An all digital implementation of a modified Hamming net for video compression with prediction and quantization circuits

The hardware and algorithms used to vector quantize (VQ) predicted pixel intensity differences for real-time video compression are described. The hardware is designed for rapid vector quantization performance, which entails the development of application-specific associative memory circuits. A modified DPCM algorithm is originally examined to determine how neural circuitry could enhance its operation. It was determined that quantization and encoding could be improved by consolidating these two functions into one, and by increasing the amount of information (i.e. number of pixels) quantized at a time. The result is a predictive scheme that vector quantizes differential values. Some of the disadvantages of VQ algorithms are solved using associative memories. The video compression algorithm and the associative memory design are described.

Kaul, Richard↗
NASA NTRS1982

A vectorized, finite-volume, adaptive grid algorithm applied to planetary entry problems

An adaptive grid, finite-volume method has been applied to problems in planetary entry for computing complete flowfields. The adaption algorithm is implicit in nature and is keyed to resolve user specified gradients. The finite-volume algorithm is explicit, utilizing a maximum time step advancement at each grid point to accelerate convergence to the steady state. The present version of the code is for the laminar flow of a perfect gas. The role of the adaption algorithm in resolving various features of blunt body/wake flow for planetary entry conditions is emphasized.

Gnoffo, P. A.↗
NASA NTRS1987

Comparison of the MPP with other supercomputers for LANDSAT data processing

The massively parallel processor is compared to the CRAY X-MP and the CYBER-205 for LANDSAT data processing. The maximum likelihood classification algorithm is the basis for comparison since this algorithm is simple to implement and vectorizes very well. The algorithm was implemented on all three machines and tested by classifying the same full scene of LANDSAT multispectral scan data. Timings are compared as well as features of the machines and available software.

Ozga, Martin↗
NASA NTRS2011

Miniature Laser Magnetometer

A conceptual design has been developed for a miniature laser magnetometer (MLM) that will measure the scalar magnitude and vector components of near-Earth magnetic fields. The MLM incorporates a number of technical innovations to achieve high-accuracy and high-resolution performance while significantly reducing the size of the laser-pumped helium magnetometer for use on small satellites and unmanned aerial vehicles (UAVs). and electronics sections that has the capability of measuring both the scalar magnetic field magnitude and the vector magnetic field components. Further more, the high-accuracy scalar measurements are used to calibrate and correct the vector component measurements in order to achieve superior vector accuracy and stability. The correction algorithm applied to the vector components for calibration and the same cell for vector and scalar measurements are major innovations. The separate sensor and electronics section of the MLM instrument allow the sensor to be installed on a boom or otherwise located away from electronics and other noisy magnetic components. The MLM s miniaturization will be accomplished through the use of advanced miniaturized components and packaging methods for the MLM sensor and electronics. The MLM conceptual design includes three key innovations. The first is a new non-magnetic laser package that will allow the placement of the laser pump source near the helium cell sensing elements. The second innovation is the design of compact, nested, triaxial Braunbek coils used in the vector measurements that reduce the coil size by a factor of two compared to existing Helmholtz coils with similar field-generation performance. The third innovation is a compact sensor design that reduces the sensor volume by a factor of eight compared to MLM s predecessor.

Slocum, Robert↗
NASA NTRS1985

An algorithm for computing the number of distinct spectral vectors in thematic mapper data

A computationally efficient method was developed to compute the number of distinct spectral vectors and their frequency of occurrence in Landsat-4 Thematic Mapper (TM) data. The algorithm first partitions the image into spectrally disjoint subsets and then computes the frequency distribution of distinct spectral vectors within each subset from a multidimensional histogram. The overall frequency distribution is tabulated by accumulating the results from each subset. The number of distinct spectral vectors could be used as a measure of potential storage compaction of alternate data representations for data compression, or as a measure of information content in the comparison of spectral band combinations and/or spatial resolutions for an image. Results from processing three 512 x 512 pixel Landsat-4 TM images and one Landsat-4 Multispectral Scanner (MSS) image are presented as examples. An algorithm for computing the frequency distribution of distinct spectral vectors in MSS data is given in the Appendix.

Wharton, S. W.↗
NASA NTRS1996

Satellite Angular Rate Estimation From Vector Measurements

This paper presents an algorithm for estimating the angular rate vector of a satellite which is based on the time derivatives of vector measurements expressed in a reference and body coordinate. The computed derivatives are fed into a spacial Kalman filter which yields an estimate of the spacecraft angular velocity. The filter, named Extended Interlaced Kalman Filter (EIKF), is an extension of the Kalman filter which, although being linear, estimates the state of a nonlinear dynamic system. It consists of two or three parallel Kalman filters whose individual estimates are fed to one another and are considered as known inputs by the other parallel filter(s). The nonlinear dynamics stem from the nonlinear differential equation that describes the rotation of a three dimensional body. Initial results, using simulated data, and real Rossi X ray Timing Explorer (RXTE) data indicate that the algorithm is efficient and robust.

Azor, Ruth↗
NASA NTRS1987

Concurrent and vectorized mixed time, explicit nonlinear structural dynamics algorithms

A nonlinear structural dynamics program with an element library that exploits parallel processing is described. The aim is to exploit scheduling-allocation so that parallel processing and vectorization can effectively be treated in a general purpose program with explicit time integration and different time steps in different parts of the mesh. The program uses an element group scheme, which, as a by-product, also provides an automatic scheme for assigning different time steps to different parts of the mesh. The program has been tested on the Alliant FX/8; it shows a fivefold improvement in speed over compiler optimization.

Belytschko, Ted↗
NASA NTRSDate not supplied

Simultaneous Aerosol and Ocean Polarimeter Products Using Coupled Atmosphere-Ocean Vector Radiative Transfer and Neural Networks: The PACE-MAPP Algorithm

We describe the PACE-MAPP algorithm that simultaneously retrieves aerosol and ocean optical parameters using multiangle and multi-channel polarimeter measurements from the SPEXone, Hyper-Angular Rainbow Polarimeter 2 (HARP2), and Ocean Color Instrument (OCI) instruments onboard the NASA Plankton, Aerosol, Cloud, ocean Ecosystem (PACE) observing system PACE-MAPP is adapted from the Research Scanning Polarimeter (RSP) Microphysical Aerosol Properties from Polarimetry (RSP-MAPP) algorithm. A key feature of the MAPP family of algorithms is the use of a coupled vector radiative transfer model such that the atmosphere and ocean are always considered together as one system. Consequently, conservation of energy ensures that negative water-leaving radiances do not occur. PACE-MAPP uses optimal estimation to simultaneously characterize the optical and microphysical properties of aerosol and ocean constituents, find the optimal solution, and reliably account for the uncertainties of each parameter. This coupled approach, together with multiangle, multi-channel polarimeter measurements, will enable retrievals of aerosol and water properties across the Earth’s oceans. The PACE-MAPP algorithm provides aerosol and ocean products for both the open ocean and coastal areas and is designed to be accurate, modular, and efficient by using fast neural networks that replace the time-consuming vector radiative transfer calculations. We provide an overview of the PACE-MAPP framework and also describe its modular components including its aerosol and hydrosol models, ocean bio-optical models, and thin cirrus model.

Snorre Stamnes↗
NASA NTRS1997

A Predictive Attitude Determination Algorithm

In this paper, a new and efficient algorithm is developed for attitude determination from vector observations. The new algorithm, called the Predictive Attitude Determination (PAD) algorithm, is derived from a general nonlinear predictive filter approach. Traditional deterministic algorithms are shown to be suboptimal for anisotropic measurement errors. The major advantage of the PAD algorithm is that it can be easily applied to the case where anisotropic measurement errors exist. Also, an analytical expression is derived for the steady-state attitude error covariance, which is shown to be equivalent to the optimal covariance derived from maximum likelihood techniques. Simulation studies indicate that the new algorithm is able to accurately determine the attitude of a spacecraft, even for radically anisotropic measurement errors.

Markley, F. Landis↗
NASA NTRS1987

A new algorithm for the Navier-Stokes equations applied to transonic flows over wings

A new algorithm has been developed for the Navier-Stokes equations. For the convective terms, this algorithm employs flux vector splitting together with a locally rotated coordinate system that is aligned with the streamwise direction. The algorithm has been implemented into a Navier-Stokes code, the NASA Ames Research Center's TNS code, and several cases of steady flow have been calculated. The results show improvements over the original method in the code. First, in a case of separated flow, there is better agreement with the experimental results and also there is an absence of numerical oscillations that occur with the original method. Second, in a case with a strong supersonic to subsonic shock wave, comparisons show an improvement in the resolution of the shock wave and the reexpansion singularity.

Goorjian, Peter M.↗
NASA NTRS2009

Evaluating Algorithm Performance Metrics Tailored for Prognostics

Prognostics has taken a center stage in Condition Based Maintenance (CBM) where it is desired to estimate Remaining Useful Life (RUL) of the system so that remedial measures may be taken in advance to avoid catastrophic events or unwanted downtimes. Validation of such predictions is an important but difficult proposition and a lack of appropriate evaluation methods renders prognostics meaningless. Evaluation methods currently used in the research community are not standardized and in many cases do not sufficiently assess key performance aspects expected out of a prognostics algorithm. In this paper we introduce several new evaluation metrics tailored for prognostics and show that they can effectively evaluate various algorithms as compared to other conventional metrics. Specifically four algorithms namely; Relevance Vector Machine (RVM), Gaussian Process Regression (GPR), Artificial Neural Network (ANN), and Polynomial Regression (PR) are compared. These algorithms vary in complexity and their ability to manage uncertainty around predicted estimates. Results show that the new metrics rank these algorithms in different manner and depending on the requirements and constraints suitable metrics may be chosen. Beyond these results, these metrics offer ideas about how metrics suitable to prognostics may be designed so that the evaluation procedure can be standardized. 1

Saxena, Abhinav↗
NASA NTRS1992

Matrix-vector multiplication using digital partitioning for more accurate optical computing

Digital partitioning offers a flexible means of increasing the accuracy of an optical matrix-vector processor. This algorithm can be implemented with the same architecture required for a purely analog processor, which gives optical matrix-vector processors the ability to perform high-accuracy calculations at speeds comparable with or greater than electronic computers as well as the ability to perform analog operations at a much greater speed. Digital partitioning is compared with digital multiplication by analog convolution, residue number systems, and redundant number representation in terms of the size and the speed required for an equivalent throughput as well as in terms of the hardware requirements. Digital partitioning and digital multiplication by analog convolution are found to be the most efficient alogrithms if coding time and hardware are considered, and the architecture for digital partitioning permits the use of analog computations to provide the greatest throughput for a single processor.

Gary, C. K.↗
NASA NTRS1992

Unsteady turbomachinery flow simulations on massively parallel architectures

The accurate numerical simulation of unsteady, three-dimensional viscous flow in turbomachines is computationally very intensive, requiring prohibitively large amounts of computer time on current vector supercomputers. In recent years, computer systems based on massively parallel architectures have been developed that offer the promise of meeting the computational power requirements of such large-scale simulations. However, a rethinking of existing algorithms and methodology is required in order to fully harness the computational power of such architectures. In this paper the capabilities of the Connection Machine (CM-2) in predicting unsteady flows in turbomachines are evaluated. The implementation on the CM-2 of an implicit, time-accurate, zonal algorithm for the Navier-Stokes equations in two dimensions is described. Programming issues and modifications made to the original algorithm (developed for vector, pipelined supercomputers) in order to improve performance on the CM-2 are outlined. Algorithm performance is evaluated and compared with a functionally equivalent code for the CRAY-YMP.

Madavan, N. K.↗
NASA NTRS1996

Visualizing Vector Fields Using Line Integral Convolution and Dye Advection

We present local and global techniques to visualize three-dimensional vector field data. Using the Line Integral Convolution (LIC) method to image the global vector field, our new algorithm allows the user to introduce colored 'dye' into the vector field to highlight local flow features. A fast algorithm is proposed that quickly recomputes the dyed LIC images. In addition, we introduce volume rendering methods that can map the LIC texture on any contour surface and/or translucent region defined by additional scalar quantities, and can follow the advection of colored dye throughout the volume.

Shen, Han-Wei↗
NASA NTRS1994

An efficient system for reliably transmitting image and video data over low bit rate noisy channels

This research project is intended to develop an efficient system for reliably transmitting image and video data over low bit rate noisy channels. The basic ideas behind the proposed approach are the following: employ statistical-based image modeling to facilitate pre- and post-processing and error detection, use spare redundancy that the source compression did not remove to add robustness, and implement coded modulation to improve bandwidth efficiency and noise rejection. Over the last six months, progress has been made on various aspects of the project. Through our studies of the integrated system, a list-based iterative Trellis decoder has been developed. The decoder accepts feedback from a post-processor which can detect channel errors in the reconstructed image. The error detection is based on the Huber Markov random field image model for the compressed image. The compression scheme used here is that of JPEG (Joint Photographic Experts Group). Experiments were performed and the results are quite encouraging. The principal ideas here are extendable to other compression techniques. In addition, research was also performed on unequal error protection channel coding, subband vector quantization as a means of source coding, and post processing for reducing coding artifacts. Our studies on unequal error protection (UEP) coding for image transmission focused on examining the properties of the UEP capabilities of convolutional codes. The investigation of subband vector quantization employed a wavelet transform with special emphasis on exploiting interband redundancy. The outcome of this investigation included the development of three algorithms for subband vector quantization. The reduction of transform coding artifacts was studied with the aid of a non-Gaussian Markov random field model. This results in improved image decompression. These studies are summarized and the technical papers included in the appendices.

Costello, Daniel J., Jr.↗
NASA NTRSDate not supplied

Adaptive Learning for Reliability Analysis using Support Vector Machines

A novel algorithm is presented for adaptive learning of an unknown function that separates two regions of a domain.In the context of reliability analysis these two regions represent the failure domain, where a set of constraints or requirements are violated, and a safe domain where they are satisfied. The Limit State Function (LSF) separates these two regions. Evaluating the constraints for a given parameter point requires the evaluation of a computational model that may well be expensive. For this reason we wish to construct a meta-model that can estimate the LSFas accurately as possible, using only a limited amount of training data. This work presents an adaptive strategy employing a Support Vector Machine (SVM) as a meta-model to provide a semi-algebraic approximation of the LSF.We describe an optimization process that is used to select informative parameter points to add to training data at each iteration to improve the accuracy of this approximation. A formulation is introduced for bounding the predictions of the meta-model; in this way we seek to incorporate this aspect of Gaussian Process Models (GPMs) within anSVM meta-model. Finally, we apply our algorithm to two benchmark test cases, demonstrating performance that is comparable with, if not superior, to a standard technique for reliability analysis that employs GPMs

Adaptive learning↗
NASA NTRS1992

Recursive optimal pruning with applications to tree structured vector quantizers

A pruning algorithm of Chou et al. (1989) for designing optimal tree structures identifies only those codebooks which lie on the convex hull of the original codebook's operational distortion rate function. The authors introduce a modified version of the original algorithm, which identifies a large number of codebooks having minimum average distortion, under the constraint that, in each step, only modes having no descendents are removed from the tree. All codebooks generated by the original algorithm are also generated by this algorithm. The new algorithm generates a much larger number of codebooks in the middle- and low-rate regions. The additional codebooks permit operation near the codebook's operational distortion rate function without time sharing by choosing from the increased number of available bit rates. Despite the statistical mismatch which occurs when coding data outside the training sequence, these pruned codebooks retain their performance advantage over full search vector quantizers (VQs) for a large range of rates.

Kiang, Shei-Zein↗