Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational challenges”

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 631 records · Page 35

Understanding Interactive and Reproducible Computing With Jupyter Tools at Facilities

Increasingly Jupyter tools are being adopted and incorporated into High Performance Computing (HPC) and scientific user facilities. Adopting Jupyter tools enables more interactive and reproducible computational work at facilities across data life cycles. As the volume, variety, and scope of data grow, scientists need to be able to analyze and share results in user friendly ways. Human-centered research highlights design challenges around computational notebooks, and our qualitative user study shifts focus to better characterize how Jupyter tools are being used in HPC and science user facilities today. We conducted twenty-nine interviews, and obtained 103 survey responses from NERSC Jupyter users, to better understand the increasing role of interactive computing tools in DOE sponsored scientific work. We examine a range of issues that emerge using and supporting Jupyter in HPC ecosystems, including: how Jupyter is being used by scientists in HPC and user facility ecosystems; how facilities are purposefully supporting Jupyter in their ecosystems; feedback NERSC users have about the facility’s deployment, and, discuss features NERSC indicated would be helpful. We offer a variety of takeaways for staff supporting Jupyter at facilities, Project Jupyter and related open source communities, and funding agencies supporting interactive computing work.

97 MATHEMATICS AND COMPUTING↗

Towards quantum machine learning with tensor networks

Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. Here, we demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum-centric supercomputing for materials science: A perspective on challenges and future directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Computationally hard tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their resources for simulation, analysis, and data processing. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. Here in this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

36 MATERIALS SCIENCE↗

Modeling subgrid combustion processes in simulations of thermonuclear supernovae

Supernovae of type Ia are thought to arise from the thermonuclear incineration of a carbon-oxygen white dwarf stellar remnant. However, the detailed explosion scenario and stellar evolutionary origin scenario – or scenarios – which lead to observed supernovae are still quite uncertain. One of the principal tests of proposed scenarios is comparison with the explosion products inferred, for example, from the spectrum of the supernovae. Making this comparison requires computation of the combustion dynamics and products through simulation of proposed scenarios. Here we discuss two specific proposed explosion scenarios, the deflagration-detonation transition and the helium shell double detonation, With these two examples in mind, we proceed to discuss challenges to computational modeling of the combustion taking place in these explosions. Both subsonically and supersonically propagating reaction fronts are discussed,called deflagrations and detonations respectively. Several major stages of the combustion occur on length and time scales that are many orders of magnitude smaller than those accessible in simulations of the explosion. Models which attempt to capture this sub-grid behavior and the verification of those models is briefly discussed.

79 ASTRONOMY AND ASTROPHYSICS↗

An open-source framework for balancing computational speed and fidelity in production cost models

Studies of bulk power system operations need to incorporate uncertainty and sensitivity analyses, especially around exposure to weather and climate variability and extremes, but this remains a computational modeling challenge. Commercial production cost models (PCMs) have shorter runtimes, but also important limitations (opacity, license restrictions) that do not fully support stochastic simulation. Open-source PCMs represent a potential solution. They allow for multiple, simultaneous runs in high-performance computing environments and offer flexibility in model parameterization. Yet, developers must balance computational speed (i.e. runtime) with model fidelity (i.e. accuracy). In this paper, we present Grid Operations (GO), a framework for instantiating open-source, scale-adaptive PCMs. GO allows users to search across parameter spaces to identify model versions that appropriately balance computational speed and fidelity based on experimental needs and resource limits. Results provide generalizable insights on how to navigate the fidelity and computational speed tradeoff through parameter selection. We show that models with coarser network topologies can accurately mimic market operations, sometimes better than higher-resolution models. It is thus possible to conduct large simulation experiments that characterize operational risks related to climate and weather extremes while maintaining sufficient model accuracy.

42 ENGINEERING↗

Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

Alexeev, Yuri↗

XPRESS: eXascale PRogramming Environment and System Software

The XPRESS Project is one of four major projects of the DOE Office of Science Advanced Scientific Computing Research X-stack Program initiated in September, 2012. The purpose of XPRESS is to devise an innovative system software stack to enable practical and useful exascale computing around the end of the decade with near-term contributions to efficient and scalable operation of trans-Petaflops performance systems in the next two to three years; both for DOE mission-critical applications. To this end, XPRESS directly addresses critical challenges in computing of efficiency, scalability, and programmability through introspective methods of dynamic adaptive resource management and task scheduling.

97 MATHEMATICS AND COMPUTING↗

Direct comparison between experiments and dislocation dynamics simulations of high rate deformation of single crystal copper

A long standing challenge in computational materials science is to establish a quantitative connection between the macroscopic properties of plastic deformation with the microscopic mechanisms of dislocations in crystalline materials. Although the discrete dislocation dynamics (DDD) simulation method has been developed for several decades with the goal of addressing this challenge, a one-to-one comparison between the DDD predictions on single crystal stress–strain curves and experimental measurements under identical conditions has not been possible to date. Such a comparison is an essential step towards establishing a dislocation-physics based theory of plasticity and a multiscale framework of the plastic behaviors of crystalline materials. Here we provide direct comparisons between the stress–strain curves of Cu single crystals under high strain rate loading in the [0 0 1] and [0 1 1] directions obtained from miniaturized desktop Kolsky bar experiments and those from DDD simulations under identical loading conditions. With an appropriate set of parameters, DDD simulations can produce stress–strain curves that are in reasonable agreement with the experimental results. However, the dislocation mobility values needed to achieve this agreement are an order of magnitude lower than expected based on previous measurements and atomistic simulations. We hypothesize that this discrepancy could be caused by drag forces from jogs and point defects produced during the plastic deformation. Cross-slip of screw dislocations is also found to be necessary to capture the experimental stress–strain behavior, especially for the [0 1 1] loading direction. Finally, this work provides an example of how direct comparisons between DDD simulations and experimental measurements can provide new insight into the fundamental mechanisms of plastic deformation.

36 MATERIALS SCIENCE↗

Reduced-dimension Bayesian optimization for model calibration of transient vapor compression cycles

Development and calibration of first-principles dynamic models of vapor compression cycles (VCCs) is of critical importance for applications that include control design and fault detection and diagnostics. Nevertheless, the inherent complexity of models that are represented by large systems of differential–algebraic equations leads to significant challenges for model calibration processes that utilize classical gradient-based methods. Bayesian optimization (BO) is a sample-efficient and gradient-free approach using a probabilistic surrogate model and optimal search over a feasible parameter space. Despite the benefits of BO in reducing computational costs, challenges remain in dealing with a high-dimensional calibration task resulting from a large set of parameters that have significant impacts on system behavior and need to be calibrated simultaneously. This paper presents a reduced-dimension BO framework for calibrating transient VCCs models where the calibration space is projected to a low-dimensional subspace for accelerating convergence of the solution algorithm and consequently reducing the number of transient simulations. The proposed approach was demonstrated via two case studies associated with different VCC applications where 10 parameters were calibrated in each case using laboratory measurements. The reduced-dimension BO framework only required 1 / 8 th of the iterations associated with a standard BO method that deals with high-dimensional calibration parameters for converged solutions and yielded comparable accuracy. Furthermore, both calibrated models revealed significant accuracy improvements compared to uncalibrated models.

Ma, Jiacheng↗

Continuum electromagnetic gyrokinetic simulations of turbulence in the tokamak scrape-off layer and laboratory devices

Here, we present algorithms and results from Gkeyll, a full-f continuum, electromagnetic gyrokinetic code, designed to study turbulence in the edge region of fusion devices. The edge is computationally very challenging, requiring robust algorithms that can handle large-amplitude fluctuations and stable interactions with plasma sheaths. We present an energy-conserving high-order discontinuous Galerkin scheme that solves gyrokinetic equations in Hamiltonian form. Efficiency is improved by a careful choice of basis functions and automatically generated computation kernels. Previous verification tests were performed in the straight-field-line large plasma device [Shi et al., J. Plasma Phys. 83, 905830304 (2017)] and the Texas Helimak, a simple magnetized torus [Bernard et al., Phys. Plasmas 26, 042301 (2019)], including the effect of end-plate biasing on turbulence. Results for the scrape-off layer for NSTX parameters with a model helical magnetic geometry with bad curvature have been obtained [Shi et al., Phys. Plasmas 26, 012307 (2019)]. In this paper, we present algorithms for the two formulations of electromagnetic gyrokinetics: the Hamiltonian and the symplectic. We describe each formulation and show results of benchmark tests. Although our scheme works for the Hamiltonian formulation, the presence of spurious numerical modes for high-β and large $k^2_⊥ρ^2_s$ regimes shows that the symplectic formulation is more robust. We then review our recent algorithm for the symplectic formulation [Mandell et al., J. Plasma Phys. 86, 905860109 (2020)], along with example application of this new capability. Maintaining positivity of the distribution function can be challenging, and we describe a new and novel exponential recovery based algorithm to address this.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Mixed-Domain Charge Transport in S-Se Alloys as a Li-S Battery Cathode Material

Lithium-sulfur batteries are emerging candidate systems for the next-generation long-range electric aircraft application owing to their potential to deliver high energy density per weight. Their cathodes are to be made primarily with sulfur, but sulfur by itself has much too low electron conductivity to serve as a useful cathode. An idea that has been suggested to overcome this bottleneck is to alloy sulfur with selenium in the hope that electron mobility, which is thought to improve charge transport at some expense of increased weight and reduced energy density. However, understanding of these alloy structures and their transport mechanism is insufficient, and electron mobility at varying degrees of selenium content is not well charted, which are critical for determining the optimum selenium content and testing whether this strategy is generally feasible. The difficulty of computationally characterizing these alloy systems is rooted in the structure. The structures of both sulfur and selenium exhibit eight-atom rings that pack together in various orientations to form their respective crystals. For one, because these crystals (and presumably their alloys as well) feature multiple polymorphs such that their structural coherence is rather unclear. Secondly, these are also relatively large systems (32 atoms per cell) with low-symmetry, which complicate computation both in terms of accuracy and efficiency. Thirdly, such semi-molecular, semi-crystalline structures lead to a combination of band-transport characteristics and hopping-transport characteristics, each of which is a domain with its own physics and set of computational, theoretical challenges. In addition, there is a general dearth of experimental transport data for sulfur-selenium alloys. In this study, we make a comprehensive attempt to tackle this problem using a wide array of first-principles methods. We generate special quasirandom structures to simulate alloy structures, and compute their first-principles Raman spectra for comparison with experimental data to ensure their structural soundness. We then proceed to use recently developed, state-of-the-art tool (AMSET) in order to efficiently compute electronic mobilities under band transport of pure sulfur, pure selenium, as well as their alloys of various compositions at a reasonable accuracy. We then sample numerous dimer configurations of nearest-neighbor eight-atom-ring-pairs and compute electronic hopping rates between them, which yields hopping mobility. A combination of these efforts lead to a general mapping of electron transport behaviors throughout the alloy range. Preliminary results show that introduction of selenium into sulfur initially damages electron mobility due to disorder but eventually improves it beyond that of pure sulfur with additional selenium content, ultimately peaking at the pure-selenium limit. Band transport dominates for holes in sulfur and electrons in selenium, but in all other cases, hopping transport is dominant. Ongoing efforts include determination of charge concentration and conductivity, as well as performing multiphysics modeling to determine the optimum selenium content for best tradeoff between conductivity and energy density for aircraft range.

Junsoo Park↗

Design of an experimental breeder reactor run 138B reactor physics benchmark evaluation management application

Reactor Monte Carlo simulations present numerous challenges including input file generation and processing output files for relevant results. Creating an input file for a heterogeneous core is further complicated when using depleted fuel. Performing perturbations to geometry and material characteristics exacerbates the challenge due to human errors if the input files are manually generated. The difficulty of generating input files is often encountered during the process of performing a reactor physics benchmark evaluation. These challenges were encountered in this study when performing a reactor physics benchmark evaluation for the Experimental Breeder Reactor II (EBR-II), a sodium cooled fast reactor. The EBR-II Monte Carlo input file uses more than 1,000 unique material specifications and ~8,000 regions. To address the input file generation challenge, a computer application was designed to automate the input file generation process. The application utilizes user input from a graphical user interface in conjunction with spreadsheets containing material and geometric data to generate Monte Carlo input files. The application, called MICKA, was used to generate input files to support the reactor physics benchmark evaluation for EBR-II. This paper describes the reactor configuration and provides information about the application design and capabilities for addressing challenges often encountered in reactor physics benchmark evaluations.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Computational Methods for Jet Noise Simulation

The purpose of our project is to develop, analyze, and test novel numerical technologies central to the long term goal of direct simulations of subsonic jet noise. Our current focus is on two issues: accurate, near-field domain truncations and high-order, single-step discretizations of the governing equations. The Direct Numerical Simulation (DNS) of jet noise poses a number of extreme challenges to computational technique. In particular, the problem involves multiple temporal and spatial scales as well as flow instabilities and is posed on an unbounded spatial domain. Moreover, the basic phenomenon of interest, the radiation of acoustic waves to the far field, involves only a minuscule fraction of the total energy. The best current simulations of jet noise are at low Reynolds number. It is likely that an increase of one to two orders of magnitude will be necessary to reach a regime where the separation between the energy-containing and dissipation scales is sufficient to make the radiated noise essentially independent of the Reynolds number. Such an increase in resolution cannot be obtained in the near future solely through increases in computing power. Therefore, new numerical methodologies of maximal efficiency and accuracy are required.

Goodrich, John W.↗

Advances in Machine and Deep Learning for Modeling and Real-time Detection of Multi-Messenger Sources

We live in momentous times. The science community is empowered with an arsenal of cosmic messengers to study the universe in unprecedented detail. Gravitational waves, electromagnetic waves, neutrinos, and cosmic rays cover a wide range of wavelengths and timescales. Combining and processing these datasets that vary in volume, speed, and dimensionality requires new modes of instrument coordination, funding, and international collaboration with a specialized human and technological infrastructure. In tandem with the advent of large-scale scientific facilities, the last decade has experienced an unprecedented transformation in computing and signal-processing algorithms. The combination of graphics processing units, deep learning, and the availability of open source, high-quality datasets has powered the rise of artificial intelligence. This digital revolution now powers a multibillion dollar industry, with far-reaching implications in technology and society. In this chapter, we describe pioneering efforts to adapt artificial intelligence algorithms to address computational grand challenges in multi-messenger astrophysics. We review the rapid evolution of these disruptive algorithms, from the first class of algorithms introduced in early 2017 to the sophisticated algorithms that now incorporate domain expertise in their architectural design and optimization schemes. We discuss the importance of scientific visualization and extreme-scale computing in reducing time-to-insight and obtaining new knowledge from the interplay between models and data.

Artificial Intelligence↗

Enhanced accuracy through ensembling of randomly initialized auto-regressive models for dynamical systems

Computational mechanics simulations using traditional finite element methods (FEM) require prohibitively expensive computational resources for real-time engineering applications, design optimization, and digital twin implementations. While machine learning (ML) surrogate models offer significant computational speedups, autoregressive ML models for time-dependent mechanical systems suffer from error accumulation that compromises long-term prediction reliability - a critical concern for engineering applications where accuracy over extended time horizons is essential for safety and performance assessments. Here, we propose a deep ensemble framework specifically designed to address this challenge in computational mechanics applications, where multiple ML surrogate models with random weight initializations are trained in parallel and their predictions aggregated during inference. This approach leverages statistical diversity to maximize information gain from a fixed set of training data and to mitigate error propagation, while maintaining the computational efficiency that makes ML surrogates attractive for engineering practice. We validate the framework on three representative problems spanning critical areas of computational mechanics: stress field evolution in heterogeneous microstructures under complex loading (relevant to advanced materials design and composite analysis), planetary-scale shallow water dynamics (applicable to environmental and geotechnical engineering), and Gray-Scott reaction-diffusion systems (relevant to mass transport and chemical process engineering). Across all test cases, the ensemble approach demonstrates consistent error reduction of 15-33% compared to individual models. The codes for this work are available on GitHub (https://github.com/Graham-Brady-Research-Group/AutoregressiveEnsemble_SpatioTemporal_Evolution).

autoregressive prediction↗

Elucidating and predicting the dynamic evolution of water and land systems due to natural and energy-related forcings

Focal Area(s): 3. Insight gleaned from complex data (both observed and simulated) using AI, big data analytics, and other advanced methods, including explainable AI and physics- or knowledge-guided AI; & 1. Data acquisition and assimilation enabled by machine learning, AI, and advanced methods including experimental/network design/optimization, unsupervised learning (including deep learning), and hardware-related efforts involving AI (e.g., edge computing). Science Challenge: Interactions between water, land, and energy systems are complex and occur on a variety of scales, ranging from local to basinal to regional. Accurately predicting the behavior of ground water and surface water systems for 5-10 years and beyond requires an understanding of the current system and the ability to model both the natural system at scale and human-induced forcings related to energy and other activities. Artificial intelligence and machine learning (AI/ML) combined with modern compilation and integration efforts for U.S. groundwater and surface water systems present potential solutions to bolstering detailed physics-based models of these systems. Big data tied with ML and physics-based modeling can drive breakthroughs in understanding the earth system, but research is often impeded by data access (e.g., privacy issues), quality, formats, gaps, multi-source, multi-scale, integration, and spatiotemporal challenges. Effective integration of real data and simulated (synthetic) data that fill gaps is critical. Overcoming these complex data and model integration challenges will enable a transformational approach to acquiring enhanced understanding of environmental systems.

54 ENVIRONMENTAL SCIENCES↗

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗

APACE: AlphaFold2 and advanced computing as a service for accelerated discovery in biophysics

The prediction of protein 3D structure from amino acid sequence is a computational grand challenge in biophysics and plays a key role in robust protein structure prediction algorithms, from drug discovery to genome interpretation. The advent of AI models, such as AlphaFold, is revolutionizing applications that depend on robust protein structure prediction algorithms. To maximize the impact, and ease the usability, of these AI tools we introduce APACE, AlphaFold2 and advanced computing as a service, a computational framework that effectively handles this AI model and its TB-size database to conduct accelerated protein structure prediction analyses in modern supercomputing environments. We deployed APACE in the Delta and Polaris supercomputers and quantified its performance for accurate protein structure predictions using four exemplar proteins: 6AWO, 6OAN, 7MEZ, and 6D6U. Using up to 300 ensembles, distributed across 200 NVIDIA A100 GPUs, we found that APACE is up to two orders of magnitude faster than off-the-self AlphaFold2 implementations, reducing time-to-solution from weeks to minutes. This computational approach may be readily linked with robotics laboratories to automate and accelerate scientific discovery.

97 MATHEMATICS AND COMPUTING↗