Search NASA⌕ Search

SEARCH · Search NASA

Results for “Physics - Plasma physics , Computer science”

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 73 records · Page 4

MIRAGE: A Framework for Data-Driven Collaborative High-Resolution Simulation

Information about how human populations shift in response to various stimuli is limited because no single model is capable of addressing these stimuli simultaneously, and integration of the best existing models has been challenging because of the vast disparity among constituent model purposes, architectures, scales, and execution environments. To demonstrate a potential model coupling for approaching this problem, three major model components are integrated into a fully coupled system that executes a worldwide infection-infected routine where a human population requires a food source for sustenance and an infected population can spread an infection when it is in contact with the remaining healthy population. To enable high-resolution data-driven model federation and an ability to capture dynamics and behaviors of billions of humans, a high-performance computing agent-based framework has been created and is demonstrated in this chapter.

60 APPLIED LIFE SCIENCES↗

Quantum Optimization: Potential, Challenges, and the Path Forward

Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.

97 MATHEMATICS AND COMPUTING↗

Biological Electron Transfer and Catalysis EFRC

The focus of the Biological Electron Transfer and Catalysis (BETCy) EFRC research is elucidating mechanisms of conversion of electrochemical potential into chemical bond energy and is organized into two integrated Thrusts: Electron Bifurcation Catalysis and Electron Transfer Kinetics. We are developing a collective knowledge of metalloenzymes as models for redox reactions by applying physical science and computational tools to characterize biochemical reactions catalyzed by multi- subunit enzymes harboring arrays of iron-sulfur clusters and flavin cofactors. Understanding these mechanisms is central to overcoming the thermodynamic barriers that currently limit production of reduced products and fuels. Biological systems have elegant strategies for converting electrochemical potential energy into chemical bond energy (e.g., C-H, H-H, and N-H) stored in reduced compounds that can serve as advanced biofuels. One significant limitation for the production of highly reduced compounds is that their production in natural and industrial processes relies on low oxidation-reduction potential chemicals as feedstocks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Examples of Mission-driven Data Science from Jefferson Lab and ACES

This presentation details mission-driven data science initiatives at Jefferson Lab and the Joint Institute for Advanced Computing on Environmental Studies (ACES). JLab, a U.S. Department of Energy Office of Science national laboratory, operates the Continuous Electron Beam Accelerator Facility (CEBAF), and is the lead institute for the new High Performance Data Facility (HPDF) Hub. The Joint Institute for ACES brings together interdisciplinary teams in health informatics, climate modeling, computer science, and physics to address environmental challenges, including flood modeling. The Hampton Roads region, particularly Norfolk and Virginia Beach, faces increasing flood risks, motivating the need for rapid, reliable, and risk-aware decision support. ACES’s flooding work has a focus on uncertainty quantification (UQ) and machine learning (ML) for coastal flood management. The work is motivated by the increasing vulnerability of communities such as Norfolk and Virginia Beach, Virginia, to frequent coastal flooding events, and the need for rapid, reliable decision support. The research develops computationally efficient ML surrogate models to forecast water levels and flooding risk. A central theme is the quantification and calibration of predictive uncertainty, especially for out-of-distribution (OOD) scenarios, using techniques such as Monte Carlo Dropout, Deep Ensembles, Gaussian Processes, and Deep Quantile Regression (DQR). The study demonstrates that distance-aware UQ is critical for reliable scientific AI, particularly in high-dimensional, safety-critical, and real-time applications.

McSpadden, Diana [Thomas Jefferson National Accele↗

Efficient tree decomposition of high-rank tensors [Efficient decomposition of high-rank tensors]

Tensors are a natural way to express correlations among many physical variables, but storing tensors in a computer naively requires memory which scales exponentially in the rank of the tensor. This is not optimal, as the required memory is actually set not by the rank but by the mutual information amongst the variables in question. Representations such as the tensor tree perform near-optimally when the tree decomposition is chosen to reflect the correlation structure in question, but making such a choice is non-trivial and good heuristics remain highly context-specific. In this work I present two new algorithms for choosing efficient tree decompositions, independent of the physical context of the tensor. The first is a brute-force algorithm which in most cases produces optimal decompositions but is generally impractical for high-rank tensors, as the number of possible choices grows exponentially in rank. Here, the second is a greedy algorithm, and while it is not optimal it performs extremely well in numerical experiments while having runtime which makes it practical even for tensors of very high rank.

97 MATHEMATICS AND COMPUTING↗

High-performance high-resolution semi-Lagrangian tracer transport on a sphere

Current climate models have a limited ability to increase spatial resolution because numerical stability requires the time step to decrease. We describe a semi-Lagrangian method for tracer transport that is stable for arbitrary Courant numbers, and we test a parallel implementation discretized on the cubed sphere. The method includes a fixer that conserves mass and constrains tracers to a physical range of values. The method shows third-order convergence and maintains nonlinear tracer correlations to second order. It shows optimal accuracy at Courant numbers of 10-20, more than an order of magnitude higher than explicit methods. We present parallel performance in terms of strong scaling, weak scaling, and spatial scaling (where the time step stays constant while the resolution increases). For a 0.2° test with 100 tracers, the implementation scales efficiently to 10,000 MPI tasks.

Computer Science↗

Biological Electron Transfer and Catalysis Energy Frontier Research Center

The overarching objective of the BETCy EFRC project is to investigate the mechanisms and structural basis controlling electron bifurcation, electron-ion coupling, and redox catalysis in model enzymes. This detailed understanding of how biological systems control and exploit electron flow will be used to develop modular biochemical conversions for the production of hydrocarbon and hydrogen biofuels. This project will conduct an in-depth study of metalloenzyme structure-function relationships that enable retuning of catalytic sites, electron-transfer thermodynamics, and the evolution of tailor-designed chemical reactions involving two model enzymes: hydrogenase and nitrogenase. The center is organized into three major thrust areas: Thrust 1. Energy conservation and electron flow; Thrust 2. ATP-coupled electron transfer; and Thrust 3. Atomic level determinants of enzymatic redox properties and their relationship to catalytic bias. We will develop a collective knowledge in metalloenzymes by applying physical science and computational tools to characterize biochemical reactions catalyzed specifically by multi-subunit enzymes harboring iron-sulfur clusters and flavin cofactors, as models for redox reactions throughout biology. Understanding these mechanisms is central to overcoming the key thermodynamic barriers currently limiting production of reduced products and biofuels. The research plan of the BETCy EFRC has been designed to provide the basis to exploit unique biochemical mechanisms that have yet to be explored substantively in the context of bioenergy but have the potential for game-changing advancement. The successful outcome of this research will be a collection of fundamental principles that serve as a blueprint to enable the tailored re-design of biological systems and enzymes to control matter and energy at the level of electrons and molecules to provide the foundations to create new energy technologies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Implementation of the Jacobian-free Newton–Krylov method for solving the first-order ice sheet momentum balance

We have implemented the Jacobian-free Newton-Krylov (JFNK) method for solving the first-order ice sheet momentum equation in order to improve the numerical performance of the Glimmer-Community Ice Sheet Model (Glimmer-CISM), the land ice component of the Community Earth System Model (CESM). Our JFNK implementation is based on significant re-use of existing code. For example, our physics-based preconditioner uses the original Picard linear solver in Glimmer-CISM. For several test cases spanning a range of geometries and boundary conditions, our JFNK implementation is 1.8-3.6 times more efficient than the standard Picard solver in Glimmer-CISM. Importantly, this computational gain of JFNK over the Picard solver increases when refining the grid. Global convergence of the JFNK solver has been significantly improved by rescaling the equation for the basal boundary condition and through the use of an inexact Newton method. While a diverse set of test cases show that our JFNK implementation is usually robust, for some problems it may fail to converge with increasing resolution (as does the Picard solver). Globalization through parameter continuation did not remedy this problem and future work to improve robustness will explore a combination of Picard and JFNK and the use of homotopy methods.

Computer Science↗

Computational discovery of ultra-strong, stable, and lightweight refractory multi-principal element alloys. Part II: comprehensive ternary design and validation

Abstract Here the discovery of refractory multi-principal element alloys (MPEAs) with high-temperature strength and stability is pursued within a constrained and application-relevant design space. A comprehensive approach is developed and applied to explore all 165 ternary systems in the Al-Ce-Fe-Hf-Mo-Nb-Ta-Ti-V-W-Zr family. A subset of ternary systems that contain large areas in composition–temperature space with high strength and robust BCC phase stability is found. Twelve sets of high-performing alloys are identified, each set optimized for one combination of phase constraint, optimization target, and temperature range. Preliminary mechanical tests support the viability of the method. This work highlights the importance of considering phase stability, exploring non-equiatomic regions of composition space, and applying application-relevant constraints. Parts I and II provide three down-selection techniques for identifying high-performing BCC refractory MPEAs, design guidelines, and many candidates predicted to have BCC phase stability and strengths 2–3 times higher than any reported to date.

36 MATERIALS SCIENCE↗

A spectrum slicing method for the Kohn–Sham problem

Solving the Kohn–Sham equation, which arises in density functional theory, is a standard procedure to determine the electronic structure of atoms, molecules, and condensed matter systems. The solution of this nonlinear eigenproblem is used to predict the spatial and energetic distribution of electronic states. However, obtaining a solution for large systems is computationally intensive because the problem scales super-linearly with the number of atoms. Here we demonstrate a divide and conquer method that partitions the necessary eigenvalue spectrum into slices and computes each partial spectrum on an independent group of processors in parallel. We focus on the elements of the spectrum slicing method that are essential to its correctness and robustness such as the choice of filter polynomial, the stopping criterion for a vector iteration, and the detection of duplicate eigenpairs computed in adjacent spectral slices. Some of the more prominent aspects of developing an optimized implementation are discussed.

Computer Science↗

Sassena — X-ray and neutron scattering calculated from molecular dynamics trajectories using massively parallel computers

Massively parallel computers now permit the molecular dynamics (MD) simulation of multi-million atom systems on time scales up to the microsecond. However, the subsequent analysis of the resulting simulation trajectories has now become a high performance computing problem in itself. Here, we present software for calculating X-ray and neutron scattering intensities from MD simulation data that scales well on massively parallel supercomputers. The calculation and data staging schemes used maximize the degree of parallelism and minimize the IO bandwidth requirements. The strong scaling tested on the Jaguar Petaflop Cray XT5 at Oak Ridge National Laboratory exhibits virtually linear scaling up to 7000 cores for most benchmark systems. Since both MPI and thread parallelism is supported, the software is flexible enough to cover scaling demands for different types of scattering calculations. The result is a high performance tool capable of unifying large-scale supercomputing and a wide variety of neutron/synchrotron technology.

Computer Science↗

Petascale turbulence simulation using a highly parallel fast multipole method on GPUs

This paper reports large-scale direct numerical simulations of homogeneous-isotropic fluid turbulence, achieving sustained performance of 1.08 petaflop/s on gpu hardware using single precision. The simulations use a vortex particle method to solve the Navier–Stokes equations, with a highly parallel fast multipole method (fmm) as numerical engine, and match the current record in mesh size for this application, a cube of computational points solved with a spectral method. The standard numerical approach used in this field is the pseudo-spectral method, relying on the fft algorithm as the numerical engine. The particle-based simulations presented in this paper quantitatively match the kinetic energy spectrum obtained with a pseudo-spectral method, using a trusted code. In terms of parallel performance, weak scaling results show the fmm-based vortex method achieving 74% parallel efficiency on 4096 processes (one gpu per mpi process, 3 gpus per node of the tsubame-2.0 system). The fft-based spectral method is able to achieve just 14% parallel efficiency on the same number of mpi processes (using only cpu cores), due to the all-to-all communication pattern of the fft algorithm. The calculation time for one time step was 108 s for the vortex method and 154 s for the spectral method, under these conditions. Computing with 69 billion particles, this work exceeds by an order of magnitude the largest vortex-method calculations to date.

Computer Science↗

CPMC-Lab: A Matlab package for Constrained Path Monte Carlo calculations

We describe CPMC-Lab, a Matlab program for the constrained-path and phaseless auxiliary-field Monte Carlo methods. These methods have allowed applications ranging from the study of strongly correlated models, such as the Hubbard model, to ab initio calculations in molecules and solids. The present package implements the full ground-state constrained-path Monte Carlo (CPMC) method in Matlab with a graphical interface, using the Hubbard model as an example. The package can perform calculations in finite supercells in any dimensions, under periodic or twist boundary conditions. Importance sampling and all other algorithmic details of a total energy calculation are included and illustrated. This open-source tool allows users to experiment with various model and run parameters and visualize the results. It provides a direct and interactive environment to learn the method and study the code with minimal overhead for setup. Furthermore, the package can be easily generalized for auxiliary-field quantum Monte Carlo (AFQMC) calculations in many other models for correlated electron systems, and can serve as a template for developing a production code for AFQMC total energy calculations in real materials. Several illustrative studies are carried out in one- and two-dimensional lattices on total energy, kinetic energy, potential energy, and charge- and spin-gaps.

Computer Science↗

Scalable Metropolis Monte Carlo for simulation of hard shapes

We design and implement a scalable hard particle Monte Carlo simulation toolkit (HPMC), and release it open source as part of HOOMD-blue. HPMC runs in parallel on many CPUs and many GPUs using domain decomposition. We employ BVH trees instead of cell lists on the CPU for fast performance, especially with large particle size disparity, and optimize inner loops with SIMD vector intrinsics on the CPU. Our GPU kernel proposes many trial moves in parallel on a checkerboard and uses a block-level queue to redistribute work among threads and avoid divergence. HPMC supports a wide variety of shape classes, including spheres/disks, unions of spheres, convex polygons, convex spheropolygons, concave polygons, ellipsoids/ellipses, convex polyhedra, convex spheropolyhedra, spheres cut by planes, and concave polyhedra. NVT and NPT ensembles can be run in 2D or 3D triclinic boxes. Additional integration schemes permit Frenkel–Ladd free energy computations and implicit depletant simulations. In a benchmark system of a fluid of 4096 pentagons, HPMC performs 10 million sweeps in 10 min on 96 CPU cores on XSEDE Comet. The same simulation would take 7.6 h in serial. HPMC also scales to large system sizes, and the same benchmark with 16.8 million particles runs in 1.4 h on 2048 GPUs on OLCF Titan.

Computer Science↗

GPU implementation of the linear scaling three dimensional fragment method for large scale electronic structure calculations

LS3DF, namely linear scaling three-dimensional fragment method, is an efficient linear scaling ab initio total energy electronic structure calculation code based on a divide-and-conquer strategy. In this paper, we present our GPU implementation of the LS3DF code. Our test results show that the GPU code can calculate systems with about ten thousand atoms fully self-consistently in the order of 10 min using thousands of computing nodes. This makes the electronic structure calculations of 10,000-atom nanosystems routine work. This speed is 4.5–6 times faster than the CPU calculations using the same number of nodes on the Titan machine in the Oak Ridge leadership computing facility (OLCF). Such speedup is achieved by (a) carefully re-designing of the computationally heavy kernels; (b) redesign of the communication pattern for heterogeneous supercomputers.

Computer Science↗