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,225 records · Page 68

Domi

Domi (Greek for "structure") is a Trilinos package that provides support for multi-dimensional data arrays distributed over multiple processors of a high performance computing system. The software supports data arrays of arbitrary number of dimensions mapped to a multi-dimensional grid of processors. Domi provides local access to the data, as well as the ability to compute global quantities such as norms, maxima and minima. Data arrays can be constructed with boundary and communication padding, necessary for finite difference algorithms, and provides high-level methods for communicating data between processors to update these buffers. The distributed maps and vectors in Domi can be converted to the equivalent data structures in Epetra and Tpetra (both of which assume unstructured data), using view semantics when appropriate, for use with other Trilinos solvers.

Spotz, William F.↗

A Themodynamically Consistent Fractional Visco-Elasto-Plastic Model with Memory-Dependent Damage for Anomalous Materials

We develop a thermodynamically consistent, fractional visco-elastoplastic model coupled with damage for anomalous materials. The model utilizes Scott-Blair rheological elements for both visco- elastic/plastic parts. The constitutive equations are obtained through Helmholtz free-energy potentials for Scott-Blair elements, together with a memory-dependent fractional yield function and dissipation inequalities. A memory-dependent Lemaitre-type damage is introduced through fractional damage energy release rates. For time-fractional integration of the resulting nonlinear system of equations, we develop a first-order semi-implicit fractional return-mapping algorithm. We also develop a finite-difference discretization for the fractional damage energy release rate, which results into Hankel-type matrix-vector operations for each time-step, allowing us to reduce the computational complexity from O(N 3 ) to O(N 2 ) through the use of Fast Fourier Transforms. Our numerical results demonstrate that the fractional orders for visco-elasto-plasticity play a crucial role in damage evolution, due to the competition between the anomalous plastic slip and bulk damage energy release rates.

36 MATERIALS SCIENCE↗

Studying Z/γ*+Jet Production in proton-antiproton collisions at √s = 1.96 TeV

The production of jets in association with a Z/γ* boson is an example of an important class of processes at hadron colliders, namely vector boson + jet (V + jet) production. Comparisons of measurements of this class of processes with theory predictions constitute an important, fundamental test of the Standard Model of particle physics, and of the theory of QCD in particular. While having a smaller cross section than other V +jet processes, Z/γ*(→ e + e - ) + jets production, with Z/γ* {yields} e + e - /μ + μ - , has a distinct experimental signature allowing for measurements characterized by low backgrounds and a direct, precise measurement of the properties of the decay products of the Z/γ* boson. In this thesis, several new measurements of the properties of jets produced in association with a Z/γ* boson in p$\bar{p}$ collisions at √s = 1.96 TeV are presented. The cross section for Z/γ*(→ e + e - ) + N jet production (N ≤ 3) is measured, differential in the transverse momentum of the Nth jet in the event, normalized to the inclusive Z/γ* cross section. Also, the cross section for Z/γ*(→e + e - ) + N jets (N ≥ 1) is measured, differential in the difference in azimuthal angle between the di-electron system and any jet in the event, normalized to unity. The data used in the measurements were collected by the D0 experiment located at the Tevatron Collider of the Fermi National Accelerator Laboratory and correspond to an integrated luminosity of 1.04 fb -1 . The measured jet transverse momentum spectra are compared with the predictions of perturbative calculations at the next-to-leading order in the strong coupling constant. Given the low sensitivity of the calculations to model parameters, these comparisons represent a stringent test of perturbative QCD. One of the main goals currently being pursued in particle physics is the discovery of the only particle predicted by the Standard Model which has so far no been detected experimentally, namely the Higgs boson. It is assumed that the ATLAS and CMS experiments located at the Large Hadron Collider (LHC), a proton-proton collider at √s = 14 TeV, will be able to detect the Higgs boson, or rule out its existence, within the next few years. The collisions delivered by the LHC will also be used to perform a long range of searches for other new particles, for instance particles predicted by models based on the principle of supersymmetry. The associated production of vector bosons with jets has relatively large production rates at the LHC and can produce a long list of different final states which can include charged leptons, missing transverse energy, as well as light- and heavy-flavour jets. This makes V + jet production a major source of background events to many searches for new particles. Most techniques used for estimating the expected number of background events to searches rely on passing the stable final-state particles of simulated hadron collisions generated using a so-called event generator code, through a simulation of the experimental detector system. The development of event generators which are capable of reliably predicting the properties of jets produced in association with a core process, e.g. the production of a vector boson, has been the subject of a large amount of research activity during the last ten years. These efforts have led to the appearance of the CKKW and MLM algorithms which are implemented in several event generators, among them SHERPA and ALPGEN + PYTHIA. The large data sample collected by the D0 experiment during Run II offers an excellent opportunity for validating these new event generators against experimental measurements of V + jet production. As argued above, the Z/γ*(→ e + e - ) + jets process offers the combination of a clean experimental signature and large production rates, making it the process of choice for these studies.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Chandrasekhar-type algorithms for fast recursive estimation in linear systems with constant parameters

In this recursive method proposed, the gain matrix for the Kalman filter and the convariance of the state vector are computed not via the Riccati equation, but from certain other equations. These differential equations are of Chandrasekhar-type. The 'invariant imbedding' idea resulted in the reduction of the basic boundary value problem of transport theory to an equivalent initial value system, a significant computational advance. Initial value experience showed that there is some computational savings in the method and the loss of positive definiteness of the covariance matrix is less vulnerable.

Choudhury, A. K.↗

High-accuracy computation of Delta V magnitude probability densities - Preliminary remarks

This paper describes an algorithm for the high accuracy computation of some statistical quantities of the magnitude of a random trajectory correction maneuver (TCM). The trajectory correction velocity increment Delta V is assumed to be a three-component random vector with each component being a normally distributed random scalar having a possibly nonzero mean. Knowledge of the statitiscal properties of the magnitude of a random TCM is important in the planning and execution of maneuver strategies for deep-space missions such as Galileo. The current algorithm involves the numerical integration of a set of differential equations. This approach allows the computation of density functions for specific Delta V magnitude distributions to high accuracy without first having to generate large numbers of random samples. Possible applications of the algorithm to maneuver planning, planetary quarantine evaluation, and guidance success probability calculations are described.

Chadwick, C.↗

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗

Streamline Integration Using MPI-Hybrid Parallelism on a Large Multicore Architecture

Streamline computation in a very large vector field data set represents a significant challenge due to the nonlocal and data-dependent nature of streamline integration. In this paper, we conduct a study of the performance characteristics of hybrid parallel programming and execution as applied to streamline integration on a large, multicore platform. With multicore processors now prevalent in clusters and supercomputers, there is a need to understand the impact of these hybrid systems in order to make the best implementation choice. We use two MPI-based distribution approaches based on established parallelization paradigms, parallelize over seeds and parallelize over blocks, and present a novel MPI-hybrid algorithm for each approach to compute streamlines. Our findings indicate that the work sharing between cores in the proposed MPI-hybrid parallel implementation results in much improved performance and consumes less communication and I/O bandwidth than a traditional, nonhybrid distributed implementation.

97 MATHEMATICS AND COMPUTING↗

Highly Excited and Exotic Meson Spectrum from Dynamical Lattice QCD

Using a new quark-field construction algorithm and a large variational basis of operators, we extract a highly excited isovector meson spectrum on dynamical anisotropic lattices. We show how carefully constructed operators can be used to reliably identify the continuum spin of extracted states, overcoming the reduced cubic symmetry of the lattice. Using this method we extract, with confidence, excited states, states with exotic quantum numbers (0{sup +-}, 1{sup -+}, and 2{sup +-}), and states of high spin, including, for the first time in lattice QCD, spin-four states.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Retrofitting Word Embeddings with the UMLS Metathesaurus for Clinical Information Extraction

Deep learning has surged in popularity and proven to be effective for various artificial intelligence applications including information extraction from cancer pathology reports. Since word representation is a core unit that enables deep learning algorithms to understand words and be able to perform NLP, this representation must include as much information as possible to help these algorithms achieve high classification performance. Therefore, in this work in addition to the distributional information of words in large sized corpora, we use UMLS vocabulary resources to enrich the vector space representation of words with the semantic relations between words. These resources provide many terminologies pertaining to cancer. The refined word embeddings are used with a convolutional neural (CNN) model to extract four data elements from cancer pathology reports; ICD-O-3 tumor topography codes, tumor laterality, behavior, and histological grade. We observed that using UMLS vocabulary resources to enrich word embeddings of CNN models consistently outperformed CNN models without pre-training word embeddings and even with pre-trained word embeddings on a domain specific corpus across all four tasks. The results show marginal improvement on the laterality task, but a significant improvement on the other tasks, especially for the macro-f score. Specifically, the improvements are 3%, 13%, and 15% for tumor site, histological grade, and behavior tasks, respectively. This approach is encouraging to enrich word embeddings with more clinical data resources to be used for information abstraction tasks from clinical pathology reports.

Alawad, Mohammed↗

Explicit time integration of the stiff chemical Langevin equations using computational singular perturbation

A stable explicit time-scale splitting algorithm for stiff chemical Langevin equations (CLEs) is developed, based on the concept of computational singular perturbation. The drift term of the CLE is projected onto basis vectors that span the fast and slow subdomains. The corresponding fast modes exhaust quickly, in the mean sense, and the system state then evolves, with a mean drift controlled by slow modes, on a random manifold. The drift-driven time evolution of the state due to fast exhausted modes is modeled algebraically as an exponential decay process, while that due to slow drift modes and diffusional processes is integrated explicitly. This enables time integration step sizes much larger than those required by typical explicit numerical methods for stiff stochastic differential equations. The algorithm is motivated and reported on, and extensive numerical experiments are conducted to illustrate its accuracy and stability with a number of model systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling Malaria Transmission in Thailand and Indonesia

Malaria Modeling and Surveillance is a project in the NASA Applied Sciences Public Health Applications Program. The main objectives of this project are: 1) identification of the potential breeding sites for major vector species: 2) implementation of a malaria transmission model to identify they key factors that sustain or intensify malaria transmission; and 3) implementation of a risk algorithm to predict the occurrence of malaria and its transmission intensity. Remote sensing and GIs are the essential elements of this project. The NASA Earth science data sets used in this project include AVHRR Pathfinder, TRMM, MODIS, NSIPP and SIESIP. Textural-contextual classifications are used to identify small larval habitats. Neural network methods are used to model malaria cases as a function of precipitation, temperatures, humidity and vegetation. Hindcastings based on these environmental parameters have shown good agreement to epidemiological records. Examples for spatio-temporal modeling of malaria transmissions in Southeast Asia are given. Discrete event simulations were used for modeling the detailed interactions among the vector life cycle, sporogonic cycle and human infection cycle, under the explicit influences of selected extrinsic and intrinsic factors. The output of the model includes the individual infection status and the quantities normally observed in field studies, such as mosquito biting rates, sporozoite infection rates, gametocyte prevalence and incidence. Results are in good agreement with mosquito vector and human malaria data acquired by Coleman et al. over 4.5 years in Kong Mong Tha, a remote village in western Thailand. Application of our models is not restricted to Southeast Asia. The model and techniques are equally applicable to other regions of the world, when appropriate epidemiological and vector ecological parameters are used as input.

Kiang, Richard↗

SPECTRAL METHODS FOR TIME-DEPENDENT STUDIES OF ACCRETION FLOWS. III. THREE-DIMENSIONAL, SELF-GRAVITATING, MAGNETOHYDRODYNAMIC DISKS

Accretion disks are three-dimensional, turbulent, often self-gravitating, magnetohydrodynamic (MHD) flows, which can be modeled with numerical simulations. In this paper, we present a new algorithm that is based on a spectral decomposition method to simulate such flows. Because of the high order of the method, we can solve the induction equation in terms of the magnetic vector potential and, therefore, ensure trivially that the magnetic fields in the numerical solution are divergence free. The spectral method also suffers minimally from numerical dissipation and allows for an easy implementation of models for subgrid physics. Both properties make our method ideal for studying MHD turbulent flows such as those found in accretion disks around compact objects. We verify our algorithm with a series of standard tests and use it to show the development of MHD turbulence in a simulation of an accretion disk. Finally, we study the evolution and saturation of the power spectrum of MHD turbulence driven by the magnetorotational instability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Situational awareness-enhancing community-level load mapping with opportunistic machine learning

Motivated by present and forthcoming challenges in the adoption and integration of distributed renewable energy, we develop a machine learning (ML) approach that builds short-fuse mappings connecting the occasionally-unobservable true load in one target community with information-rich signals collected from relatively more instrumented reference communities. Our setting is inspired by and tailored to target communities with significant unobservable behind-the-meter solar generation, where true load (a relatively well-behaved quantity of interest to grid operators) is hard to discern during daytime due to insufficient instrumentation and/or privacy reasons, but that can be related to reference communities with low unobservable distributed variable generation or with sufficient instrumentation. The developed mapping, herein realized with Support Vector Machine regression, is built using nighttime data from all communities, when their distributed generation is low or zero. Our ML algorithm opportunistically learns to correlate signals of interest and then is operationally used the next day to shed light into target community load evolution. The mapping is subsequently rebuilt, rolling its short-fuse scope perpetually forward in time. Here, we demonstrate the efficacy of our approach on nine synthetically generated topologies and associated timeseries stemming from real-world data, on which we observe cumulative error performance that yields lower than 10% and 15% daily-averaged mean absolute percentage errors in target community load estimation on more than about 75% and 90% of days, respectively, in multiple yearly evaluations that shed light on long-term performance also under seasonal and one-off effects. The proposed ML-powered methodology can offer grid operators much-improved visibility into a previously obscure space and can also serve as an additional source of information in broader, multi-modal solar disaggregation solutions.

14 SOLAR ENERGY↗

Coupling High-Throughput Experiments and Regression Algorithms to Optimize PGM-Free ORR Electrocatalyst Synthesis

Over the past decades, significant improvement has been achieved in the performance of platinum group metal-free (PGM-free) materials as an alternative to Pt-based electrocatalysts for oxygen reduction reaction (ORR). However, further progress in ORR activity requires evaluation of precursors and synthesis approaches. In response to this challenge, we generated a first of its kind experimental data set of 36 samples using high-throughput synthesis and activity measurements. Several control parameters (e.g., Fe precursor identity, the precursor content, and pyrolysis temperature) were varied. We then developed several state-of-the-art machine learning (ML) based regression models to predict ORR activity, dependent on selected synthesis variables. Through an iterative algorithm, higher prediction accuracy (smaller root-mean-square error) was achieved. We identified that gradient boosting regression (GBR) and support vector regression (SVR), among several methods, work best for this data set. Aided by our ML-based surrogate models, we decided to alter catalyst synthesis conditions, which resulted in a 36% increase in measured ORR activity in comparison to the maximum ORR mass activity value of 21.9 A/g catalyst in the original data set. Overall, this combined experiment and machine learning approach represents a promising path forward toward developing highly efficient next-generation ORR electrocatalysts and, more generally, functional materials.

25 ENERGY STORAGE↗

Momentum spectrometer for electron-electron coincidence studies on superconductors

We present a new experimental setup to study electron-electron coincidences from superconducting surfaces. In our approach, electrons emitted from a surface are projected onto a time- and position-sensitive microchannel plate detector with delayline position readout. Electrons that are emitted within 2 {pi} solid angle with respect to the surface are detected in coincidence. The detector used is a hexagonal delayline detector with enhanced multiple hit capabilities. It is read out with a Flash analog-to-digital converter. The three-dimensional momentum vector is obtained for each electron. The intrinsic dead time of the detector has been greatly reduced by implementing a new algorithm for pulse analysis. The sample holder has been matched to fit the spectrometer while being capable of cooling down the sample to 4.5 K during the measurement and heating it up to 420 K for the cleaning procedure.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Study of High-Transverse-Momentum Higgs Boson Production in Association with a Vector Boson in the qqbb Final State with the ATLAS Detector

This Letter presents the first study of Higgs boson production in association with a vector boson (V=W or Z) in the fully hadronic qqbb final state using data recorded by the ATLAS detector at the LHC in proton-proton collisions at $\sqrt{s}$=13 TeV and corresponding to an integrated luminosity of 137 fb –1 . The vector bosons and Higgs bosons are each reconstructed as large-radius jets and tagged using jet substructure techniques. Dedicated tagging algorithms exploiting b-tagging properties are used to identify jets consistent with Higgs bosons decaying into $b\bar{b}$. Dominant backgrounds from multijet production are determined directly from the data, and a likelihood fit to the jet mass distribution of Higgs boson candidates is used to extract the number of signal events. The VH production cross section is measured inclusively and differentially in several ranges of Higgs boson transverse momentum: 250–450, 450–650, and greater than 650 GeV. The inclusive signal yield relative to the standard model expectation is observed to be μ=1.4$^{+1.0}_{–0.9}$ and the corresponding cross section is 3.1±1.3⁢(stat)$^{+1.8}_{–1.4}$(syst.) pb.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Landau Collision Integral Solver with Adaptive Mesh Refinement on Emerging Architectures

The Landau collision integral is an accurate model for the small-angle dominated Coulomb collisions in fusion plasmas. Here, we investigate a high order accurate, fully conservative, finite element discretization of the nonlinear multispecies Landau integral with adaptive mesh refinement using the PETSc library (ulwww.mcs.anl.gov/petsc). We develop algorithms and techniques to efficiently utilize emerging architectures with an approach that minimizes memory usage and movement and is suitable for vector processing. The Landau collision integral is vectorized with Intel AVX-512 intrinsics and the solver sustains as much as 22% of the theoretical peak flop rate of the Second Generation Intel Xeon Phi (``Knights Landing'') processor.

97 MATHEMATICS AND COMPUTING↗

Multigrid Reduction in Time for Chaotic Dynamical Systems

As CPU clock speeds have stagnated and high performance computers continue to have ever higher core counts, increased parallelism is needed to take advantage of these new architectures. Traditional serial time-marching schemes can be a significant bottleneck, as many types of simulations require large numbers of time-steps which must be computed sequentially. Parallel-in-time schemes, such as the Multigrid Reduction in Time (MGRIT) method, remedy this by parallelizing across time-steps and have shown promising results for parabolic problems. However, chaotic problems have proved more difficult, since chaotic initial value problems (IVPs) are inherently ill-conditioned. MGRIT relies on a hierarchy of successively coarser time-grids to iteratively correct the solution on the finest time-grid, but due to the nature of chaotic systems, small inaccuracies on the coarser levels can be greatly magnified and lead to poor coarse-grid corrections. Here we introduce a modified MGRIT algorithm based on an existing quadratically converging nonlinear extension to the multigrid Full Approximation Scheme (FAS), as well as a novel time-coarsening scheme. Together, these approaches better capture long-term chaotic behavior on coarse-grids and greatly improve convergence of MGRIT for chaotic IVPs. Further, we introduce a novel low-memory variant of the algorithm for solving chaotic PDEs with MGRIT which not only solves the IVP, but also provides estimates for the unstable Lyapunov vectors of the system. Finally, we provide supporting numerical results for the Lorenz system and demonstrate parallel speedup for the chaotic Kuramoto–Sivashinsky PDE over a significantly longer time-domain than in previous works.

97 MATHEMATICS AND COMPUTING↗