Search NASA⌕ Search

SEARCH · Search NASA

Results for “compute intensive problems”

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 271 records · Page 15

A comparison of Gaussian processes and neural networks for computer model emulation and calibration

The Department of Energy relies on complex physics simulations for prediction in domains like cosmology, nuclear theory, and materials science. These simulations are often extremely computationally intensive, with some requiring days or weeks for a single simulation. In order to assure their accuracy, these models are calibrated against observational data in order to estimate inputs and systematic biases. Because of their great computational complexity, this process typically requires the construction of an emulator, a fast approximation to the simulation. In this paper, two emulator approaches are compared: Gaussian process regression and neural networks. Their emulation accuracy and calibration performance on three real problems of Department of Energy interest is considered. On these problems, the Gaussian process emulator tends to be more accurate with narrower, but still well-calibrated uncertainty estimates. The neural network emulator is accurate, but tends to have large uncertainty on its predictions. Finally, as a result, calibration with the Gaussian process emulator produces more constrained posteriors that still perform well in prediction.

97 MATHEMATICS AND COMPUTING↗

Polarization-dependent atomic dipole traps behind a circular aperture for neutral-atom quantum computing

The neutral-atom quantum computing community has successfully implemented almost all necessary steps for constructing a neutral-atom quantum computer. We present computational results of a study aimed at solving the remaining problem of creating a quantum memory with individually addressable sites for quantum computing. The basis of this quantum memory is the diffraction pattern formed by laser light incident on a circular aperture. Very close to the aperture, the diffraction pattern has localized bright and dark spots that can serve as red-detuned or blue-detuned atomic dipole traps. These traps are suitable for quantum computing even for moderate laser powers. In particular, for moderate laser intensities ({approx}100 W/cm{sup 2}) and comparatively small detunings ({approx}1000-10 000 linewidths), trap depths of {approx}1 mK and trap frequencies of several to tens of kilohertz are achieved. Our results indicate that these dipole traps can be moved by tilting the incident laser beams without significantly changing the trap properties. We also explored the polarization dependence of these dipole traps. We developed a code that calculates the trapping potential energy for any magnetic substate of any hyperfine ground state of any alkali-metal atom for any laser detuning much smaller than the fine-structure splitting for any given electric field distribution. We describe details of our calculations and include a summary of different notations and conventions for the reduced matrix element and how to convert it to SI units. We applied this code to these traps and found a method for bringing two traps together and apart controllably without expelling the atoms from the trap and without significant tunneling probability between the traps. This approach can be scaled up to a two-dimensional array of many pinholes, forming a quantum memory with single-site addressability, in which pairs of atoms can be brought together and apart for two-qubit gates for quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Z2Pack: Numerical implementation of hybrid Wannier centers for identifying topological materials

The intense theoretical and experimental interest in topological insulators and semimetals has established band structure topology as a fundamental material property. Consequently, identifying band topologies has become an important, but often challenging, problem, with no exhaustive solution at the present time. Here, we compile a series of techniques, some previously known, that allow for a solution to this problem for a large set of the possible band topologies. The method is based on tracking hybrid Wannier charge centers computed for relevant Bloch states, and it works at all levels of materials modeling: continuous k ∙ p models, tight-binding models, and ab initio calculations. We apply the method to compute and identify Chern, $\mathbb{Z}$ 2 , and crystalline topological insulators, as well as topological semimetal phases, using real material examples. Moreover, we provide a numerical implementation of this technique (the Z2Pack software package) that is ideally suited for high-throughput screening of materials databases for compounds with nontrivial topologies. We expect that our work will allow researchers to (a) identify topological materials optimal for experimental probes, (b) classify existing compounds, and (c) reveal materials that host novel, not yet described, topological states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

SharP

The pre-exascale systems are expected to have a significant amount of hierarchical and heterogeneous on-node memory, and this trend of system architecture in extreme-scale systems is expected to continue into the exascale era. along with hierarchical-heterogeneous memory, the system typically has a high-performing network ad a compute accelerator. This system architecture is not only effective for running traditional High Performance Computing (HPC) applications (Big-Compute), but also for running data-intensive HPC applications and Big-Data applications. As a consequence, there is a growing desire to have a single system serve the needs of both Big-Compute and Big-Data applications. Though the system architecture supports the convergence of the Big-Compute and Big-Data, the programming models and software layer have yet to evolve to support either hierarchical-heterogeneous memory systems or the convergence. A programming abstraction to address this problem. The programming abstraction is implemented as a software library and runs on pre-exascale and exascale systems supporting current and emerging system architecture. Using distributed data-structures as a central concept, it provides (1) a simple, usable, and portable abstraction for hierarchical-heterogeneous memory and (2) a unified programming abstraction for Big-Compute and Big-Data applications.

Venkata, Manjunath Gorentla↗

GPU accelerated fully space and time resolved numerical simulations of self-focusing laser beams in SBS-active media

A computer cluster equipped with Graphics Processing Units (GPUs) is used for simulating nonlinear optical wave packets undergoing Kerr self-focusing and stimulated Brillouin scattering in fused silica. We first recall the model equations in full (3+1) dimensions. These consist of two coupled nonlinear Schrödinger equations for counterpropagating optical beams closed with a source equation for light-induced acoustic waves seeded by thermal noise. Compared with simulations on a conventional cluster of Central Processing Units (CPUs), GPU-based computations allow us to use a significant (16 times) larger number of mesh points within similar computation times. Reciprocally, simulations employing the same number of mesh points are between 3 and 20 times faster on GPUs than on the same number of classical CPUs. Performance speedups close to 45 are reported for isolated functions evaluating, e.g., the optical nonlinearities. Since the field intensities may reach the ionization threshold of silica, the action of a defocusing electron plasma is also addressed.

97 MATHEMATICS AND COMPUTING↗

Community-driven development for computational biology at Sprints, Hackathons and Codefests

Background: Computational biology comprises a wide range of technologies and approaches. Multiple technologies can be combined to create more powerful workflows if the individuals contributing the data or providing tools for its interpretation can find mutual understanding and consensus. Much conversation and joint investigation are required in order to identify and implement the best approaches. Traditionally, scientific conferences feature talks presenting novel technologies or insights, followed up by informal discussions during coffee breaks. In multi-institution collaborations, in order to reach agreement on implementation details or to transfer deeper insights in a technology and practical skills, a representative of one group typically visits the other. However, this does not scale well when the number of technologies or research groups is large. Conferences have responded to this issue by introducing Birds-of-a-Feather (BoF) sessions, which offer an opportunity for individuals with common interests to intensify their interaction. However, parallel BoF sessions often make it hard for participants to join multiple BoFs and find common ground between the different technologies, and BoFs are generally too short to allow time for participants to program together. Results: This report summarises our experience with computational biology Codefests, Hackathons and Sprints, which are interactive developer meetings. They are structured to reduce the limitations of traditional scientific meetings described above by strengthening the interaction among peers and letting the participants determine the schedule and topics. These meetings are commonly run as loosely scheduled “unconferences” (self-organized identification of participants and topics for meetings) over at least two days, with early introductory talks to welcome and organize contributors, followed by intensive collaborative coding sessions. We summarise some prominent achievements of those meetings and describe differences in how these are organised, how their audience is addressed, and their outreach to their respective communities. Conclusions: Hackathons, Codefests and Sprints share a stimulating atmosphere that encourages participants to jointly brainstorm and tackle problems of shared interest in a self-driven proactive environment, as well as providing an opportunity for new participants to get involved in collaborative projects.

59 BASIC BIOLOGICAL SCIENCES↗

A computationally efficient P 1 radiation model for modern combustion systems utilizing pre-conditioned conjugate gradient methods

The iterative convergence of the P 1 radiation model can be slow in optically thin scenarios when employing classical iterative methods. In order to remedy this shortcoming, an in-house P 1 radiation model was interfaced with high performance, scalable, linear solver libraries. Next, the accuracies of P 1 radiation model calculations was assessed by comparing its predictions against discrete ordinates (DO) model calculations for prototypical problems representative of modern combustion systems. Corresponding benchmark results were also included for comparison. Utilizing Pre-Conditioners (PC) to the Conjugate Gradients (CG) method, the convergence time of the P 1 radiation model reduced by a factor of 30 for modest problem sizes and a factor of 70 for larger sized problems when compared against classical Gauss Seidel sweeps. Additionally, PC provided 50% computational savings compared to employing CG in a standalone mode. The P 1 model calculation times were about 25–30% of the DO model calculation time. The time to solution also scaled linearly with an increase in problem size. The weighted sum of gray gases model employed in this study in conjunction with the P 1 model provided good agreement against benchmark data with L 2 error norms (defined relative to corresponding DO calculations) improving when isotropic intensities were prevalent.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Parallel Implementation of Power System Dynamic Simulation

Dynamic simulation of power system transient stability is important for planning, monitoring, operation, and control of electrical power systems. However, modeling the system dynamics and network involves the computationally intensive time-domain solution of numerous differential and algebraic equations (DAE). This results in a transient stability implementation that may not maintain the real-time constraints of an online security assessment. This paper presents a parallel implementation of the dynamic simulation on a high-performance computing (HPC) platform using parallel simulation algorithms and computation architectures. It enables the simulation to run even faster than real time, enabling the “look-ahead” capability of upcoming stability problems in the power grid.

dynamic simulation↗

Summer Proceedings 2019

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researchers to learn about problems in computer and computational science at DOE laboratories. Participants conduct leading-edge research, interact with scientists and engineers at the laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, adaptivity and mesh refinement, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers and heterogeneous computers, data-intensive computing, environments for scalable computing, parallel input/output, advanced architectures, and theoretical computer science. The CSRI Summer Program includes the organization of a weekly seminar series and the publication of this summer proceedings.

97 MATHEMATICS AND COMPUTING↗

An extended Vlasov–Fokker–Planck approach for kinetic simulations of laser plasmas

Vlasov–Fokker–Planck simulation codes occupy an important niche in modeling laser-produced plasmas, since they are well suited to studying the effect of collisions on electron kinetic phenomena, especially energy transport. One of the most important elements of energy transport is the absorption of laser light by the plasma; however, simulating this in detail requires resolving oscillations of the laser light, whose characteristic timescale is orders of magnitude shorter than the simulation time needed to study transport physics. For this reason, most Vlasov–Fokker–Planck codes used to study electron transport in laser plasmas rely on simplified models of the laser–plasma coupling. Their underlying assumptions nominally preclude their use for modeling laser light having short-scale structure in space or time, such as broadband lasers. In this work, we derive a more general computational framework suitable for arbitrarily structured laser fields. Furthermore, our approach is based on an extended set of Vlasov–Fokker–Planck equations that separately solve for the low- and high-frequency plasma response. We implement these extended Vlasov–Fokker–Planck equations in the spherical harmonic code K2 and demonstrate the performance of the method on several laser absorption test problems, with particular attention to the judicious selection of time steps, time integrators, and spherical harmonic truncation, according to the intensity and spectrum of the laser light under consideration. Comparison with the widely used Langdon absorption operator shows the Langdon operator performs remarkably well for predicting laser heating in the simple cases considered here, even in situations that would seem to violate its underlying assumptions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Direct Numerical Simulation of the Turbulent Flow Through PWR Spacer Grid and Mixing Vanes

Direct numerical simulation (DNS) has been regarded as a reliable data source for the development and validation of turbulence models along with experiments. The realization of DNS usually involves a very fine mesh that should be able to resolve all relevant turbulence scales down to Kolmogorov scale. As the most computationally expensive approach compared to other CFD techniques, DNS applications used to be limited to flow studies at very low Reynolds numbers. Thanks to the tremendous growth of computing power over the past decades, the simulation capability of DNS has now started overlapping with some of the most challenging engineering problems. One of those examples in nuclear engineering is the turbulent coolant flow inside reactor cores. In Light Water Reactor (LWR) cores, the nuclear fuel rods are arranged together as rod bundles in a triangular or square pattern. The fuel rod bundles are supported by the spacer grids. The mixing vanes are also installed to promote the turbulence intensity in coolant flow. An understanding of spacer grid and mixing vanes effect is important because it has a direct impact on the heat removal efficiency from the fuel rod surface. In the presented work, the DNS of turbulent flows are performed in three different types of geometries: (a) a regular Pressurized Water Reactor (PWR) subchannel; (b) a special PWR subchannel with reduced size spacer grid and mixing vanes (SGMV); (c) a special PWR subchannel with reduced size SGMV, but with a longer domain size. The springs and dimples of the spacer grid are not represented for the simplicity in the present investigation. The mean flow velocity and turbulent kinetic energy profiles are averaged from the instantaneous DNS data in different types of geometries as well as various downstream locations with respect to SGMV region. The results will help better assess the influence of spacer grid and mixing vanes on core coolant flows.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

On-demand data analytics in HPC environments at leadership computing facilities: Challenges and experiences

Scaling-up scientific data analysis and machine learning algorithms for data-driven discovery is a grand challenge that we face today. Despite the growing need for analysis from science domains that are generating `Big Data' from instruments and simulations, building high-performance analytical workflows of data-intensive algorithms have been daunting because: (i) the `Big Data' hardware and software architecture landscape is constantly evolving, (ii) newer architectures impose new programming models, and (iii) data-parallel kernels of analysis algorithms and their performance facets on different architectures are poorly understood. To address these problems, we have: (i) identified scalable data-parallel kernels of popular data analysis algorithms, (ii) implemented `Mini-Apps' of those kernels using different programming models (e.g. Map Reduce, MPI, etc.), (iii) benchmarked and validated the performance of the kernels in diverse architectures. In this paper, we discuss two of those Mini-Apps and show the execution of principal component analysis built as a workflow of the Mini-Apps. We show that Mini-Apps enable scientists to (i) write domain-specific data analysis code that scales on most HPC hardware and (ii) and offers the ability (most times with over a 10x speed-up) to analyze data sizes 100 times the size of what off-the-shelf desktop/workstations of today can handle.

Harney, John↗

Bayesian Abel Inversion in Quantitative X-Ray Radiography

A common image formation process in high-energy X-ray radiography is to have a pulsed power source that emits X-rays through a scene, a scintillator that absorbs X-rays and uoresces in the visible spectrum in response to the absorbed photons, and a CCD camera that images the visible light emitted from the scintillator. The intensity image is related to areal density, and, for an object that is radially symmetric about a central axis, the Abel transform then gives the object's volumetric density. Two of the primary drawbacks to classical variational methods for Abel inversion are their sensitivity to the type and scale of regularization chosen and the lack of natural methods for quantifying the uncertainties associated with the reconstructions. In this work we cast the Abel inversion problem within a statistical framework in order to compute volumetric object densities from X-ray radiographs and to quantify uncertainties in the reconstruction. A hierarchical Bayesian model is developed with a likelihood based on a Gaussian noise model and with priors placed on the unknown density pro le, the data precision matrix, and two scale parameters. This allows the data to drive the localization of features in the reconstruction and results in a joint posterior distribution for the unknown density pro le, the prior parameters, and the spatial structure of the precision matrix. Results of the density reconstructions and pointwise uncertainty estimates are presented for both synthetic signals and real data from a U.S. Department of Energy X-ray imaging facility.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

FrESCO: Framework for Exploring Scalable Computational Oncology

The National Cancer Institute (NCI) monitors population level cancer trends as part of its Surveillance, Epidemiology, and End Results (SEER) program. This program consists of state or regional level cancer registries which collect, analyze, and annotate cancer pathology reports. From these annotated pathology reports, each individual registry aggregates cancer phenotype information from electronic health records. This data is then used to create summary statistics about cancer incidence and mortality to facilitate population health monitoring. Extracting phenotypic information from these reports is a labor intensive task, requiring specialized knowledge about the reports and cancer. Automating the information extraction process from cancer pathology reports has the potential to improve data quality by extracting information in a consistent manner across registries. It can also improve patient outcomes by reducing the time from diagnosis, enabling rapid case ascertainment for clinical trials. Here we present FrESCO, a modular deep-learning natural language processing (NLP) library initially designed for extracting pathology information from clinical text documents. This repository is not solely limited to clinical medical text, but may also be used by researchers just getting started with NLP methods and those looking for a robust solution for their classification problems.

60 APPLIED LIFE SCIENCES↗

Filtering with Marked Point Process Observations via Poisson Chaos Expansion

We study a general filtering problem with marked point process observations. The motivation comes from modeling financial ultra-high frequency data. First, we rigorously derive the unnormalized filtering equation with marked point process observations under mild assumptions, especially relaxing the bounded condition of stochastic intensity. Then, we derive the Poisson chaos expansion for the unnormalized filter. Based on the chaos expansion, we establish the uniqueness of solutions of the unnormalized filtering equation. Moreover, we derive the Poisson chaos expansion for the unnormalized filter density under additional conditions. To explore the computational advantage, we further construct a new consistent recursive numerical scheme based on the truncation of the chaos density expansion for a simple case. The new algorithm divides the computations into those containing solely system coefficients and those including the observations, and assign the former off-line.

97 MATHEMATICS AND COMPUTING↗

Multireference Equation-of-Motion Driven Similarity Renormalization Group: Theoretical Foundations and Applications to Ionized States

We present a formulation and implementation of an equation-of-motion (EOM) extension of the multireference driven similarity renormalization group (MR-DSRG) formalism for ionization potentials (IP-EOM-DSRG). The IP-EOM-DSRG formalism results in a Hermitian generalized eigenvalue problem, delivering accurate ionization potentials for strongly correlated systems. The EOM step scales as O(N 5 ) with the basis set size N, allowing for efficient calculation of spectroscopic properties, such as transition energies and intensities. The IP-EOM-DSRG formalism is combined with three truncation schemes of the parent MR-DSRG theory: an iterative nonperturbative method with up to two-body excitations [MR-LDSRG(2)] and second- and third-order perturbative approximations [DSRG-MRPT2/3]. We benchmark these variants by computing (1) the vertical valence ionization potentials of a series of small molecules at both equilibrium and stretched geometries; (2) the spectroscopic constants of several low-lying electronic states of the OH, CN, N 2 + , and CO + radicals; and (3) the binding curves of low-lying electronic states of the CN radical. A comparison with experimental data and theoretical results shows that all three IP-EOM-DSRG methods accurately reproduce the vertical ionization potentials and spectroscopic constants of these systems. Notably, the DSRG-MRPT3 and MR-LDSRG(2) versions outperform several state-of-the-art multireference methods of comparable or higher cost.

Hamiltonians↗