Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vector Processing”

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 163 records · Page 9

Supercomputer implementation of finite element algorithms for high speed compressible flows

Prediction of compressible flow phenomena using the finite element method is of recent origin and considerable interest. Two shock capturing finite element formulations for high speed compressible flows are described. A Taylor-Galerkin formulation uses a Taylor series expansion in time coupled with a Galerkin weighted residual statement. The Taylor-Galerkin algorithms use explicit artificial dissipation, and the performance of three dissipation models are compared. A Petrov-Galerkin algorithm has as its basis the concepts of streamline upwinding. Vectorization strategies are developed to implement the finite element formulations on the NASA Langley VPS-32. The vectorization scheme results in finite element programs that use vectors of length of the order of the number of nodes or elements. The use of the vectorization procedure speeds up processing rates by over two orders of magnitude. The Taylor-Galerkin and Petrov-Galerkin algorithms are evaluated for 2D inviscid flows on criteria such as solution accuracy, shock resolution, computational speed and storage requirements. The convergence rates for both algorithms are enhanced by local time-stepping schemes. Extension of the vectorization procedure for predicting 2D viscous and 3D inviscid flows are demonstrated. Conclusions are drawn regarding the applicability of the finite element procedures for realistic problems that require hundreds of thousands of nodes.

Thornton, E. A.↗

Use of sensitivity analysis to predict pilot performance as a function of different displays

A technique for objectively evaluating different displays by sensitivity analysis is described. First, the mathematical model used to analyze static displays is developed. The technique is based on formulating functional relationships between the state variables and the variables observable in the display. The matrix of the partial derivatives of the display variables with respect to the state variables, together with the observer's acuity function, is used to calculate expected errors in the state vector estimation. The technique is expanded by the use of Kalman filtering to process a time series of observation vectors. This provides a tool for analyzing displays of dynamic processes by means of a dynamic display evaluation computer program. Results are reported using this program to simulate an Instrument Landing System approach.

Mout, M. L.↗

Data fusion with artificial neural networks (ANN) for classification of earth surface from microwave satellite measurements

A data fusion system with artificial neural networks (ANN) is used for fast and accurate classification of five earth surface conditions and surface changes, based on seven SSMI multichannel microwave satellite measurements. The measurements include brightness temperatures at 19, 22, 37, and 85 GHz at both H and V polarizations (only V at 22 GHz). The seven channel measurements are processed through a convolution computation such that all measurements are located at same grid. Five surface classes including non-scattering surface, precipitation over land, over ocean, snow, and desert are identified from ground-truth observations. The system processes sensory data in three consecutive phases: (1) pre-processing to extract feature vectors and enhance separability among detected classes; (2) preliminary classification of Earth surface patterns using two separate and parallely acting classifiers: back-propagation neural network and binary decision tree classifiers; and (3) data fusion of results from preliminary classifiers to obtain the optimal performance in overall classification. Both the binary decision tree classifier and the fusion processing centers are implemented by neural network architectures. The fusion system configuration is a hierarchical neural network architecture, in which each functional neural net will handle different processing phases in a pipelined fashion. There is a total of around 13,500 samples for this analysis, of which 4 percent are used as the training set and 96 percent as the testing set. After training, this classification system is able to bring up the detection accuracy to 94 percent compared with 88 percent for back-propagation artificial neural networks and 80 percent for binary decision tree classifiers. The neural network data fusion classification is currently under progress to be integrated in an image processing system at NOAA and to be implemented in a prototype of a massively parallel and dynamically reconfigurable Modular Neural Ring (MNR).

Lure, Y. M. Fleming↗

Development of a Navier-Stokes algorithm for parallel-processing supercomputers

An explicit flow solver, applicable to the hierarchy of model equations ranging from Euler to full Navier-Stokes, is combined with several techniques designed to reduce computational expense. The computational domain consists of local grid refinements embedded in a global coarse mesh, where the locations of these refinements are defined by the physics of the flow. Flow characteristics are also used to determine which set of model equations is appropriate for solution in each region, thereby reducing not only the number of grid points at which the solution must be obtained, but also the computational effort required to get that solution. Acceleration to steady-state is achieved by applying multigrid on each of the subgrids, regardless of the particular model equations being solved. Since each of these components is explicit, advantage can readily be taken of the vector- and parallel-processing capabilities of machines such as the Cray X-MP and Cray-2.

Swisshelm, Julie M.↗

Development of an aerodynamics algorithm for parallel-processing supercomputers

An explicit flow solver, applicable to the hierarchy of model equations ranging from Euler to full Navier-Stokes, is combined with several techniques designed to reduce computational expense. The computational domain consists of local grid refinements embedded in a global coarse mesh, where the locations of these refinements are defined by the physics of the flow. Flow characteristics are also used to determine which set of model equations is appropriate for solution in each region, thereby reducing not only the number of grid points at which the solution must be obtained, but also the computational effort required to get that solution. Acceleration to steady-state is achieved by applying multigrid on each of the subgrids, regardless of the particular model equations being solved. Since each of these components is explicit, advantage can readily be taken of the vector- and parallel-processing capabilities of machines such as the Cray X-MP and Cray-2.

Swisshelm, Julie M.↗

Comparison of Fault Detection Algorithms for Real-time Diagnosis in Large-Scale System

In this paper, we present a review of different real-time capable algorithms to detect and isolate component failures in large-scale systems in the presence of inaccurate test results. A sequence of imperfect test results (as a row vector of I's and O's) are available to the algorithms. In this case, the problem is to recover the uncorrupted test result vector and match it to one of the rows in the test dictionary, which in turn will isolate the faults. In order to recover the uncorrupted test result vector, one needs the accuracy of each test. That is, its detection and false alarm probabilities are required. In this problem, their true values are not known and, therefore, have to be estimated online. Other major aspects in this problem are the large-scale nature and the real-time capability requirement. Test dictionaries of sizes up to 1000 x 1000 are to be handled. That is, results from 1000 tests measuring the state of 1000 components are available. However, at any time, only 10-20% of the test results are available. Then, the objective becomes the real-time fault diagnosis using incomplete and inaccurate test results with online estimation of test accuracies. It should also be noted that the test accuracies can vary with time --- one needs a mechanism to update them after processing each test result vector. Using Qualtech's TEAMS-RT (system simulation and real-time diagnosis tool), we test the performances of 1) TEAMSAT's built-in diagnosis algorithm, 2) Hamming distance based diagnosis, 3) Maximum Likelihood based diagnosis, and 4) HidderMarkov Model based diagnosis.

Kirubarajan, Thiagalingam↗

The magnetic field investigation on Cluster

The magnetic field investigation of the Cluster four-spacecraft mission is designed to provide intercalibrated measurements of the B magnetic field vector. The instrumentation and data processing of the mission are discussed. The instrumentation is identical on the four spacecraft. It consists of two triaxial fluxgate sensors and of a failure tolerant data processing unit. The combined analysis of the four spacecraft data will yield such parameters as the current density vector, wave vectors, and the geometry and structure of discontinuities.

Balogh, A.↗

Parallel-vector computation for linear structural analysis and non-linear unconstrained optimization problems

Several parallel-vector computational improvements to the unconstrained optimization procedure are described which speed up the structural analysis-synthesis process. A fast parallel-vector Choleski-based equation solver, pvsolve, is incorporated into the well-known SAP-4 general-purpose finite-element code. The new code, denoted PV-SAP, is tested for static structural analysis. Initial results on a four processor CRAY 2 show that using pvsolve reduces the equation solution time by a factor of 14-16 over the original SAP-4 code. In addition, parallel-vector procedures for the Golden Block Search technique and the BFGS method are developed and tested for nonlinear unconstrained optimization. A parallel version of an iterative solver and the pvsolve direct solver are incorporated into the BFGS method. Preliminary results on nonlinear unconstrained optimization test problems, using pvsolve in the analysis, show excellent parallel-vector performance indicating that these parallel-vector algorithms can be used in a new generation of finite-element based structural design/analysis-synthesis codes.

Nguyen, D. T.↗

The topology of the regularized integral surfaces of the 3-body problem.

A method is described by which the integral surface can be modified in such a way that Newton's equations of motion actually give a flow. The process of regularization of vector fields by surgery, as described by the author (1971) is reviewed. The planar 3-body problem and its regularization, and the topology of the integral surfaces are considered. The Lagrange-Jacobi identity is used to show that there exists an isolating block such that any orbit which ends in a triple collision must enter and remain in this block.

Easton, R.↗

A multistage time-stepping scheme for the Navier-Stokes equations

A class of explicit multistage time-stepping schemes is used to construct an algorithm for solving the compressible Navier-Stokes equations. Flexibility in treating arbitrary geometries is obtained with a finite-volume formulation. Numerical efficiency is achieved by employing techniques for accelerating convergence to steady state. Computer processing is enhanced through vectorization of the algorithm. The scheme is evaluated by solving laminar and turbulent flows over a flat plate and an NACA 0012 airfoil. Numerical results are compared with theoretical solutions or other numerical solutions and/or experimental data.

Swanson, R. C.↗

A multistage time-stepping scheme for the Navier-Stokes equations

A class of explicit multistage time-stepping schemes is used to construct an algorithm for solving the compressible Navier-Stokes equations. Flexibility in treating arbitrary geometries is obtained with a finite-volume formulation. Numerical efficiency is achieved by employing techniques for accelerating convergence to steady state. Computer processing is enhanced through vectorization of the algorithm. The scheme is evaluated by solving laminar and turbulent flows over a flat plate and an NACA 0012 airfoil. Numerical results are compared with theoretical solutions or other numerical solutions and/or experimental data.

Swanson, R. C.↗

Modeling Characteristics Of Surfaces For Radar Polarimetry

Paper reviews mathematical models of polarimetric radar backscattering characteristics of various types of terrain; forests, grasslands, and lava fields. Represents approach to imaging radar polarimetry in which one accumulates models predicting realistic polarization signatures and represent distinct scattering processes, without attempting full vector solutions of Maxwell's equations in all cases. Idea to develop ability to invert models to identify unknown terrain depicted in polarimetric radar images. Describes models, major scattering characteristics predicted by models, and interpretation of characteristics in terms of dominant scattering mechanisms. Models predict realistic polarization signatures.

Van Zyl, Jakob J.↗

Implementation details of the coupled QMR algorithm

The original quasi-minimal residual method (QMR) relies on the three-term look-ahead Lanczos process, to generate basis vectors for the underlying Krylov subspaces. However, empirical observations indicate that, in finite precision arithmetic, three-term vector recurrences are less robust than mathematically equivalent coupled two-term recurrences. Therefore, we recently proposed a new implementation of the QMR method based on a coupled two-term look-ahead Lanczos procedure. In this paper, we describe implementation details of this coupled QMR algorithm, and we present results of numerical experiments.

Freund, Roland W.↗

GPS Navigation Results from the Low Power Transceiver CANDOS Experiment on STS-107

This paper presents the Global Positioning System (GPS) navigation results from the Communications and Savigation Demonstration on Shuttle (CANDOS) experiment flown on STS- 107. The CAkDOS experiment consisted of the Low Power Transceiver (LPT) that hosted the GPS Enhanced Orbit Determination Experiment (GEODE) orbit determination software. All CANDOS test data were recovered during the mission using the LPT's Tracking and Data Relay Satellite System (TDRSS) uplinh'downlink communications capabilit! . An overview of the LPT's navigation software and the GPS experiment timeline is presented. In addition. this paper discusses GEODE performance results. including comparisons ibith the Best Estimate of Trajectory (BET). N.ASA Johnson Space Center (JSC) real-time ground navigation vectors. and post-processed solutions using the Goddard Trajectory Determination System (GTDS).

Haas, Lin↗

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↗

Municipality Level Simulations of Dengue Fever Incidence in Puerto Rico Using Ground Based and Remotely Sensed Climate Data

Dengue fever (DF) is caused by a virus transmitted between humans and Aedes genus mosquitoes through blood feeding. In recent decades incidence of the disease has drastically increased in the tropical Americas, culminating with the Pan American outbreak in 2010 which resulted in 1.7 million reported cases. In Puerto Rico dengue is endemic, however, there is significant inter‐annual, intraannual, and spatial variability in case loads. Variability in climate and the environment, herd immunity and virus genetics, and demographic characteristics may all contribute to differing patterns of transmission both spatially and temporally. Knowledge of climate influences on dengue incidence could facilitate development of early warning systems allowing public health workers to implement appropriate transmission intervention strategies. In this study, we simulate dengue incidence in several municipalities in Puerto Rico using population and meteorological data derived from ground based stations and remote sensing instruments. This data was used to drive a process based model of vector population development and virus transmission. Model parameter values for container composition, vector characteristics, and incubation period were chosen by employing a Monte Carlo approach. Multiple simulations were performed for each municipality and the results were compared with reported dengue cases. The best performing simulations were retained and their parameter values and meteorological input were compared between years and municipalities. Parameter values varied by municipality and year illustrating the complexity and sensitivity of the disease system. Local characteristics including the natural and built environment impact transmission dynamics and produce varying responses to meteorological conditions.

Remote Sensing↗

Camera Calibration and Alignment Metrology at Johnson Space Center’s Electro-Optics Laboratory

It is increasingly common to see spacecraft equipped with cameras for the purpose of navigation. Images are either sent to Earth or processed autonomously on-board to provide information about the vehicle’s position, velocity, and/or attitude. These can be images of stars or celestial bodies for absolute navigation, or images of another spacecraft for relative navigation. While monocular cameras do not provide range information, the images they capture can be processed to determine bearing vectors to target objects within the camera’s field of view. For a camera to be effective in navigation, it must be carefully calibrated and aligned. This involves accurately modeling the optical effects that govern the projection of line-of-sight directions onto the camera’s pixels and determining the camera’s orientation relative to the spacecraft’s reference frame. Engineers at Johnson Space Center’s Electro-Optics Lab regularly perform camera inspection, calibration, and alignment metrology. This was done for the Orion Optical Navigation (OpNav) Camera, the Orion Docking Camera (DCAM), and for numerous cameras belonging to commercial partners. The nature of optical navigation means that cameras must be well-calibrated and their attitude well understood to provide high accuracy bearing measurements to the navigation filter. The stringent accuracy requirements for Orion could not have been met using traditional checkerboard camera calibration or by simply relying on design drawings. This paper details the hardware, software, techniques, and algorithms used by the EOL team to achieve this level of accuracy.

Paul D Mckee↗