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 1,027 records · Page 57

A statistical technique for determining rainfall over land employing Nimbus 6 ESMR measurements

Statistical analysis of the Nimbus 6 ESMR measurements for remote monitoring of active rainfall data over land is presented. Horizontally and vertically polarized brightness temperature pairs from ESMR 6 were sampled for areas of rainfall over land as determined from the rain recording stations and the WSR 57 radar, and wet and dry ground over the southeastern U.S. These three categories of brightness temperatures were significantly different so that the possibilities of the mean vectors of any two populations coinciding were less than 1 in 100, so that classification algorithms were then developed. The Fisher linear classifier, the Bayesian quadratic classifier, and a non-parametric linear classifier were examined, and the Bayesian algorithm performed best. It was concluded that a rainfall area delineated by the Bayesian classifier coincided well with the synoptic-scale rainfall area mapped by ground recording rain data and radar echoes.

Rodgers, E.↗

Active regions

The following efforts were completed in support of the Solar Maximum Mission (SMM): (1) the evolution of solar vector photospheric magnetic fields in a flare-producing active region was studied; (2) an algorithm was developed to generate maps of force-free magnetic field strengths at varying heights in the solar atmosphere; and (3) the study of the physical state of the material confined along entire magnetic loops was advanced with the use of magnetic field extrapolation.

Wu, S. T.↗

Effect Of Noise In The Ideal State Reconstructor

More measurements yield better estimate. Report discusses effects of measurement noise on system including linear, time-invariant plant of measurable inputs and known parameters and deterministic digital control subsystem governed by algorithm called "ideal state reconstructor." So named because in absence of noise, it exactly reconstructs vector represting state of plant, even without knowledge of initial state. Ideal state reconstructor adds no new states or eigenvalues to system; affects measurement equation only.

Polites, Michael E.↗

Model reduction and control of flexible structures using Krylov subspaces

Krylov vectors and the concept of parameter-matching are combined to develop a model reduction algorithm for a damped structural dynamics system. The reduced-order model obtained matches a certain number of low-frequency moments of the full-order system. The major application of the present method is to the control of flexible structures. It is shown that, in the control of flexible structures, there generally exist three types of control energy spillover, namely, the control spillover, the observation spillover, and dynamic spillover. The formulation based on Krylov subspaces can eliminate the control and the observation spillover, while leaving only the dynamic spillover to be considered. Two examples are used to illustrate the efficacy of the Krylov method.

Craig, Roy R., Jr.↗

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block tridiagonal matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconstant coefficients. A method was recently proposed to parallelize and vectorize BCR. In this paper, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational compelxity lower than that of parallel BCR.

Gallopoulos, E.↗

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block triangular matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconsistant coefficients. A method was recently proposed to parallelize and vectorize BCR. Here, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches, including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational complexity lower than that of parallel BCR.

Gallopoulos, E.↗

Krylov vector methods for model reduction and control of flexible structures

Krylov vectors and the concept of parameter matching are combined here to develop model-reduction algorithms for structural dynamics systems. The method is derived for a structural dynamics system described by a second-order matrix differential equation. The reduced models are shown to have a promising application in the control of flexible structures. It can eliminate control and observation spillovers while requiring only the dynamic spillover terms to be considered. A model-order reduction example and a flexible structure control example are provided to show the efficacy of the method.

Su, Tzu-Jeng↗

Massively Parallel Assimilation of TOGA/TAO and Topex/Poseidon Measurements into a Quasi Isopycnal Ocean General Circulation Model Using an Ensemble Kalman Filter

A massively parallel ensemble Kalman filter (EnKF)is used to assimilate temperature data from the TOGA/TAO array and altimetry from TOPEX/POSEIDON into a Pacific basin version of the NASA Seasonal to Interannual Prediction Project (NSIPP)ls quasi-isopycnal ocean general circulation model. The EnKF is an approximate Kalman filter in which the error-covariance propagation step is modeled by the integration of multiple instances of a numerical model. An estimate of the true error covariances is then inferred from the distribution of the ensemble of model state vectors. This inplementation of the filter takes advantage of the inherent parallelism in the EnKF algorithm by running all the model instances concurrently. The Kalman filter update step also occurs in parallel by having each processor process the observations that occur in the region of physical space for which it is responsible. The massively parallel data assimilation system is validated by withholding some of the data and then quantifying the extent to which the withheld information can be inferred from the assimilation of the remaining data. The distributions of the forecast and analysis error covariances predicted by the ENKF are also examined.

Keppenne, Christian L.↗

Background Error Covariance Estimation Using Information from a Single Model Trajectory with Application to Ocean Data Assimilation

An attractive property of ensemble data assimilation methods is that they provide flow dependent background error covariance estimates which can be used to update fields of observed variables as well as fields of unobserved model variables. Two methods to estimate background error covariances are introduced which share the above property with ensemble data assimilation methods but do not involve the integration of multiple model trajectories. Instead, all the necessary covariance information is obtained from a single model integration. The Space Adaptive Forecast error Estimation (SAFE) algorithm estimates error covariances from the spatial distribution of model variables within a single state vector. The Flow Adaptive error Statistics from a Time series (FAST) method constructs an ensemble sampled from a moving window along a model trajectory.SAFE and FAST are applied to the assimilation of Argo temperature profiles into version 4.1 of the Modular Ocean Model (MOM4.1) coupled to the GEOS-5 atmospheric model and to the CICE sea ice model. The results are validated against unassimilated Argo salinity data. They show that SAFE and FAST are competitive with the ensemble optimal interpolation (EnOI) used by the Global Modeling and Assimilation Office (GMAO) to produce its ocean analysis. Because of their reduced cost, SAFE and FAST hold promise for high-resolution data assimilation applications.

Error Covariance↗

Background Error Covariance Estimation using Information from a Single Model Trajectory with Application to Ocean Data Assimilation into the GEOS-5 Coupled Model

An attractive property of ensemble data assimilation methods is that they provide flow dependent background error covariance estimates which can be used to update fields of observed variables as well as fields of unobserved model variables. Two methods to estimate background error covariances are introduced which share the above property with ensemble data assimilation methods but do not involve the integration of multiple model trajectories. Instead, all the necessary covariance information is obtained from a single model integration. The Space Adaptive Forecast error Estimation (SAFE) algorithm estimates error covariances from the spatial distribution of model variables within a single state vector. The Flow Adaptive error Statistics from a Time series (FAST) method constructs an ensemble sampled from a moving window along a model trajectory. SAFE and FAST are applied to the assimilation of Argo temperature profiles into version 4.1 of the Modular Ocean Model (MOM4.1) coupled to the GEOS-5 atmospheric model and to the CICE sea ice model. The results are validated against unassimilated Argo salinity data. They show that SAFE and FAST are competitive with the ensemble optimal interpolation (EnOI) used by the Global Modeling and Assimilation Office (GMAO) to produce its ocean analysis. Because of their reduced cost, SAFE and FAST hold promise for high-resolution data assimilation applications.

Data Assimilation↗

Integrating Predictions for Improving Defect Classification Accuracy in NDT-based Assessment of Concrete - 20229

There is an increasing need to create predictive models for defect classification in concrete using the output of non-destructive testing (NDT) techniques. Recent advancement of machine-learning algorithms has offered several techniques for developing classification models for different types of data sets. However, the performance of these algorithms is very uncertain, mainly when applied to small and noisy datasets. For example, when human access is limited (e.g., nuclear facility), robot-based NDT is preferred. But compared to manual tests with humans present on site, the data sets are small, and more noise can exist. Therefore, it is imperative to develop new approaches to ensure a consistently high classification accuracy for inadequate data sets. This study explores the classification performance on NDT dataset using classifiers from different machine-learning algorithms, namely k-Nearest Neighbor (kNN), Decision Tree, Naive Bayes, Logistic Regression, and Support Vector Machine (SVM). The authors further integrated the predictions from these classifiers using proposed methods. The integration strategy combines the output of the classifiers based on two different measures, accuracy, and performance (ACC and PERF), using equations such as sum, average, and square-root-of-sums-of-squares (SRSS). Our results reveal varying classification accuracies across individual classifiers with different misclassifications across the test data set. The integration strategy provided significant improvement in the classification accuracy compared to the individual classifiers. Furthermore, the results indicate minimal variation across the integration methods as compared to the variation across the individual classifiers. To conclude, prediction integration offers a unique approach for combining the output of multiple classifiers to create redundancies with the potential of achieving high classification performance and improved reliability in predictive models for defect detection in concrete. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Validation of a deformable image registration technique for cone beam CT-based dose verification

Purpose: As radiation therapy evolves toward more adaptive techniques, image guidance plays an increasingly important role, not only in patient setup but also in monitoring the delivered dose and adapting the treatment to patient changes. This study aimed to validate a method for evaluation of delivered intensity modulated radiotherapy (IMRT) dose based on multimodal deformable image registration (DIR) for prostate treatments. Methods: A pelvic phantom was scanned with CT and cone-beam computed tomography (CBCT). Both images were digitally deformed using two realistic patient-based deformation fields. The original CT was then registered to the deformed CBCT resulting in a secondary deformed CT. The registration quality was assessed as the ability of the DIR method to recover the artificially induced deformations. The primary and secondary deformed CT images as well as vector fields were compared to evaluate the efficacy of the registration method and it’s suitability to be used for dose calculation. PLASTIMATCH, a free and open source software was used for deformable image registration. A B-spline algorithm with optimized parameters was used to achieve the best registration quality. Geometric image evaluation was performed through voxel-based Hounsfield unit (HU) and vector field comparison. For dosimetric evaluation, IMRT treatment plans were created and optimized on the original CT image and recomputed on the two warped images to be compared. The dose volume histograms were compared for the warped structures that were identical in both warped images. This procedure was repeated for the phantom with full, half full, and empty bladder. Results: The results indicated mean HU differences of up to 120 between registered and ground-truth deformed CT images. However, when the CBCT intensities were calibrated using a region of interest (ROI)-based calibration curve, these differences were reduced by up to 60%. Similarly, the mean differences in average vector field lengths decreased from 10.1 to 2.5 mm when CBCT was calibrated prior to registration. The results showed no dependence on the level of bladder filling. In comparison with the dose calculated on the primary deformed CT, differences in mean dose averaged over all organs were 0.2% and 3.9% for dose calculated on the secondary deformed CT with and without CBCT calibration, respectively, and 0.5% for dose calculated directly on the calibrated CBCT, for the full-bladder scenario. Gamma analysis for the distance to agreement of 2 mm and 2% of prescribed dose indicated a pass rate of 100% for both cases involving calibrated CBCT and on average 86% without CBCT calibration. Conclusions: Using deformable registration on the planning CT images to evaluate the IMRT dose based on daily CBCTs was found feasible. The proposed method will provide an accurate dose distribution using planning CT and pretreatment CBCT data, avoiding the additional uncertainties introduced by CBCT inhomogeneity and artifacts. This is a necessary initial step toward future image-guided adaptive radiotherapy of the prostate.

60 APPLIED LIFE SCIENCES↗

An efficient approach to unstructured mesh hydrodynamics on the cell broadband engine

Unstructured mesh physics for the Cell Broadband Engine (CBE) has received little or no attention to date, largely because the CBE architecture poses particular challenges for unstructured mesh algorithms. The most common SPU memory management strategies cannot be applied to the irregular memory access patterns of unstructured meshes, and the SPU vector instruction set does not support the indirect addressing needed by connectivity arrays. This paper presents an approach to unstructured mesh physics that addresses these challenges, by creating a new mesh data structure and reorganizing code to give efficient CBE performance. The approach is demonstrated on the FLAG production hydrodynamics code using standard test problems, and results show an average speedup of more than 5x over the original code.

99 GENERAL AND MISCELLANEOUS↗

Change detection for hyperspectral sensing in a transformed low-dimensional space

We present an approach to the problem of change in hyperspectral imagery that operates in a two-dimensional space. The coordinates in the space are related to Mahalanobis distances for the combined ('stacked') data and the individual hyperspectral scenes. Although it is only two-dimensional, this space is rich enough to include several well-known change detection algorithms, including the hyperbolic anomalous change detector, based on Gaussian scene clutter, and the EC-uncorrelated detector based on heavy-tailed (elliptically contoured) clutter. Because this space is only two-dimensional, adaptive machine learning methods can produce new change detectors without being stymied by the curse of dimensionality. We investigate, in particular, the utility of the support vector machine for learning boundaries in this 2-D space, and compare the performance of the resulting nonlinearly adaptjve detector to change detectors that have themselves shown good performance.

99 GENERAL AND MISCELLANEOUS↗

A fingerprint based metric for measuring similarities of crystalline structures

Measuring similarities/dissimilarities between atomic structures is important for the exploration of potential energy landscapes. However, the cell vectors together with the coordinates of the atoms, which are generally used to describe periodic systems, are quantities not directly suitable as fingerprints to distinguish structures. Based on a characterization of the local environment of all atoms in a cell, we introduce crystal fingerprints that can be calculated easily and define configurational distances between crystalline structures that satisfy the mathematical properties of a metric. This distance between two configurations is a measure of their similarity/dissimilarity and it allows in particular to distinguish structures. The new method can be a useful tool within various energy landscape exploration schemes, such as minima hopping, random search, swarm intelligence algorithms, and high-throughput screenings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

First Principles Nonadiabatic Excited-State Molecular Dynamics in NWChem

Computational simulation of non-adiabatic molecular dynamics is an indispensable tool for understanding complex photoinduced processes such as internal conversion, energy transfer, charge separation, and spatial localization of excitons, to name a few. Here, we report an implementation of the fewest-switches surface hopping algorithm in the NWChem computational chemistry program. Here the surface hopping method is combined with linear-response time-dependent density functional theory calculations of adiabatic excited state potential energy surfaces. To treat quantum transitions between arbitrary electronic Born{Oppenheimer states, we have implemented both numerical and analytical differentiation schemes for derivative non-adiabatic couplings. A numerical approach for the time-derivative non-adiabatic couplings together with an analytical method for calculating non-adiabatic coupling vectors is an efficient combination for surface hopping approaches. Additionally, electronic decoherence schemes and a state reassigned unavoided crossings algorithm are also implemented to improve the accuracy of the simulated dynamics and to handle trivial unavoided crossings. We apply our code to study the ultrafast decay of photoexcited benzene, including a detailed analysis of the potential energy surface, population decay time scales, and vibrational coordinates coupled to the excitation dynamics. The development presented in this work is a baseline for future implementations of more sophisticated frameworks for simulating of non-adiabatic molecular dynamics in NWChem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Simple algorithm for polarized parton evolution

We present an algorithm to include the correlation between the production and decay planes of gluons in a parton-shower simulation. The technique is based on identifying the charge currents responsible for the creation and annihilation of the vector field. It is applicable in both the hard-collinear and the soft wide-angle region. As a function of the number of particles, the algorithm scales linear in computing time and memory. We demonstrate agreement with fixed-order perturbative calculations in the relevant kinematical limits, and present a new observable that can be used to probe correlations beyond current-current interactions.

Höche, Stefan [Fermi National Accelerator Laborato↗

Implementation and analysis of a Navier-Stokes algorithm on parallel computers

The results of the implementation of a Navier-Stokes algorithm on three parallel/vector computers are presented. The object of this research is to determine how well, or poorly, a single numerical algorithm would map onto three different architectures. The algorithm is a compact difference scheme for the solution of the incompressible, two-dimensional, time-dependent Navier-Stokes equations. The computers were chosen so as to encompass a variety of architectures. They are the following: the MPP, an SIMD machine with 16K bit serial processors; Flex/32, an MIMD machine with 20 processors; and Cray/2. The implementation of the algorithm is discussed in relation to these architectures and measures of the performance on each machine are given. The basic comparison is among SIMD instruction parallelism on the MPP, MIMD process parallelism on the Flex/32, and vectorization of a serial code on the Cray/2. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Finally, conclusions are presented.

Fatoohi, Raad A.↗