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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Development of Fast Algorithms Using Recursion, Nesting and Iterations for Computational Electromagnetics

In the first phase of our work, we have concentrated on laying the foundation to develop fast algorithms, including the use of recursive structure like the recursive aggregate interaction matrix algorithm (RAIMA), the nested equivalence principle algorithm (NEPAL), the ray-propagation fast multipole algorithm (RPFMA), and the multi-level fast multipole algorithm (MLFMA). We have also investigated the use of curvilinear patches to build a basic method of moments code where these acceleration techniques can be used later. In the second phase, which is mainly reported on here, we have concentrated on implementing three-dimensional NEPAL on a massively parallel machine, the Connection Machine CM-5, and have been able to obtain some 3D scattering results. In order to understand the parallelization of codes on the Connection Machine, we have also studied the parallelization of 3D finite-difference time-domain (FDTD) code with PML material absorbing boundary condition (ABC). We found that simple algorithms like the FDTD with material ABC can be parallelized very well allowing us to solve within a minute a problem of over a million nodes. In addition, we have studied the use of the fast multipole method and the ray-propagation fast multipole algorithm to expedite matrix-vector multiplication in a conjugate-gradient solution to integral equations of scattering. We find that these methods are faster than LU decomposition for one incident angle, but are slower than LU decomposition when many incident angles are needed as in the monostatic RCS calculations.

Chew, W. C.↗
NASA NTRS1997

Communication Improvement for the LU NAS Parallel Benchmark: A Model for Efficient Parallel Relaxation Schemes

The first release of the MPI version of the LU NAS Parallel Benchmark (NPB2.0) performed poorly compared to its companion NPB2.0 codes. The later LU release (NPB2.1 & 2.2) runs up to two and a half times faster, thanks to a revised point access scheme and related communications scheme. The new scheme sends substantially fewer messages. is cache "friendly", and has a better load balance. We detail the, observations and modifications that resulted in this efficiency improvement, and show that the poor behavior of the original code resulted from deriving a message passing scheme from an algorithm originally devised for a vector architecture.

Yarrow, Maurice↗
NASA NTRS2004

Visual data mining for quantized spatial data

In previous papers we've shown how a well known data compression algorithm called Entropy-constrained Vector Quantization ( can be modified to reduce the size and complexity of very large, satellite data sets. In this paper, we descuss how to visualize and understand the content of such reduced data sets.

cluster analysis↗
NASA NTRS2006

Realistic Covariance Prediction For the Earth Science Constellations

Routine satellite operations for the Earth Science Constellations (ESC) include collision risk assessment between members of the constellations and other orbiting space objects. One component of the risk assessment process is computing the collision probability between two space objects. The collision probability is computed via Monte Carlo techniques as well as numerically integrating relative probability density functions. Each algorithm takes as inputs state vector and state vector uncertainty information for both objects. The state vector uncertainty information is expressed in terms of a covariance matrix. The collision probability computation is only as good as the inputs. Therefore, to obtain a collision calculation that is a useful decision-making metric, realistic covariance matrices must be used as inputs to the calculation. This paper describes the process used by NASA Goddard's Earth Science Mission Operations Project to generate realistic covariance predictions for three of the ESC satellites: Aqua, Aura, and Terra

Duncan, Matthew↗
NASA NTRS2006

Realistic Covariance Prediction for the Earth Science Constellation

Routine satellite operations for the Earth Science Constellation (ESC) include collision risk assessment between members of the constellation and other orbiting space objects. One component of the risk assessment process is computing the collision probability between two space objects. The collision probability is computed using Monte Carlo techniques as well as by numerically integrating relative state probability density functions. Each algorithm takes as inputs state vector and state vector uncertainty information for both objects. The state vector uncertainty information is expressed in terms of a covariance matrix. The collision probability computation is only as good as the inputs. Therefore, to obtain a collision calculation that is a useful decision-making metric, realistic covariance matrices must be used as inputs to the calculation. This paper describes the process used by the NASA/Goddard Space Flight Center's Earth Science Mission Operations Project to generate realistic covariance predictions for three of the Earth Science Constellation satellites: Aqua, Aura and Terra.

Duncan, Matthew↗
NASA NTRS2013

3D Radiative Transfer Effects in Multi-Angle/Multi-Spectral Radio-Polarimetric Signals from a Mixture of Clouds and Aerosols Viewed by a Non-Imaging Sensor

When observing a spatially complex mix of aerosols and clouds in a single relatively large field-of-view, nature entangles their signals non-linearly through polarized radiation transport processes that unfold in the 3D position and direction spaces. In contrast, any practical forward model in a retrieval algorithm will use only 1D vector radiative transfer (vRT) in a linear mixing technique. We assess the difference between the observed and predicted signals using synthetic data from a high-fidelity 3D vRT model with clouds generated using a Large Eddy Simulation model and an aerosol climatology. We find that this difference is signal--not noise--for the Aerosol Polarimetry Sensor (APS), an instrument developed by NASA. Moreover, the worst case scenario is also the most interesting case, namely, when the aerosol burden is large, hence hase the most impact on the cloud microphysics and dynamics. Based on our findings, we formulate a mitigation strategy for these unresolved cloud adjacency effects assuming that some spatial information is available about the structure of the clouds at higher resolution from "context" cameras, as was planned for NASA's ill-fated Glory mission that was to carry the APS but failed to reach orbit. Application to POLDER (POLarization and Directionality of Earth Reflectances) data from the period when PARASOL (Polarization and Anisotropy of Reflectances for Atmospheric Sciences coupled with Observations from a Lidar) was in the A-train is briefly discussed.

APS↗
NASA NTRS2020

Reaching for 20 Years with the IMERG Multi-Satellite Products

The latest releases of Global Precipitation Measurement (GPM) mission products cap five years of vigorous development cycle since the launch of the GPM Core Observatory, and these now provide datasets that are relatively homogeneous across the joint Tropical Rainfall Measuring Mission (TRMM) and GPM eras. Version 06 of the U.S. GPM team's Integrated Multi-satellitE Retrievals for GPM (IMERG) merged precipitation product enforces a consistent intercalibration for all precipitation products computed from individual satellites with the TRMM and GPM Core Observatory sensors as the TRMM- and GPM era calibrators, respectively, and incorporates monthly surface gauge data. The basic IMERG algorithm now features precipitation motion vectors (used to drive the Lagrangian interpolation, or "morphing") that arecomputed by tracking vertically integrated vapor fields analyzed in MERRA2 and GEOS5. This innovation provides globally complete coverage, expanding IMERG's coverage beyond the 60°N-S latitude band provided by IR-based vectors, although we continue to mask out precipitation over snowy/icy surfaces as unreliable. A second innovation is the Quality Index (QI) data field. The half-hourly QI is taken as the approximate Kalman Filter correlation computed in the morphing calculation.

Huffman, George J.↗
NASA NTRSDate not supplied

Predicting Airport Runway Configurations for Decision-Support Using Supervised Learning

One of the most challenging tasks for air traffic controllers is runway configuration management (RCM). It deals with the optimal selection of runways to operate on (for arrivals and departures) based on traffic, surface wind speed, wind direction, other environmental variables, noise constraints, and several other airport-specific factors. It affects the efficiency of the National Airspace System (NAS) and both surface and airspace operations can benefit from better understanding future runway configurations. In this paper, we present a comprehensive implementation of predictive models for runway configuration estimation from large volumes of historical data. Specifically, operational data from two full years (2018 and 2019) is collected, analyzed, and fused together to build the data product used in this work. The data set differs from prior work in the field in terms of its scope, resolution, and variety of factors collected and considered. Meteorological data is collected from two different sources – current weather conditions from METAR (Meteorological Terminal Aviation Routine Weather Report) and forecast weather conditions from Localized Aviation MOS Program (LAMP). Operational data from the Federal Aviation Administration (FAA) Aviation System Performance Metrics (ASPM) related to scheduled and actual number of arrivals and departures, average taxi times, etc. are collected. NASA’s Sherlock Data Warehouse is used to identify critical information such as go-arounds, and other events that might impact RCM decision-making. All data is collected and aggregated over 15-minute intervals throughout the two years. This provides a resolution like the timescales that might be necessary for runway configuration management decision-making. A variety of supervised learning algorithms are tested including Support Vector Machine, Random Forest, Gradient Boosting, etc. including tuning of the model hyperparameters. The modeling process is applied and presented on two representative U.S. airports – Charlotte Douglas International Airport (KCLT) and Denver International Airport (KDEN). The two airports present different levels of complexity in terms of the total number of configurations used and provide a balanced perspective on the generalizability of the developed approach to other airports in the NAS. Initial results are promising (F1 score of 0.91 at KCLT and 0.83 at KDEN) for data in the test set. The final paper will contain a comprehensive comparison between different models and model building strategies as well as further refined results. Most important predictors for each airport will be identified along with a discussion and recommendations on adapting the framework to other scenarios.

Tejas G Puranik↗
NASA NTRSDate not supplied

A Method for Obtaining Surface Flow Vectors and Its Implementation in Interferometric Skin Friction Measurement

A new method was developed to extract surface flow vectors from an oilflow visualization image that has oil streaklines. The method is analogous to the PIV processing where the image is divided into interrogation windows. A representative flow direction is obtained for each interrogation window using image processing with a line-detection algorithm. Repeating the process for the entire image, one can find the surface vector field. The Hough transformation, Radon transformation and Machine Learning were used as line-detection algorithms. The obtained vector field is then postprocessed to filter spurious vectors and to apply smoothing. The method was tested on 2D and 3D models with different flow complexities. The method was able to predict surface flow vectors for all cases tested. The predicted surface flow vectors were used in obtaining the surface skin friction. The successful implementation of the surface flow vectors enables interferometric skin friction measurements on surfaces beneath 3D complex flows. In addition, the surface flow vectors can be superimposed on the oilflow visualization images to better explain the surface flow topology.

Surface flow vectors↗
NASA NTRSDate not supplied

A Method for Obtaining Surface Flow Vectors and Its Implementation in Interferometric Skin Friction Measurement

A new method was developed to extract surface flow vectors from an oilflow visualization image that has oil streaklines. The method is analogous to the PIV processing where the image is divided into interrogation windows. A representative flow direction is obtained for each interrogation window using image processing with a line-detection algorithm. Repeating the process for the entire image, one can find the surface vector field. The Hough transformation, Radon transformation and Machine Learning were used as line-detection algorithms. The obtained vector field is then postprocessed to filter spurious vectors and to apply smoothing. The method was tested on 2D and 3D models with different flow complexities. The method was able to predict surface flow vectors for all cases tested. The predicted surface flow vectors were used in obtaining the surface skin friction. The successful implementation of the surface flow vectors enables interferometric skin friction measurements on surfaces beneath 3D complex flows. In addition, the surface flow vectors can be superimposed on the oilflow visualization images to better explain the surface flow topology.

Surface flow vectors↗
NASA NTRS2015

Retrieval of Aerosol Microphysical Properties from AERONET Photo-Polarimetric Measurements. 2: A New Research Algorithm and Case Demonstration

A new research algorithm is presented here as the second part of a two-part study to retrieve aerosol microphysical properties from the multispectral and multiangular photopolarimetric measurements taken by Aerosol Robotic Network's (AERONET's) new-generation Sun photometer. The algorithm uses an advanced UNified and Linearized Vector Radiative Transfer Model and incorporates a statistical optimization approach.While the new algorithmhas heritage from AERONET operational inversion algorithm in constraining a priori and retrieval smoothness, it has two new features. First, the new algorithmretrieves the effective radius, effective variance, and total volume of aerosols associated with a continuous bimodal particle size distribution (PSD) function, while the AERONET operational algorithm retrieves aerosol volume over 22 size bins. Second, our algorithm retrieves complex refractive indices for both fine and coarsemodes,while the AERONET operational algorithm assumes a size-independent aerosol refractive index. Mode-resolved refractive indices can improve the estimate of the single-scattering albedo (SSA) for each aerosol mode and thus facilitate the validation of satellite products and chemistry transport models. We applied the algorithm to a suite of real cases over Beijing_RADI site and found that our retrievals are overall consistent with AERONET operational inversions but can offer mode-resolved refractive index and SSA with acceptable accuracy for the aerosol composed by spherical particles. Along with the retrieval using both radiance and polarization, we also performed radiance-only retrieval to demonstrate the improvements by adding polarization in the inversion. Contrast analysis indicates that with polarization, retrieval error can be reduced by over 50% in PSD parameters, 10-30% in the refractive index, and 10-40% in SSA, which is consistent with theoretical analysis presented in the companion paper of this two-part study.

aerosol retrieval algorithm↗
NASA NTRS1983

New syndrome decoder for (n, 1) convolutional codes

The letter presents a new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck. The new technique uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). A recursive, Viterbi-like, algorithm is developed to find the minimum weight error vector E(D). An example is given for the binary nonsystematic (2, 1) CC.

Reed, I. S.↗
NASA NTRSDate not supplied

PACE Microphysical Aerosol Properties from Polarimetry (PACE-MAPP)

We present the Plankton, Aerosols, Clouds and Ecosystems Microphysical Aerosol Properties from Polarimetry (PACE-MAPP) polarimetric remote sensing algorithm developed for the newly launched NASA PACE satellite observing system. The objective of PACE-MAPP is to retrieve detailed fine-mode (marine, pollution and smoke) and coarse-mode (sea-salt and dust) aerosol properties over the ocean for a range of light to heavy aerosol loadings using PACE’s polarimetric-imaging capabilities at multiple angles and wavelengths from the ultraviolet (UV) to the near-infrared (NIR). An additional objective for PACE-MAPP is to discriminate aerosols from thin clouds. The PACE-MAPP polarimetric remote sensing retrieval algorithm uses coupled atmosphere-ocean vector radiative transfer, optimal estimation, artificial intelligence and powerful inherent optical property look-up-tables for the Earth’s aerosol, cloud, and hydrosol particles. PACE-MAPP is the only retrieval algorithm designed to invert aerosol/ocean products using both polarimeters onboard PACE. We present results using PACE-MAPP to retrieve aerosol and ocean remote sensing products from measurements by the Hyper-Angular Rainbow Polarimeter #2 (HARP2) and Spectro-polarimeter for Planetary Exploration one (SPEXone) polarimeter instruments onboard PACE.

Snorre Stamnes↗
DOE OSTI2024

Localized Evaluation for Constructing Discrete Vector Fields

Topological abstractions offer a method to summarize the behavior of vector fields, but computing them robustly can be challenging due to numerical precision issues. One alternative is to represent the vector field using a discrete approach, which constructs a collection of pairs of simplices in the input mesh that satisfies criteria introduced by Forman's discrete Morse theory. While numerous approaches exist to compute pairs in the restricted case of the gradient of a scalar field, state-of-the-art algorithms for the general case of vector fields require expensive optimization procedures. This paper introduces a fast, novel approach for pairing simplices of two-dimensional, triangulated vector fields that do not vary in time. The key insight of our approach is that we can employ a local evaluation, inspired by the approach used to construct a discrete gradient field, where every simplex in a mesh is considered by no more than one of its vertices. Specifically, we observe that for any edge in the input mesh, we can uniquely assign an outward direction of flow. We can further expand this consistent notion of outward flow at each vertex, which corresponds to the concept of a downhill flow in the case of scalar fields. Working with outward flow enables a linear-time algorithm that processes the (outward) neighborhoods of each vertex one-by-one, similar to the approach used for scalar fields. Here, we couple our approach to constructing discrete vector fields with a method to extract, simplify, and visualize topological features. Empirical results on analytic and simulation data demonstrate drastic improvements in running time, produce features similar to the current state-of-the-art, and show the application of simplification to large, complex flows.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1975

Interpolation in numerical optimization

The present work discusses the generation of the cubic-spline interpolator in numerical optimization methods which use a variable-step integrator with step size control based on local relative truncation error. An algorithm for generating the cubic spline with successive over-relaxation is presented which represents an improvement over that given by Ralston and Wilf (1967). Rewriting the code reduces the number of N-vectors from eight to one. The algorithm is formulated in such a way that the solution of the linear system set up yields the first derivatives at the nodal points. This method is as accurate as other schemes but requires the minimum amount of storage.

Hall, K. R.↗
NASA NTRS1997

UFLIC: A Line Integral Convolution Algorithm for Visualizing Unsteady Flows

This paper presents an algorithm, UFLIC (Unsteady Flow LIC), to visualize vector data in unsteady flow fields. Using the Line Integral Convolution (LIC) as the underlying method, a new convolution algorithm is proposed that can effectively trace the flow's global features over time. The new algorithm consists of a time-accurate value depositing scheme and a successive feed-forward method. The value depositing scheme accurately models the flow advection, and the successive feed-forward method maintains the coherence between animation frames. Our new algorithm can produce time-accurate, highly coherent flow animations to highlight global features in unsteady flow fields. CFD scientists, for the first time, are able to visualize unsteady surface flows using our algorithm.

Shen, Han-Wei↗
NASA NTRS1997

Development of a Closed-Loop Strap Down Attitude System for an Ultrahigh Altitude Flight Experiment

A low-cost attitude system has been developed for an ultrahigh altitude flight experiment. The experiment uses a remotely piloted sailplane, with the wings modified for flight at altitudes greater than 100,000 ft. Mission requirements deem it necessary to measure the aircraft pitch and bank angles with accuracy better than 1.0 deg and heading with accuracy better than 5.0 deg. Vehicle cost restrictions and gross weight limits make installing a commercial inertial navigation system unfeasible. Instead, a low-cost attitude system was developed using strap down components. Monte Carlo analyses verified that two vector measurements, magnetic field and velocity, are required to completely stabilize the error equations. In the estimating algorithm, body-axis observations of the airspeed vector and the magnetic field are compared against the inertial velocity vector and a magnetic-field reference model. Residuals are fed back to stabilize integration of rate gyros. The effectiveness of the estimating algorithm was demonstrated using data from the NASA Dryden Flight Research Center Systems Research Aircraft (SRA) flight tests. The algorithm was applied with good results to a maximum 10' pitch and bank angles. Effects of wind shears were evaluated and, for most cases, can be safely ignored.

Whitmore, Stephen A.↗
NASA NTRS1997

Improvements in Block-Krylov Ritz Vectors and the Boundary Flexibility Method of Component Synthesis

A method of dynamic substructuring is presented which utilizes a set of static Ritz vectors as a replacement for normal eigenvectors in component mode synthesis. This set of Ritz vectors is generated in a recurrence relationship, proposed by Wilson, which has the form of a block-Krylov subspace. The initial seed to the recurrence algorithm is based upon the boundary flexibility vectors of the component. Improvements have been made in the formulation of the initial seed to the Krylov sequence, through the use of block-filtering. A method to shift the Krylov sequence to create Ritz vectors that will represent the dynamic behavior of the component at target frequencies, the target frequency being determined by the applied forcing functions, has been developed. A method to terminate the Krylov sequence has also been developed. Various orthonormalization schemes have been developed and evaluated, including the Cholesky/QR method. Several auxiliary theorems and proofs which illustrate issues in component mode synthesis and loss of orthogonality in the Krylov sequence have also been presented. The resulting methodology is applicable to both fixed and free- interface boundary components, and results in a general component model appropriate for any type of dynamic analysis. The accuracy is found to be comparable to that of component synthesis based upon normal modes, using fewer generalized coordinates. In addition, the block-Krylov recurrence algorithm is a series of static solutions and so requires significantly less computation than solving the normal eigenspace problem. The requirement for less vectors to form the component, coupled with the lower computational expense of calculating these Ritz vectors, combine to create a method more efficient than traditional component mode synthesis.

Carney, Kelly Scott↗