Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Parallel Programming Models and Systems for High Performance Computing. In: Emerging Research in Cloud Distributed Computing Systems

A parallel programming model is an abstraction of a parallel system that allows expression of both algorithms and shared data structures. To accommodate the diversity in parallel system architectures and user requirements, there are a variety of programming models including the models providing a shared memory view or a distributed memory view of the system. The programming models are implemented as libraries, language extensions, or compiler directives. This chapter provides a discussion on programming models and its implementations aimed at application developers, system software researchers, and hardware architects. The first part provides an overview of the programming models. The second part is an in-depth discussion on high-performance networking interface to implement the programming model. The last part of the chapter discusses implementation of a programming model with a case study. Each part of the chapter concludes with a discussion on current research trends and its impact on future architectures.

Venkata, Manjunath Gorentia↗
DOE OSTI2014

STRUMPACK -- STRUctured Matrices PACKage

STRUMPACK - STRUctured Matrices PACKage - is a package for computations with sparse and dense structured matrix, i.e., matrices that exhibit some kind of low-rank property, in particular Hierarchically Semi Separable structure (HSS). Such matrices appear in many applications, e.g., FEM, BEM, Integral equations. etc. Exploiting this structure using certain compression algorithms allow for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. STRUMPACK has presently two main components: a distributed-memory dense matrix computations package and a shared-memory sparse direct solver.

Source record↗
DOE OSTI2017

PELEC

PeleC is an adaptive-mesh compressible hydrodynamics code for reacting flows. It solves the compressible Navier-Stokes with multispecies transport in a block structured framework. The resulting algorithm is well suited for flows with localized resolution requirements and robust to discontinuities. User controllable refinement crieteria has the potential to result in extremely small numerical dissipation and dispersion, making this code appropriate for both research and applied usage. The code is built on the AMReX library which facilitates hierarchical parallelism and manages distributed memory parallism. PeleC algorithms are implemented to express shared memory parallelism.

Source record↗
DOE OSTI2016

Computed Tomography of Dry Cask Storage for Used Fuel

The demand for dry cask storage for used nuclear fuel is on the rise due to the continuous operation of currently existing nuclear plants which are reaching or have reached the capacity of their used fuel pools. Dry cask storage allows used fuel that has already been cooled in the used fuel pool for at least five years to be surrounded by an inert gas inside a specially designed and licensed cask. Currently, 75 of the 78 U.S.A reactor sites either have or are pursuing an independent spent fuel storage installation (ISFSI) for dry cask fuel storage [1] with over 2,000 casks already loaded [2]. Cask loading will only continue to increase until a final repository solution is operational or the U.S. begins to recycle fuel. The challenge of monitoring the condition of the used fuel inside the cask without exposing the used fuel has been apparent since the 1980s. The objective of the University of Florida (UF) project is ultimately to investigate the feasibility of imaging the used fuel assemblies’ location and evaluating the inner structural condition using emission source computed tomography (CT). A combination of radiation transport models will be used to simulate gamma-rays and neutrons traversing through the used fuel, structure, and cask body materials. In the simulations, multiple linear detector arrays will record the radiation outside the cask wall and will be placed at various angles in order to model rotating a linear detector array around the entire cask. The combination of data from all the detectors will give the planar radiation projection onto the detectors, more commonly called the Radon transform, of the structure of used fuel assemblies. This project can be processed with filtered back projection or other more advanced reconstructive imaging algorithms to recreate the fuel structures. A majority of the historical work done for used fuel has been on verification, diversion detection, and burnup credit validation in order to meet regulatory guidelines. One of the more commonly used systems for single assembly verification is the Fork Detector developed at Los Alamos National Laboratory in 1988 [3]. A group at the Idaho National Laboratory developed a Compton Dry-Cask Imaging Scanner that has the ability to detect empty vs full storage positions but it suffered a setback when transported to the Doel Nuclear Power Plant near Antwerp, Belgium; the system was unable to detect full energy peaks because of the additional scattering caused by a thick ballistic steel shield [4]. As detectors, computational power, and modeling improves, a few groups have leveraged these advancements and started to investigate CT hoping, that despite the difficulties, the technique can give information on fuel condition. So far the groups have mostly limited the tomographic work to a per assembly basis [5] [6] [7], rather than the full dry cask as the University of Florida plans to investigate. The downsides of CT versus simpler verification and validation are the amount of data required and the time it takes to acquire that data. Given that dry casks are intended to sit undistributed for up to 60 years, a scanning time of several weeks to several months is not unreasonable if such systems do not require human operators beyond the initial setup.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2016

Computed Tomography of Dry Cask Storage for Used Fuel

The demand for dry cask storage for used nuclear fuel is on the rise due to the continuous operation of currently existing nuclear plants which are reaching or have reached the capacity of their used fuel pools. Dry cask storage allows used fuel that has already been cooled in the used fuel pool for at least five years to be surrounded by an inert gas inside a specially designed and licensed cask. Currently, 75 of the 78 U.S.A reactor sites either have or are pursuing an independent spent fuel storage installation (ISFSI) for dry cask fuel storage with over 2,000 casks already loaded. Cask loading will only continue to increase until a final repository solution is operational or the U.S. begins to recycle fuel. The challenge of monitoring the condition of the used fuel inside the cask without exposing the used fuel has been apparent since the 1980's. The objective of the University of Florida (UF) project is ultimately to investigate the feasibility of imaging the used fuel assemblies' location and evaluating the inner structural condition using emission source computed tomography (CT). A combination of radiation transport models will be used to simulate gamma-rays and neutrons traversing through the used fuel, structure, and cask body materials. In the simulations, multiple linear detector arrays will record the radiation outside the cask wall and will be placed at various angles in order to model rotating a linear detector array around the entire cask. The combination of data from all the detectors will give the planar radiation projection onto the detectors, more commonly called the Radon transform, of the structure of used fuel assemblies. This project can be processed with filtered back projection or other more advanced reconstructive imaging algorithms to recreate the fuel structures. A majority of the historical work done for used fuel has been on verification, diversion detection, and burnup credit validation in order to meet regulatory guidelines. One of the more commonly used systems for single assembly verification is the Fork Detector developed at Los Alamos National Laboratory in 1988. A group at the Idaho National Laboratory developed a Compton Dry-Cask Imaging Scanner that has the ability to detect empty vs full storage positions but it suffered a setback when transported to the Doel Nuclear Power Plant near Antwerp, Belgium; the system was unable to detect full energy peaks because of the additional scattering caused by a thick ballistic steel shield. As detectors, computational power, and modeling improves, a few groups have leveraged these advancements and started to investigate CT hoping, that despite the difficulties, the technique can give information on fuel condition. So far the groups have mostly limited the tomographic work to a per assembly basis , rather than the full dry cask as the University of Florida plans to investigate. The downsides of CT versus simpler verification and validation are the amount of data required and the time it takes to acquire that data. Given that dry casks are intended to sit undistributed for up to 60 years, a scanning time of several weeks to several months is not unreasonable if such systems do not require human operators beyond the initial setup. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2018

Configurational-Bias Monte Carlo Back-Mapping Algorithm for Efficient and Rapid Conversion of Coarse-Grained Water Structures into Atomistic Models

Coarse-grained molecular dynamics (MD) simulations represent a powerful approach to simulate longer time scale and larger length scale phenomena than those accessible to all-atom models. The gain in efficiency, however, comes at the cost of atomistic details. The reverse transformation, also known as back-mapping, of coarse grained beads into their atomistic constituents represents a major challenge. Most existing approaches are limited to specific molecules or specific force-fields and often rely on running a long time atomistic MD of the back-mapped configuration to arrive at an optimal solution. Such approaches are problematic when dealing with systems with high diffusion barriers. Here, we introduce a new extension of the configurational-bias-Monte-Carlo (CBMC) algorithm, which we term the crystalline-configurational-bias-Monte-Carlo (C-CBMC) algortihm, that allows rapid and efficient conversion of a coarse-grained model back into its atomistic representation. Although the method is generic, we use a coarse-grained water model as a representative example and demonstrate the back-mapping or reverse transformation for model systems ranging from the ice-liquid water interface to amorphous and crystalline ice configurations. A series of simulations using the TIP4P/Ice model are performed to compare the new CBMC method to several other standard Monte Carlo and Molecular Dynamics based back-mapping techniques. In all the cases, the C-CBMC algorithm is able to find optimal hydrogen bonded configuration many thousand evaluations/steps sooner than the other methods compared within this paper. For crystalline ice structures such as a hexagonal, cubic, and cubic-hexagonal stacking disorder structures, the C-CBMC was able to find structures that were between 0.05 and 0.1 eV/water molecule lower in energy than the ground state energies predicted by the other methods. Detailed analysis of the atomistic structures show a significantly better global hydrogen positioning when contrasted with the existing simpler back-mapping methods. The error in the RDFs of backmapped relative to reference configuration for the CCBMC, MD, and MC were found to be 6.9, 8.7, and 12.9 respectively for the hexagonal system. For the cubic system the relative error of the RDFs for the CCBMC, MD, and MC were found to be 18.2, 34.6, and 39.0 respectively. Finally, our results demonstrate the efficiency and efficacy of our new back-mapping approach, especially for crystalline systems where simple force-field based relaxations have a tendency to get trapped in local minima.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2015

Weak lensing of large scale structure in the presence of screening

A number of alternatives to general relativity exhibit gravitational screening in the non-linear regime of structure formation. We describe a set of algorithms that can produce weak lensing maps of large scale structure in such theories and can be used to generate mock surveys for cosmological analysis. By analysing a few basic statistics we indicate how these alternatives can be distinguished from general relativity with future weak lensing surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Structural evolution of two-dimensional silicates using a “bond-switching” algorithm

Silicates are the most abundant materials in the earth's crust. In recent years, two-dimensional (2D) versions of them grown on metal supports (known as bilayer silicates) have allowed their study in detail down to the atomic scale. These structures are self-containing. Furthermore, they are not covalently bound to the metal support but interact with it through van der Waals forces. Like their three-dimensional counterparts, the 2D-silicates can form both crystalline and vitreous structures. Furthermore, the interconversion between vitreous to crystalline structures has been experimentally observed at the nanoscale. While theoretical work has been carried out to try to understand these transformations, a limitation for ab initio methods, and even molecular dynamics methods, is the computational cost of studying large systems and long timescales. In this work, we present a simple and computationally inexpensive approach, that can be used to represent the evolution of bilayer silicates using a bond-switching algorithm. This approach allows reaching equilibrium ring size distributions as a function of a parameter that can be related to the ratio between temperature and the energy required for the bond-switching event. The ring size distributions are compared to experimental data available in the literature.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2017

Graph theory data for topological quantum chemistry

Topological phases of noninteracting particles are distinguished by the global properties of their band structure and eigenfunctions in momentum space. On the other hand, group theory as conventionally applied to solid-state physics focuses only on properties that are local (at high-symmetry points, lines, and planes) in the Brillouin zone. To bridge this gap, we have previously [Bradlyn et al., Nature (London) 547, 298 (2017)] mapped the problem of constructing global band structures out of local data to a graph construction problem. In this paper, we provide the explicit data and formulate the necessary algorithms to produce all topologically distinct graphs. Furthermore, we show how to apply these algorithms to certain “elementary” band structures highlighted in the aforementioned reference, and thus we identified and tabulated all orbital types and lattices that can give rise to topologically disconnected band structures. Finally, we show how to use the newly developed bandrep program on the Bilbao Crystallographic Server to access the results of our computation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Distributed memory, GPU accelerated Fock construction for hybrid, Gaussian basis density functional theory

With the growing reliance of modern supercomputers on accelerator-based architecture such a graphics processing units (GPUs), the development and optimization of electronic structure methods to exploit these massively parallel resources has become a recent priority. While significant strides have been made in the development GPU accelerated, distributed memory algorithms for many modern electronic structure methods, the primary focus of GPU development for Gaussian basis atomic orbital methods has been for shared memory systems with only a handful of examples pursing massive parallelism. Here in this work, we present a set of distributed memory algorithms for the evaluation of the Coulomb and exact exchange matrices for hybrid Kohn–Sham DFT with Gaussian basis sets via direct density-fitted (DF-J-Engine) and seminumerical (sn-K) methods, respectively. The absolute performance and strong scalability of the developed methods are demonstrated on systems ranging from a few hundred to over one thousand atoms using up to 128 NVIDIA A100 GPUs on the Perlmutter supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Discarding Information from Previous Iterations in an Optimal Way To Solve the Coupled Cluster Amplitude Equations

The direct inversion of the iterative subspace (DIIS) convergence acceleration algorithm is used in most electronic structure programs to solve the nonlinear coupled cluster amplitude equations. When the DIIS algorithm is used, the storage of previous trial vectors may become a bottleneck and the discarding of trial vectors may lead to a degradation of the convergence or even divergence. Here, we discuss an alternative way of storing information from trial vectors where only the last three trial vectors are needed to maintain the convergence of the full set of previous trial vectors, and which requires only minor modifications of an existing DIIS code

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Experimental and theoretical study of energy transfer in a chromophore triad: What makes modeling dynamics successful?

Simulation of electronic dynamics in realistically large molecular systems is a demanding task that has not yet achieved the same level of quantitative prediction already realized for its static counterpart. This is particularly true for processes occurring beyond the Born–Oppenheimer regime. Non-adiabatic molecular dynamics (NAMD) simulations suffer from two convoluted sources of error: numerical algorithms for dynamics and electronic structure calculations. While the former has gained increasing attention, particularly addressing the validity of ad hoc methodologies, the effect of the latter remains relatively unexplored. Indeed, the required accuracy for electronic structure calculations to reach quantitative agreement with experiment in dynamics may be even more strict than that required for static simulations. In this study, we address this issue by modeling the electronic energy transfer in a donor–acceptor–donor (D–A–D) molecular light harvesting system using fewest switches surface hopping NAMD simulations. In the studied system, time-resolved experimental measurements deliver complete information on spectra and energy transfer rates. Subsequent modeling shows that the calculated electronic transition energies are “sufficiently good” to reproduce experimental spectra but produce over an order of magnitude error in simulated dynamical rates. We further perform simulations using artificially shifted energy gaps to investigate the complex relationship between transition energies and modeled dynamics to understand factors affecting non-radiative relaxation and energy transfer rates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Communication-efficient Distributed Solutions to a System of Linear Equations with Laplacian Sparse Structure

Two communication-efficient distributed algorithms are proposed to solve a system of linear equations Ax = b with Laplacian sparse A. A system of linear equations with Laplacian sparse A can be found in many applications, e.g., the power flow problems and other network flow problems. The first algorithm is based on the gradient descent method in optimization and the agents only share two parts of the system state instead of that of the whole system state, which saves significant communication. The two parts shared by every agent through a communication link are the state information of its own and its neighbors connected by the communication link. The second method is obtained from an approximation of the Newton method, which converges faster. It requires twice as much communication as the first one but is still communicationefficient due to the low dimension of each part shared between agents. The convergence at a linear rate of both methods is proved. A comprehensive comparison of the convergence rate, communication burden, and computation costs between the methods is made. Finally, a simulation is conducted to show the effectiveness of both methods.

Wang, Peng↗
DOE OSTI2015

Noise elimination algorithm for modal analysis

Modal analysis is an ongoing interdisciplinary physical issue. Modal parameters estimation is applied to determine the dynamic characteristics of structures under vibration excitation. Modal analysis is more challenging for the measured vibration response signals are contaminated with noise. This study develops a mathematical algorithm of structured low rank approximation combined with the complex exponential method to estimate the modal parameters. Physical experiments using a steel cantilever beam with ten accelerometers mounted, excited by an impulse load, demonstrate that this method can significantly eliminate noise from measured signals and accurately identify the modal frequencies and damping ratios. This study provides a fundamental mechanism of noise elimination using structured low rank approximation in physical fields.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Ternary alloy material prediction using genetic algorithm and cluster expansion

This thesis summarizes our study on the crystal structures prediction of Fe-V-Si system using genetic algorithm and cluster expansion. Our goal is to explore and look for new stable compounds. We started from the current ten known experimental phases, and calculated formation energies of those compounds using density functional theory (DFT) package, namely, VASP. The convex hull was generated based on the DFT calculations of the experimental known phases. Then we did random search on some metal rich (Fe and V) compositions and found that the lowest energy structures were body centered cube (bcc) underlying lattice, under which we did our computational systematic searches using genetic algorithm and cluster expansion. Among hundreds of the searched compositions, thirteen were selected and DFT formation energies were obtained by VASP. The stability checking of those thirteen compounds was done in reference to the experimental convex hull. We found that the composition, 24-8-16, i.e., Fe 3 VSi 2 is a new stable phase and it can be very inspiring to the future experiments.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Influence of spin-orbit effects on structures and dielectric properties of neutral lead clusters

Combining molecular beam electric deflection experiments and global optimization techniques has proven to be a powerful tool for resolving equilibrium structures of neutral metal and semiconductor clusters. Herein, we present electric molecular beam deflection experiments on Pb{sub N} (N = 7–18) clusters. Promising structures are generated using the unbiased Birmingham Cluster Genetic Algorithm approach based on density functional theory. The structures are further relaxed within the framework of two-component density functional theory taking scalar relativistic and spin orbit effects into account. Quantum chemical results are used to model electric molecular beam deflection profiles based on molecular dynamics calculations. Comparison of measured and simulated beam profiles allows the assignment of equilibrium structures for the most cluster sizes in the examined range for the first time. Neutral lead clusters adopt mainly spherical geometries and resemble the structures of lead cluster cations apart from Pb{sub 10}. Their growth pattern deviates strongly from the one observed for tin and germanium clusters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2016

An adaptive interpolation scheme for molecular potential energy surfaces

The calculation of potential energy surfaces for quantum dynamics can be a time consuming task—especially when a high level of theory for the electronic structure calculation is required. We propose an adaptive interpolation algorithm based on polyharmonic splines combined with a partition of unity approach. The adaptive node refinement allows to greatly reduce the number of sample points by employing a local error estimate. The algorithm and its scaling behavior are evaluated for a model function in 2, 3, and 4 dimensions. The developed algorithm allows for a more rapid and reliable interpolation of a potential energy surface within a given accuracy compared to the non-adaptive version.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

Conformations of macromolecules and their complexes from heterogeneous datasets

We explain a new generation of algorithms capable of mapping the structure and conformations of macromolecules and their complexes from large ensembles of heterogeneous snapshots, and demonstrate the feasibility of determining both discrete and continuous macromolecular conformational spectra. These algorithms naturally incorporate conformational heterogeneity without resort to sorting and classification, or prior knowledge of the type of heterogeneity present. They are applicable to single-particle diffraction and image datasets produced by X-ray lasers and cryo-electron microscopy, respectively, and particularly suitable for systems not easily amenable to purification or crystallization.

59 BASIC BIOLOGICAL SCIENCES↗