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 955 records · Page 53

A Study of QCD Radiation in VBF Higgs Production with Vincia and Pythia

We discuss and illustrate the properties of several parton-shower algorithms available in Pythia and Vincia, in the context of Higgs production via vector boson fusion (VBF). In particular, the distinctive colour topology of VBF processes allows to define observables sensitive to the coherent radiation pattern of additional jets. We study a set of such observables, using the Vincia sector-antenna shower as our main reference, and contrast it to Pythia's transverse-momentum-ordered DGLAP shower as well as Pythia's dipole-improved shower. We then investigate the robustness of these predictions as successive levels of higher-order perturbative matrix elements are incorporated, including next-to-leading-order matched and tree-level merged calculations, using Powheg Box and Sherpa respectively to generate the hard events.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Energy-Efficient Neuromorphic Architectures for Nuclear Radiation Detection Applications

A comprehensive analysis and simulation of two memristor-based neuromorphic architectures for nuclear radiation detection is presented. Both scalable architectures retrofit a locally competitive algorithm to solve overcomplete sparse approximation problems by harnessing memristor crossbar execution of vector–matrix multiplications. The proposed systems demonstrate excellent accuracy and throughput while consuming minimal energy for radionuclide detection. To ensure that the simulation results of our proposed hardware are realistic, the memristor parameters are chosen from our own fabricated memristor devices. Based on these results, we conclude that memristor-based computing is the preeminent technology for a radiation detection platform.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Distribution of mica polytypes among space groups.

All the possible space groups for mica polytypes are deduced by making use of the characteristics of the mica unit layer and stacking mode. The algebraic properties of the vector-stacking symbol of Ross et al. (1966) are examined, and a simple algorithm for deducing the space group from this symbol is presented. A method considered for enumerating all possible stacking sequences of mica polytypes makes use of a computer.

Takeda, H.↗

Three-dimensional computational aerodynamics in the 1980's

The future requirements for constructing codes that can be used to compute three-dimensional flows about aerodynamic shapes should be assessed in light of the constraints imposed by future computer architectures and the reality of usable algorithms that can provide practical three-dimensional simulations. On the hardware side, vector processing is inevitable in order to meet the CPU speeds required. To cope with three-dimensional geometries, massive data bases with fetch/store conflicts and transposition problems are inevitable. On the software side, codes must be prepared that: (1) can be adapted to complex geometries, (2) can (at the very least) predict the location of laminar and turbulent boundary layer separation, and (3) will converge rapidly to sufficiently accurate solutions.

Lomax, H.↗

A vectorization of the Jameson-Caughey NYU transonic swept-wing computer program FLO-22-V1 for the STAR-100 computer

The computer program FLO-22 for analyzing inviscid transonic flow past 3-D swept-wing configurations was modified to use vector operations and run on the STAR-100 computer. The vectorized version described herein was called FLO-22-V1. Vector operations were incorporated into Successive Line Over-Relaxation in the transformed horizontal direction. Vector relational operations and control vectors were used to implement upwind differencing at supersonic points. A high speed of computation and extended grid domain were characteristics of FLO-22-V1. The new program was not the optimal vectorization of Successive Line Over-Relaxation applied to transonic flow; however, it proved that vector operations can readily be implemented to increase the computation rate of the algorithm.

Smith, R. E.↗

A Taylor-Galerkin finite element algorithm for transient nonlinear thermal-structural analysis

A Taylor-Galerkin finite element method for solving large, nonlinear thermal-structural problems is presented. The algorithm is formulated for coupled transient and uncoupled quasistatic thermal-structural problems. Vectorizing strategies ensure computational efficiency. Two applications demonstrate the validity of the approach for analyzing transient and quasistatic thermal-structural problems.

Thornton, E. A.↗

A Taylor-Galerkin finite element algorithm for transient nonlinear thermal-structural analysis

A Taylor-Galerkin finite element method for solving large, nonlinear thermal-structural problems is presented. The algorithm is formulated for coupled transient and uncoupled quasistatic thermal-structural problems. Vectorizing strategies ensure computational efficiency. Two applications demonstrate the validity of the approach for analyzing transient and quasistatic thermal-structural problems.

Thornton, E. A.↗

Comparison between the PISO algorithm and preconditioning methods for compressible flow

Two widely used family of algorithms, pressure-based and density-based methods, have been developed for computational fluid dynamics (CFD) problems over the years. Pressure-based methods (such as SIMPLE and PISO) use a Poisson-like equation for updating pressure instead of the continuity equation, while density-based methods use the continuity equation to update density (an equation of state is used to provide density in pressure based schemes and pressure in density based schemes). Pressure-based methods were developed originally for incompressible flows at low Reynolds numbers and were then extended to high Reynolds numbers and compressible applications. On the other hand, density based methods were originally developed for transonic flows and have been extended down to low Mach numbers through the use of preconditioning techniques. We compare these two very different approaches to solving the Navier-Stokes equations in order to gain an understanding of their similarities and differences. Specifically, we consider the PISO scheme as a representative pressure-based method and contrast it with a recently developed preconditioning scheme. We also compare the relative performance of the PISO algorithm with a Euler implicit algorithm that is employed to solve the preconditioned equations by means of a vector stability analysis.

Merkle, Charles L.↗

Numerical Procedures for Inlet/Diffuser/Nozzle Flows

Two primitive variable, pressure based, flux-split, RNS/NS solution procedures for viscous flows are presented. Both methods are uniformly valid across the full Mach number range, Le., from the incompressible limit to high supersonic speeds. The first method is an 'optimized' version of a previously developed global pressure relaxation RNS procedure. Considerable reduction in the number of relatively expensive matrix inversion, and thereby in the computational time, has been achieved with this procedure. CPU times are reduced by a factor of 15 for predominantly elliptic flows (incompressible and low subsonic). The second method is a time-marching, 'linearized' convection RNS/NS procedure. The key to the efficiency of this procedure is the reduction to a single LU inversion at the inflow cross-plane. The remainder of the algorithm simply requires back-substitution with this LU and the corresponding residual vector at any cross-plane location. This method is not time-consistent, but has a convective-type CFL stability limitation. Both formulations are robust and provide accurate solutions for a variety of internal viscous flows to be provided herein.

Rubin, Stanley G.↗

Statistical Study of the Properties of Magnetosheath Lion Roars

Lion roars are narrowband whistler wave emissions that have been observed in several environments, such as planetary magnetosheaths, the Earth's magnetosphere, the solar wind, downstream of interplanetary shocks, and the cusp region. We present measurements of more than 30,000 such emissions observed by the Magnetospheric Multiscale spacecraft with high‐cadence (8,192 samples/s) search coil magnetometer data. A semiautomatic algorithm was used to identify the emissions, and an adaptive interval algorithm in conjunction with minimum variance analysis was used to determine their wave vector. The properties of the waves are determined in both the spacecraft and plasma rest frame. The mean wave normal angle, with respect to the background magnetic field (B(sub 0)), plasma bulk flow velocity (V(sub b)), and the coplanarity plane (V(sub b) × B(sub 0)) are 23°, 56°, and 0°, respectively. The average peak frequencies were ∼31% of the electron gyrofrequency (ω(sub ce)) observed in the spacecraft frame and ∼18% of ω(sub ce) in the plasma rest frame. In the spacecraft frame, ∼99% of the emissions had a frequency <ω(sub ce), while 98% had a peak frequency <0.72 ω(sub ce) in the plasma rest frame. None of the waves had frequencies lower than the lower hybrid frequency, ω. From the probability density function of the electron plasma β(sub e), the ratio between the electron thermal and magnetic pressure, ∼99.6% of the waves were observed with β(sub e)<4 with a large narrow peak at 0.07 and two smaller, but wider, peaks at 1.26 and 2.28, while the average value was ∼1.25.

Magnetosheath emissions↗

First-Order Runtime Verification using BDDs

Runtime Verification (RV) expedites the analyses of execution traces for detecting system errors and for statistical and quality analysis. Having started modestly, with checking temporal properties that are based on propositional (yes/no) values, the current practice of RV often involves properties that are parametrized by the data observed in the input trace. The specifications are based on various formalisms, such as automata, temporal logics, rule systems, and stream processing. Checking execution traces that are data intensive against a specification that imposes strong dependencies between the data, poses a nontrivial challenges; in particular if runtime verification has to be performed online, while many events that carry data appear within small time proximities. Towards achieving this goal, it was recently suggested to represent relations over the observed data values, based on BDDs, where data elements are enumerated and then converted into bit vectors. This representation provided a very simple and natural extension of an RV algorithm from propositional to first-order LTL, but more importantly, was shown to contribute to the memory compactness and to the speed, as was demonstrated using a corresponding implementation. We extend here the capabilities of BDD-based RV with the ability to express timing constraints, where the monitored events include (integer) clock values. We show how to efficiently operate on BDDs that represent both relations on (enumerations of) values and time dependencies, as required by the addition of the time constraints. We demonstrate our algorithm with an efficient implementation and provide experimental results.

Peled, Doron↗

GOTTCHA, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions. In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure. During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably. During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.

Freitas, Tracey↗

The symmetric quasi-classical model using on-the-fly time-dependent density functional theory within the Tamm–Dancoff approximation

The primary computational challenge when simulating nonadiabatic ab initio molecular dynamics is the unfavourable compute costs of electronic structure calculations with molecular size. Simple electronic structure theories, like time-dependent density functional theory within the Tamm–Dancoff approximation (TDDFT/TDA), alleviate this cost for moderately sized molecular systems simulated on realistic time scales. Although TDDFT/TDA does have some limitations in accuracy, an appealing feature is that, in addition to including electron correlation through the use of a density functional, the cost of calculating analytic nuclear gradients and nonadiabatic coupling vectors is often computationally feasible even for moderately sized basis sets. Here in this work, some of the benefits and limitations of TDDFT/TDA are discussed and analysed with regard to its applicability as a ‘back-end’ electronic structure method for the symmetric quasi-classical Meyer–Miller model (SQC/MM). In order to investigate the benefits and limitations of TDDFT/TDA, SQC/MM is employed to predict and analyse a prototypical example of excited-state hydrogen transfer in gas-phase malonaldehyde. Then, the ring-opening dynamics of selenophene are simulated, which highlight some of the deficiencies of TDDFT/TDA. Additionally, some new algorithms are proposed that speed up the calculation of analytic nuclear gradients and nonadiabatic coupling vectors for a set of excited electronic states.

molecular dynamics↗

Modular Environment for Graph Research and Analysis with a Persistent

The MEGRAPHS software package provides a front-end to graphs and vectors residing on special-purpose computing resources. It allows these data objects to be instantiated, destroyed, and manipulated. A variety of primitives needed for typical graph analyses are provided. An example program illustrating how MEGRAPHS can be used to implement a PageRank computation is included in the distribution.The MEGRAPHS software package is targeted towards developers of graph algorithms. Programmers using MEGRAPHS would write graph analysis programs in terms of high-level graph and vector operations. These computations are transparently executed on the Cray XMT compute nodes.

JANSSEN, CURTIS↗

Modular Environment for Graph Research and Analysis with a Persistent

The MEGRAPHS software package provides a front-end to graphs and vectors residing on special-purpose computing resources. It allows these data objects to be instantiated, destroyed, and manipulated. A variety of primitives needed for typical graph analyses are provided. An example program illustrating how MEGRAPHS can be used to implement a PageRank computation is included in the distribution.The MEGRAPHS software package is targeted towards developers of graph algorithms. Programmers using MEGRAPHS would write graph analysis programs in terms of high-level graph and vector operations. These computations are transparently executed on the Cray XMT compute nodes.

JANSSEN, CURTIS↗

A Design Study of Onboard Navigation and Guidance During Aerocapture at Mars

The navigation and guidance of a high lift-to-drag ratio sample return vehicle during aerocapture at Mars are investigated. Emphasis is placed on integrated systems design, with guidance algorithm synthesis and analysis based on vehicle state and atmospheric density uncertainty estimates provided by the navigation system. The latter utilizes a Kalman filter for state vector estimation, with useful update information obtained through radar altimeter measurements and density altitude measurements based on IMU-measured drag acceleration. A three-phase guidance algorithm, featuring constant bank numeric predictor/corrector atmospheric capture and exit phases and an extended constant altitude cruise phase, is developed to provide controlled capture and depletion of orbital energy, orbital plane control, and exit apoapsis control. Integrated navigation and guidance systems performance are analyzed using a four degree-of-freedom computer simulation. The simulation environment includes an atmospheric density model with spatially correlated perturbations to provide realistic variations over the vehicle trajectory. Navigation filter initial conditions for the analysis are based on planetary approach optical navigation results. Results from a selection of test cases are presented to give insight into systems performance.

Fuhry, Douglas Paul↗

Skyline based terrain matching

Skyline-based terrain matching, a new method for locating the vantage point of stereo camera or laser range-finding measurements on a global map previously prepared by satellite or aerial mapping is described. The orientation of the vantage is assumed known, but its translational parameters are determined by the algorithm. Skylines, or occluding contours, can be extracted from the sensory measurements taken by an autonomous vehicle. They can also be modeled from the global map, given a vantage estimate from which to start. The two sets of skylines, represented in cylindrical coordinates about either the true or the estimated vantage, are employed as 'features' or reference objects common to both sources of information. The terrain matching problem is formulated in terms of finding a translation between the respective representations of the skylines, by approximating the two sets of skylines as identical features (curves) on the actual terrain. The search for this translation is based on selecting the longest of the minimum-distance vectors between corresponding curves from the two sets of skylines. In successive iterations of the algorithm, the approximation that the two sets of curves are identical becomes more accurate, and the vantage estimate continues to improve. The algorithm was implemented and evaluated on a simulated terrain. Illustrations and examples are included.

Page, Lance A.↗