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 1,171 records · Page 65

A High Performance Computational Framework for Dynamic Security Assessment under Uncertainty

Dynamic security assessment (DSA) is a critical function to evaluate power grids’ capability to survive the transition caused by a set of disturbances to an acceptable steady-state condition. Its computational burden is heavy. With the challenges brought by renewable energy and new smart grid technologies, DSA under uncertainty has to be considered to study the impact of forecast errors on DSA simulation, which further increases the computational burden. To address this challenge, this paper presents a high performance computational framework to support DSA simulation user uncertainty. The computational framework aims to provide a seamless workflow that links data from high performance computing, statistical analysis, to visualization so that a problem can be easily expressed in a way compatible with different functions. It also enables software compatibility such that application development can be more efficient. Case study results of the ESCA60 system and a western U.S. size system show the advantages and efficiency of the computational framework.

dynamic security assessment, high performance comp↗

Privacy by Design in Distributed Edge Systems: Innovating Secure Workflows for Smart Cities

The proliferation of distributed edge systems, such as those in smart cities, healthcare, and industrial IoT, offers unprecedented opportunities for data processing closer to its source, thereby reducing latency and enhancing efficiency. However, these systems also present significant privacy challenges due to the handling of sensitive data from multiple sources. This article explores the critical need for designing privacy-preserving workflows in distributed edge systems to ensure data security while maximizing the potential of edge computing. By examining the challenges, technological advancements, and potential of privacy-by-design approaches, we highlight the importance of integrating advanced privacy-preserving techniques like federated learning, differential privacy, homomorphic encryption, secure multi-party computation, and zero-knowledge proofs. These innovations are crucial for enhancing data security, regulatory compliance, and public trust in smart city applications, ultimately leading to safer and more efficient urban environments.

Kotevska, Olivera↗

MMMnet: A Neural Network Surrogate for Real-Time Transport Prediction Based on the Updated Multi-Mode Model

The Multi-Mode Model (MMM) is a physics-based anomalous transport model integrated into TRANSP for predicting electron and ion thermal transport, electron and impurity particle transport, and toroidal and poloidal momentum transport. While MMM provides valuable predictive capabilities, its computational cost, although manageable for standard simulations, is too high for real-time control applications. MMMnet, a neural network-based surrogate model, is developed to address this challenge by significantly reducing computation time while maintaining high accuracy. Trained on TRANSP simulations of DIII-D discharges, MMMnet incorporates an updated version of MMM (9.0.10) with enhanced physics, including isotopic effects, plasma shaping via effective magnetic shear, unified correlation lengths for ion-scale modes, and a new physics-based model for the electromagnetic electron temperature gradient mode. A key advancement is MMMnet’s ability to predict all six transport coefficients, providing a comprehensive representation of plasma transport dynamics. MMMnet achieves a two-order-of-magnitude speed improvement while maintaining strong correlation with MMM diffusivities, making it well-suited for real-time tokamak control and scenario optimization.

DIII-D↗

Realizing a Spacesuit Compatible Augmented Reality System to Meet the Work Needs of Future Human Spaceflight Exploration

In this paper, we identify the broad range of challenges associated with creating an augmented reality for future spaceflight missions. The challenges were framed within a sociotechnical framework to explore how an imagined augmented reality system might one day help crew cope with future exploration mission demands. Key challenges include an augmented reality system cannot simply be designed to help a single suited astronaut and must enable the broader mission team. There exists a host of optical, compute, and control technical challenges that must be simultaneously addressed while the work domain itself is in development. There exist limited methods to help cope with the envisioned world problem; however, we emphasize a few strategies to articulate work design assumptions and host this detail in a transparent fashion. Finally, we note the broader organizational constraints that shape the creation of such novel technology for spaceflight. By addressing these broad range of challenges directly, early in the design and development process, key trade-offs can be considered and fundamental concerns within the community can be addressed to yield desired mission outcomes.

Matthew J. Miller↗

Combining Partial Redundancy and Checkpointing for HPC

Today's largest High Performance Computing (HPC) systems exceed one Petaflops (10^15 floating point operations per second) and exascale systems are projected within seven years. But reliability is becoming one of the major challenges faced by exascale computing. With billion-core parallelism, the mean time to failure is projected to be in the range of minutes or hours instead of days. Failures are becoming the norm rather than the exception during execution of HPC applications. Current fault tolerance techniques in HPC focus on reactive ways to mitigate faults, namely via checkpoint and restart (C/R). Apart from storage overheads, C/R-based fault recovery comes at an additional cost in terms of application performance because normal execution is disrupted when checkpoints are taken. Studies have shown that applications running at a large scale spend more than 50\% of their total time saving checkpoints, restarting and redoing lost work. Redundancy is another fault tolerance technique, which employs redundant processes performing the same task. If a process fails, a replica of it can take over its execution. Thus, redundant copies can decrease the overall failure rate. The downside of redundancy is that extra resources are required and there is an additional overhead on communication and synchronization. This work contributes a model and analyzes the benefit of C/R in coordination with redundancy at different degrees to minimize the total wallclock time and resources utilization of HPC applications. We further conduct experiments with an implementation of redundancy within the MPI layer on a cluster. Our experimental results confirm the benefit of dual and triple redundancy - but not for partial redundancy - and show a close fit to the model. At 80,000 processes, dual redundancy requires twice the number of processing resources for an application but allows two jobs of 128 hours wallclock time to finish within the time of just one job without redundancy. For narrow ranges of processor counts, partial redundancy results in the lowest time. Once the count exceeds 770, 000, triple redundancy has the lowest overall cost. Thus, redundancy allows one to trade-off additional resource requirements against wallclock time, which provides a tuning knob for users to adapt to resource availabilities.

Elliott, James↗

Computationally aided, entropy-driven synthesis of highly efficient and durable multi-elemental alloy catalysts

Multi-elemental alloy nanoparticles (MEA-NPs) hold great promise for catalyst discovery in a virtually unlimited compositional space. However, rational and controllable synthesize of these intrinsically complex structures remains a challenge. Here, we report the computationally aided, entropy-driven design and synthesis of highly efficient and durable catalyst MEA-NPs. The computational strategy includes prescreening of millions of compositions, prediction of alloy formation by density functional theory calculations, and examination of structural stability by a hybrid Monte Carlo and molecular dynamics method. Selected compositions can be efficiently and rapidly synthesized at high temperature (e.g., 1500 K, 0.5 s) with excellent thermal stability. We applied these MEA-NPs for catalytic NH 3 decomposition and observed outstanding performance due to the synergistic effect of multi-elemental mixing, their small size, and the alloy phase. We anticipate that the computationally aided rational design and rapid synthesis of MEA-NPs are broadly applicable for various catalytic reactions and will accelerate material discovery.

36 MATERIALS SCIENCE↗

Large-Scale and Extreme-Scale Computing with Stranded Green Power: Opportunities and Costs

Power consumption and associated carbon emissions are increasingly critical challenges for large-scale computing. Recent research proposes exploiting stranded power-uneconomic renewable power-for green supercomputing in a system called Zero-Carbon Cloud (ZCCloud). These efforts studied production supercomputing workloads on stranded-power based computing resources, demonstrating their achievable productivity. We explore economic viability of stranded-power based supercomputing, using three datacenter total-cost-of-ownership (TOO) models to study cost-effectiveness. These studies show that ZCCloud's approach can be cost-effective in the USA today, and is even more attractive in regions with higher power prices (e.g., Japan, Germany), achieving cost advantages as large as 50 percent. Environmental and power-grid benefits are a further advantage. We also explore the sensitivity of these results to changes in hardware TOO; cheaper hardware or longer lifetimes magnify the attractiveness of stranded-power based approaches, yielding advantages as large as 91 percent. These results are robust across different TCO models. Lastly, we study extreme-scale supercomputers ( >100 MW), finding stranded-power can increase peak capability per cost by as much as 80 percent.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Improved Methods for Modeling Functional Transition Metal Compounds in Complex Environments: Ground States, Excited States, and Spectroscopies

Rapid advances in energy applications require new theory and computational models to provide guidance for interpretation of experimental results and mechanistic understanding. New theory development is necessary to treat systems of increasing complexity, size, and relevance to real applications. Functional transition metal compounds, including molecules, clusters, nanoparticles, surfaces, and solids, provide particular promise for magnetic, optical, and catalytic applications. However, such systems can be exceptionally challenging to model. To make progress in understanding and designing transition metal compounds for energy applications, theory must be able to simulate such systems in complex environments, as well as simulate the spectra of such complex systems to provide direct connections with experiment. Leveraging the independent expertise of the team’s members, this project aimed to make inroads to the theoretical and computational challenges associated with studying transition metal compounds, their reaction chemistry, photophysics and photochemistry, and response to spectroscopic interrogation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Understanding the Impact of Data Staging for Coupled Scientific Workflows

We report the rate of data generated by cutting-edge experimental science facilities and large-scale simulations enabled by current high-performance computing (HPC) systems has continued to grow at a far greater pace than the development of the network and storage capabilities on which these systems rely. To cope with this challenge, scientist are moving toward the creation of autonomous experiments and HPC simulations using machine learning. However, efficiently moving, storing, and processing large amounts of data away from the point of origin presents an incredible challenge. In-memory computing, in situ analysis, data staging, and data streaming are recognized viable alternatives to traditional file-based methods for transferring data between coupled workflows. However, the performance trade-offs and limitations for these methods are not fully understood when used in HPC applications. This article presents a comprehensive performance assessment of the current solutions for data staging when applied to applications that are not necessary I/O intensive which makes them not ideal candidates for these methods. Our study is based on experiments running at scale on Oak Ridge National Laboratory's Summit supercomputer using applications and simulations that cover typical computational motifs and patterns. We investigated the usability and cost/benefit trade-offs of staging algorithms for HPC applications under different scenarios and highlight opportunities for optimizing the dataflow between coupled simulation workflows.

97 MATHEMATICS AND COMPUTING↗

Eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors

Symmetric tridiagonal eigenvalue problems may arise indirectly in structural dynamic analysis. An algorithm for eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors to meet the challenge of the new emerging computer hardware technology is presented. A standard bisection method in conjunction with Sylvester's Theorem is chosen to be converted into a parallel N-section algorithm. This parallel algorithm takes advantage of the multi-processor environment by carrying out N (number of processors) triangular factorizations of chosen shifted matrices in all processors concurrently and by minimizing communication between processors. The algorithm is designed for local-memory concurrent processors, i.e. message passing type processors. The efficiency and speed-up are given in terms of problem and machine parameters. The algorithm is very efficient when both the number of processors and the number of eigenvalues to be extracted are much smaller than the order of the tridiagonal matrix.

Chang, H. Y.↗

AI-Enhanced Computational Tools for Entry Systems Modeling

To advance the understanding of complex atmospheric entry phenomena, NASA’s Entry Systems Modeling (ESM) team [1] has developed high-fidelity computational tools addressing multiscale challenges, from material microstructures to full-scale heatshield response. This abstract highlights a subset of ESM tools, focusing on AI integration to enhance workflows and predictive modeling. - PuMA [2] computes effective material properties from high-resolution micro-CT scans, supporting TPS analysis for NASA missions. - TomoSAM [3] automates 3D tomography dataset segmentation for PuMA using the Segment Anything Model, reducing manual effort and improving accuracy. - PATO [4] models porous reactive materials under extreme conditions, with advancements such as unified solvers, mechanical erosion, and TPS coatings for NASA missions. - arcjetCV [5] employs deep learning to analyze arc jet test footage, measuring recession rates, shape changes, and shock standoff distances, bridging simulations, and experiments to reveal TPS ablation behavior. - ARCHeS [6] simulates arc heater plasma flows, modeling turbulence, radiation, and electromagnetic interactions to optimize arc heater performance, validate TPS under extreme conditions, and serve as a foundation for developing digital twins of arc heater facilities. - SPARTA [7] simulates rarefied hypersonic flows and gas-surface interactions for planetary entry missions, leveraging GPU architectures for scalable and efficient aerothermal and ablation analyses. AI-driven solutions, such as deep learning segmentation, have streamlined workflows in ESM tools and still hold significant potential to further accelerate processes and enhance automation in entry systems modeling. [1] Haskins, J.B. (2023), [2] Ferguson, J.C. (2018), [3] Meurisse, J.B.E. (2018), [4] Semeraro, F. (2023), [5] Quintart, A. (2024) [6] Meurisse, J.B.E. (2022), [7] Plimpton, S.J. (2019)

Predictive Modeling↗

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks—such as volumetric branch decomposition and contour extraction—have been introduced to facilitate large-scale scientific analysis. Despite these advancements, such analytical tasks substantially increase memory usage, which hampers scalability. In this paper, we propose a pre-simplification strategy to significantly reduce the memory overhead associated with analytical tasks on distributed hierarchical contour trees. We demonstrate enhanced scalability through strong scaling experiments, constructing the largest known contour tree—comprising over half a trillion nodes with complex topology—in under 15 minutes on a dataset containing 550 billion elements.

Li, Mingzhe [University of Utah]↗

OmniXAS: A universal deep-learning framework for materials x-ray absorption spectra

X-ray absorption spectroscopy (XAS) is a powerful characterization technique for probing the local chemical environment of absorbing atoms. However, analyzing XAS data presents significant challenges, often requiring extensive, computationally intensive simulations, as well as significant domain expertise. These limitations hinder the development of fast, robust XAS analysis pipelines that are essential in high-throughput studies and for autonomous experimentation. Here, we address these challenges with OmniXAS, a framework that contains a suite of transfer learning approaches for XAS prediction, each uniquely contributing to improved accuracy and efficiency, as demonstrated on the K-edge spectra database covering eight 3⁢d transition metals (Ti–Cu). The OmniXAS framework is built upon three distinct strategies. First, we use M3GNet [Nat. Comput. Sci. 2, 718 (2022)] to derive latent representations of the local chemical environment of absorption sites as input for XAS prediction, achieving significant improvements over conventional featurization techniques. Second, we employ a hierarchical transfer learning strategy, training a universal multitask model across elements before fine-tuning for element-specific predictions. Models based on this cascaded approach after elementwise fine-tuning outperform element-specific models by up to 69%. Third, we implement cross-fidelity transfer learning, adapting a universal model to predict spectra generated by simulation of a different fidelity with a much higher computational cost. This approach improves prediction accuracy by up to 11% over models trained on the target fidelity alone. Our approach significantly boosts the throughput of XAS modeling by orders of magnitude as compared to first-principles simulations and is extendable to XAS prediction for a broader range of elements. The proposed transfer learning framework is generalizable to enhance deep-learning models that target other properties in materials research.

36 MATERIALS SCIENCE↗

Lattice Boltzmann for Airframe Noise Predictions

Increase predictive use of High-Fidelity Computational Aero- Acoustics (CAA) capabilities for NASA's next generation aviation concepts. CFD has been utilized substantially in analysis and design for steady-state problems (RANS). Computational resources are extremely challenged for high-fidelity unsteady problems (e.g. unsteady loads, buffet boundary, jet and installation noise, fan noise, active flow control, airframe noise, etc) ü Need novel techniques for reducing the computational resources consumed by current high-fidelity CAA Need routine acoustic analysis of aircraft components at full-scale Reynolds number from first principles Need an order of magnitude reduction in wall time to solution!

Barad, Michael↗

Noise reduction of stochastic density functional theory for metals

Density Functional Theory (DFT) has become a cornerstone in the modeling of metals. However, accurately simulating metals, particularly under extreme conditions, presents two significant challenges. First, simulating complex metallic systems at low electron temperatures is difficult due to their highly delocalized density matrix. Second, modeling metallic warm-dense materials at very high electron temperatures is challenging because it requires the computation of a large number of partially occupied orbitals. This study demonstrates that both challenges can be effectively addressed using the latest advances in linear-scaling stochastic DFT methodologies. Despite the inherent introduction of noise into all computed properties by stochastic DFT, this research evaluates the efficacy of various noise reduction techniques under different thermal conditions. Our observations indicate that the effectiveness of noise reduction strategies varies significantly with the electron temperature. Furthermore, we provide evidence that the computational cost of stochastic DFT methods scales linearly with system size for metal systems, regardless of the electron temperature regime.

Chemistry↗

Computational Approaches for the Dynamics of Structure Formation in Self-Assembling Polymeric Materials

Polymeric materials can assemble into a multitude of intricate nanoscale morphologies whose free energy differs by only a fraction of the thermal energy per molecule. Such small free-energy differences pose a challenge for modeling and simulation but also offer exciting opportunities to direct the assembly of such materials into morphologies that do not correspond to those of equilibrium bulk structures. Over the past decade, significant progress has been achieved in our ability to guide their self-assembly through the use of confinement, topographical or chemical patterns, and electric fields. In contrast, approaches to guide self-assembly by tailoring the dynamics of structure formation have received less attention. Finally, this review discusses opportunities and challenges of recently developed computational strategies to predict the dynamics of self-assembly of polymeric materials on the basis of the underlying free-energy landscape.

36 MATERIALS SCIENCE↗

Intelligent Computational Systems. Opening Remarks: CFD Application Process Workshop

This discussion will include a short review of the challenges that must be overcome if computational physics technology is to have a larger impact on the design cycles of U.S. aerospace companies. Some of the potential solutions to these challenges may come from the information sciences fields. A few examples of potential computational physics/information sciences synergy will be presented, as motivation and inspiration for the Improving The CFD Applications Process Workshop.

VanDalsem, William R.↗

Quantum Computing and Cryptography: Analysis, Risks, and Recommendations for Decisionmakers

Some influential American policymakers, scholars, and analysts are extremely concerned with the effects that quantum computing will have on national security. Similar to the way space technology was viewed in the context of the US-Soviet rivalry in the Cold War, they view scientific advancement in quantum computing as a race with significant national security consequences and a part of the emerging US-China rivalry. It is claimed that the winner of this race will be able to thwart all the cryptographic efforts of the loser and gain unfettered access to any state secret of the losing government. Additionally, it is suggested that the winner will be able to protect their secrets with a higher level of security than contemporary cryptography guarantees at the moment. This paper argues that these three claims are considerably overstated, and that policymakers and scholars should shift focus to a different national security problem that quantum computing will create. Maintaining the long-term security of secret information secured by contemporary cryptographic protections, which will fail against an attack by a future quantum computer, is the predominant challenge needing attention. This paper takes a technically-informed approach to this issue. It first lays out the national security problems that are envisioned in much of the current discourse surrounding quantum computing. Then, it will assess the technical advantages that quantum computers will have over classical computers in the field of cryptography. Next, it will provide an explanation of the specific ways that the technical realities of quantum computing are inconsistent with the predominant areas of concern. Following, it will highlight the more pressing national security problem posed by quantum computing that the public discussion has, for the most part, missed. The piece will conclude with recommendations for how to mitigate this issue.

97 MATHEMATICS AND COMPUTING↗