Search NASASearch

SEARCH · Search NASA

Results for “Computing”

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

To Derive or Not to Derive: I/O Libraries Take Charge of Derived Quantities Computation

The ever-increasing volume of data produced by HPC simulations necessitates scalable methods for data exploration and knowledge extraction. Scientific data analysis often involves complex queries across distributed datasets, requiring manipulation of multiple primary variables and generating derived data that needs to be handled efficiently, creating challenges for applications that need to parse many large datasets. Relying on individual applications to handle all intermediate data generally leads to redundant computations across studies and unnecessary data transfers. In this paper, we investigate the performance of different approaches where applications define derived variables as quantities of interest (QoIs) and offload the computation and transfer of these QoIs to the I/O library. This significantly reduces redundancy and optimizes data movement across the distributed storage and processing infrastructure by allowing control over when and where derived variables are computed. We present a detailed analysis of the performance-storage trade-offs associated with different solutions and showcase results for our study on two large-scale datasets created from climate and combustion simulations.

Gainaru, Ana

Ensemble Simulations on Leadership Computing Systems

Scientific productivity can be enhanced through workflow management tools, relieving large High Performance Computing (HPC) system users from the tedious tasks of scheduling and designing the complex computational execution of scientific applications. This paper presents a study on the usage of ensemble workflow tools to accelerate science using the Summit and Frontier supercomputing systems. The research aims to connect science domain simulations using Oak Ridge Leadership Computing Facility (OLCF) supercomputing platforms with ensemble workflow methods in order to accelerate HPC-enabled discovery and boost scientific impact. We present the coupling, porting and optimization of Radical-Cybertools on three applications: Chroma, NAMD and LAMMPS. The tools augment traditional HPC monolithic runs with a pilot scheduler. Lessons-learned are discussed for physics, biology and materials science applications. We discuss intrinsic limitations of coupling and porting ensemble workflow tools to applications that run on large HPC systems. The origins of technical challenges and their solutions developed during the implementation process are discussed. Data management strategies, OLCF’s policies for ensembles, and natively supported workflow tools are also summarized.

Georgiadou, Antigoni [ORNL] (ORCID:000000020977631

ResSR: A Computationally Efficient Residual Approach to Super-Resolving Multispectral Images

Multispectral imaging (MSI) plays a critical role in material classification, environmental monitoring, and remote sensing. However, MSI sensors typically have wavelength-dependent resolution, which limits downstream analysis. MSI super-resolution (MSI-SR) methods address this limitation by reconstructing all bands at a common high spatial resolution. Existing methods can achieve high reconstruction quality but often rely on spatially-coupled optimization or large learning-based models, leading to significant computational cost and limiting their use in large-scale or time-critical settings. In this paper, we introduce ResSR, a computationally efficient, model-based MSI-SR method that achieves high-quality reconstruction without supervised training or spatially-coupled optimization. Notably, ResSR decouples spectral and spatial processing into two sequential steps. ResSR first computes a spectrally-informed high-resolution estimate of the MSI using singular value decomposition together with a spatially-decoupled approximate forward model. It then applies a residual correction step to restore low-frequency spatial consistency while preserving high-frequency detail recovered by the spectral reconstruction. ResSR achieves comparable or improved reconstruction quality relative to existing MSI-SR methods while being

Sullivan, Haley [ORNL] (ORCID:0000000274069217)

Accelerated Depth Computation for Surface Boxplots with Deep Learning

Functional depth is a well-known technique used to derive descriptive statistics (e.g., median, quartiles, and outliers) for 1D data. Surface boxplots extend this concept to ensembles of images, helping scientists and users identify representative and outlier images. However, the computational time for surface boxplots increases cubically with the number of ensemble members, making it impractical for integration into visualization tools. In this paper, we propose a deep-learning solution for efficient depth prediction and computation of surface boxplots for time-varying ensemble data. Our deep learning framework accurately predicts member depths in a surface boxplot, achieving average speedups of 6X on a CPU and 15X on a GPU for the 2D Red Sea dataset with 50 ensemble members compared to the traditional depth computation algorithm. Our approach achieves at least a 99% level of rank preservation, with order flipping occurring only at pairs with extremely similar depth values that pose no statistical differences. This local flipping does not significantly impact the overall depth order of the ensemble members.

Han, Mengjiao

A Novel Approach for Computing Rigid Body Motion Using Linear Accelerations

Here, a novel approach is presented for computing general rigid body motion based on a few known linear accelerations. This method utilizes linear acceleration data obtained from three distinct points on the body, all within a body-fixed reference frame. The only requirement is that the three chosen points must not be collinear. A system of differential-algebraic equations is derived, combining principles of rigid body kinematics with theory of the rotation group SO(3). These equations provide a framework for numerically computing various motion parameters, including angular velocity, angular acceleration, body orientation, velocity field, acceleration field, and displacement field. By numerically solving this system of equations, we can fully characterize rigid body motion in three-dimensional space. A numerical example is provided to demonstrate the practical implementation and efficacy of the proposed technique, illustrating its potential for accurate motion computation in various applications.

42 ENGINEERING

Computational Modeling of a 3D Printed Recuperator and Subsequent Experimental Loop for Supercritical Carbon Dioxide Cycles

Oak Ridge National Laboratory (ORNL), in collaboration with mechanical-thermal energy storage (mTES) provider EarthEn, a US Department of Energy (DOE) Lab-Embedded Entrepreneurship Program (LEEP) recipient at ORNL’s Innovation Crossroads 2023, is utilizing a state-of-the-art patented 3D printing technique to design an additively manufactured (AM) supercritical CO2 (sCO2) recuperator (REC) for EarthEn’s charge/discharge cycle. The AM REC will be printed at ORNL’s Manufacturing Demonstration Facility using Inconel Alloy 718 and tested on a closed-loop, ∼100 kW scale experimental facility that is under construction. The testing will compare the printed design against a commercial-off-the-shelf Printed Circuit Heat Exchanger (PCHE) REC. The design of the sCO2 facility is guided by a Modelica-based system model which is primarily dependent on the open-source TRANSFORM library developed at ORNL and uses the open-source CoolProp library for thermophysical properties of sCO2 via the External Media library. It is envisioned that an iterative process will be followed between the physical loop and the system model wherein the initial experimental data will be used to tune the model, which in turn will be used to guide future loop operation. Simultaneously, the AM REC is being designed using computer-aided design models, and it is also being analyzed for hydraulic and thermomechanical response using commercial computational fluid dynamics software, Simcenter STAR-CCM+, on highperformance computing resources.1

See, Nate [ORNL] (ORCID:0000000178581202)

NuLattice: Ab initio computations of atomic nuclei on lattices

Here, we introduce NuLattice, a Python software package for ab initio computations of atomic nuclei on lattices. The computational tools consist of Hartree Fock, the coupled cluster method, the in-medium similarity renormalization group, and full configuration interaction. At present, the employed interactions are from pion-less effective field theory at leading order and consist of two-body and three-body contacts. We present results for light nuclei 2 H, 3,4 He, 8 Be, 12 C, and 16 O. NuLattice algorithms exploit the sparsity and locality of lattice interactions, and as a result computations can be run on laptops.

Rothman, Maxwell [Univ. of Tennessee, Knoxville, T

Real-time High-resolution X-Ray Computed Tomography

Computed Tomography (CT) serves as a key imaging technology that relies on computationally intensive filtering and back-projection algorithms for 3D image reconstruction. While conventional high-resolution image reconstruction (> 2K3) solutions provide quick results, they typically treat reconstruction as an offline workload to be performed remotely on large-scale HPC systems. The growing demand for post-construction AI-driven analytics and the need for real-time adjustments call for high-resolution reconstruction solutions that are feasible on local computing resources, i.e. a multi-GPU server at most. In this paper, we propose a novel approach that utilizes Tensor Cores to optimize image reconstruction without sacrificing precision. We also introduce a framework designed to enable real-time execution of end-to-end distributed image reconstruction in a multi-GPU environment. Evaluations conducted on a single Nvidia A100 and H100 GPU show performance improvements of 1.91 × and 2.15 × compared to highly optimized production libraries. Furthermore, our framework, when deployed on 8-card Nvidia A100 GPU system, demonstrates the ability to reconstruct real-world datasets into 20483 volumes (32 GB) in slightly more than one minute and 40963 volumes (256 GB) in 7 minutes.

Wu, Du

NeuroCoreX: Brain-Inspired Computing from Code to Circuit

NeuroCoreX is an open-source codebase that enables the implementation of brain-inspired, energy-efficient neuromorphic computing models on FPGA hardware. Designed to support real-time learning, all-to-all neural connectivity, and flexible network architectures, NeuroCoreX offers a hands-on, accessible platform for exploring biologically inspired models of neural computation. It empowers researchers, students, and developers to implement and experiment with adaptive systems—bringing the power of neuromorphic computing to a broader community through a low-cost, scalable, and reconfigurable framework.

Gautam, Ashish [Oak Ridge National Laboratory (ORN

Adaptive Computing (AC) [SWR-24-106]

The Adaptive Computing (AC) software stack supports goal-based computing, for which a simulation workload is created on the fly adapting to the results of calculations. Application-specific code defines an objective, which may be to solve an optimization problem or to train a surrogate model with minimal uncertainty. Then, the AC driver decides where in the design parameter space to run simulations to best achieve that objective. This process is iterative and online; as new data is returned from simulations, the AC driver chooses new simulations to run. The AC driver can strategically run simulations on distributed hardware resources (including high performance computing machines, cloud resources, and edge devices) to maximize throughput and obey resource constraints.

Griffin, Kevin [National Renewable Energy Laborato

Adaptive Computing (AC) (Open Source) [SWR-24-106]

The Adaptive Computing (AC) software stack supports goal-based computing, for which a simulation workload is created on the fly, adapting to the results of calculations. Application-specific code defines an objective, which may be to solve an optimization problem or to train a surrogate model with minimal uncertainty. Then, the AC driver decides where in the design parameter space to run simulations to best achieve that objective. This process is iterative and online; as new data is returned from simulations, the AC driver chooses new simulations to run. The AC driver can strategically run simulations on distributed hardware resources (including high performance computing machines, cloud resources, and edge devices) to maximize throughput and obey resource constraints.

Griffin, Kevin [National Laboratory of the Rockies

Finding the perfect imperfection: Accelerated, computationally driven discovery and design of quantum defects

Optically addressable spin defects have emerged as the leading platforms for quantum sensing and communication in solid-state systems. While traditional efforts have concentrated on a focused set of well-studied defects, recent advances in high-throughput computational methods have shown promise for large-scale exploration of defects across diverse semiconductor hosts. By cataloging key properties of quantum defects in computational databases, high-throughput screening techniques can systematically suggest and design novel candidates. In this article, we highlight recent advances in data-driven quantum defect design aimed at addressing critical materials science challenges such as host materials selection, defect stability, and desirable electronic and optical properties. Here, we emphasize the importance of electronic-structure-guided searches across various materials and illustrate how high-throughput computations contribute to our understanding of design principles for quantum defects. Additionally, we outline ongoing challenges and emerging opportunities in this rapidly developing field.

Xiong, Yihuang [Dartmouth College, Hanover, NH (Un

Assessing Ground State Energy of Molecules and Energy Profile of the NH3 Capturing CO2 System Using the Quantum Computing Algorithms

Molecule size correlates with the number of electrons on electronic energies and strength of anharmonicity on vibrational properties, however, it is challenging to address using classical computing. In this study, variational quantum eigensolver (VQE) algorithm was implemented on a quantum simulator to quantify electronic and vibrational energies and reaction pathways of CO2 + NH3 = NH2COOH. The VQE-based Hartree-Fock-Embedding algorithm was adopted to benchmark electronic energies for a series of molecules (doi.org/10.1063/5.0188249) and quantify the reaction energy profile of the CO2 capture reaction (doi.org/10.1116/5.0137750). The generated reaction profile is in good agreement with the classical high-level Coupled-Cluster-Singles-and-Doubles (CCSD) results. The quantum computing algorithm also helps enhance the calculation of vibrational ground-state energies by considering the many-body coupling using the Vibrational Self-Consistent Field method, providing results for CO2 and NH3 molecules with accuracy comparable to the direct diagonalization method. Our approach indicates quantum computing can be applied to solve practical problems.

Lee, Yueh-Lin

Precision Computations in Strongly Coupled Conformal Field Theories (Final Technical Report)

Conformal Field Theories (CFTs) are quantum field theories that are invariant under the conformal symmetry group (which includes translations and rotations, but also local rescalings of spacetime). They are building blocks of general quantum field theories, and appear in many areas of physics, including statistical physics, condensed matter physics, particle physics, and quantum gravity. Because of their extra symmetries, the mathematical structure of CFTs is tightly constrained, and this leads to the idea of the ``conformal bootstrap," which is to use these mathematical structures to constrain, and in some cases determine, CFT observables. A new numerical implementation of the conformal bootstrap idea appeared in 2008 with the work of Rattazzi, Rychkov, Tonni, and Vichi. Their observation was that certain bootstrap constraints (conformal symmetry and unitarity) could be combined to yield a convex optimization problem that constraints CFT data. By solving this convex optimization problem on a computer, one could obtain bounds on observables like critical exponents and operator product expansion (OPE) coefficients. Over the course of this award, the PI has improved numerical bootstrap techniques by optimizing known algorithms and finding new ones for performing the required convex optimization computations. The PI has applied these techniques to compute high-precision observables in several important strongly-coupled systems. The PI has also explored both analytical and numerical bootstrap methods for constraining the space of low energy effective field theories of quantum gravity, and developed new analytical techniques for CFT and QFT more broadly.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Symposium MT02: Statistical Mechanics-Based Computational Tools for the Study of Phase Transformation in Complex Materials (Final Report)

Symposium MT02 brought together a diverse and interdisciplinary community of scientists specializing in Statistical Mechanics-based computational modeling to investigate phase transformations in materials exhibiting complex disordered structures. As the demand for materials with extreme performance metrics grows—from aerospace components to next-generation optical fibers—the ability to predict microstructural evolution under non-equilibrium conditions has become paramount. The primary goal of this symposium was to identify, evaluate, and discuss advanced computational tools capable of designing precise manufacturing conditions to tailor material properties efficiently. By fostering a dialogue between computational theorists and experimentalists, the symposium sought to establish new protocols for predicting how processing history—such as cooling rates or strain paths—dictates the final microstructure.

36 MATERIALS SCIENCE

Problem-tailored Simulation of Energy Transport on Noisy Quantum Computers

The transport of conserved quantities like spin and charge is fundamental to characterizing the behavior of quantum many-body systems. Numerically simulating such dynamics is generically challenging, which motivates the consideration of quantum computing strategies. However, the relatively high gate errors and limited coherence times of today's quantum computers pose their own challenge, highlighting the need to be frugal with quantum resources. In this work we report simulations on quantum hardware of infinite-temperature energy transport in the mixed-field Ising chain, a paradigmatic many-body system that can exhibit a range of transport behaviors at intermediate times. We consider a chain with L = 12 sites and find results broadly consistent with those from ideal circuit simulators over 90 Trotter steps, containing up to 990 entangling gates. To obtain these results, we use two key problem-tailored insights. First, we identify a convenient basis – the Pauli Y basis – in which to sample the infinite-temperature trace and provide theoretical and numerical justifications for its efficiency relative to, e.g., the computational basis. Second, in addition to a variety of problem-agnostic error mitigation strategies, we employ a renormalization strategy that compensates for global nonconservation of energy due to device noise. We discuss the applicability of the proposed sampling approach beyond the mixed-field Ising chain and formulate a variational method to search for a sampling basis with small sample-to-sample fluctuations for an arbitrary Hamiltonian. This opens the door to applying these techniques in more general models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Scale-up Unlearnable Examples Learning with High-performance Computing

Recent advancements in AI models, like ChatGPT, are structured to retain user interactions, which could inadvertently include sensitive healthcare data. In the healthcare field, particularly when radiologists use AI-driven diagnostic tools hosted on online platforms, there is a risk that medical imaging data may be repurposed for future AI training without explicit consent, spotlighting critical privacy and intellectual property concerns around healthcare data usage. Addressing these privacy challenges, a novel approach known as Unlearnable Examples (UEs) has been introduced, aiming to make data unlearnable to deep learning models. A prominent method within this area, called Unlearnable Clustering (UC), has shown improved UE performance with larger batch sizes but was previously limited by computational resources (e.g., a single workstation). To push the boundaries of UE performance with theoretically unlimited resources, we scaled up UC learning across various datasets using Distributed Data Parallel (DDP) training on the Summit supercomputer. Our goal was to examine UE efficacy at high-performance computing (HPC) levels to prevent unauthorized learning and enhance data security, particularly exploring the impact of batch size on UE’s unlearnability. Utilizing the robust computational capabilities of the Summit, extensive experiments were conducted on diverse datasets such as Pets, MedMNist, Flowers, and Flowers102. Our findings reveal that both overly large and overly small batch sizes can lead to performance instability and affect accuracy. However, the relationship between batch size and unlearnability varied across datasets, highlighting the necessity for tailored batch size strategies to achieve optimal data protection. The use of Summit’s high-performance GPUs, along with the efficiency of the DDP framework, facilitated rapid updates of model parameters and consistent training across nodes. Our results underscore the critical role of selecting appropriate batch sizes based on the specific characteristics of each dataset to prevent learning and ensure data security in deep learning applications. The source code is publicly available at https: // github. com/ hrlblab/ UE_ HPC .

Zhu, Yanfan [Vanderbilt University, Nashville, TN,

Computational Advances in Ionic Liquid Applications for Green Chemistry: A Critical Review of Lignin Processing and Machine Learning Approaches

The valorization and dissolution of lignin using ionic liquids (ILs) is critical for developing sustainable biorefineries and a circular bioeconomy. This review aims to critically assess the current state of computational and machine learning methods for understanding and optimizing IL-based lignin dissolution and valorization processes reported since 2022. The paper examines various computational approaches, from quantum chemistry to machine learning, highlighting their strengths, limitations, and recent advances in predicting and optimizing lignin-IL interactions. Key themes include the challenges in accurately modeling lignin’s complex structure, the development of efficient screening methodologies for ionic liquids to enhance lignin dissolution and valorization processes, and the integration of machine learning with quantum calculations. These computational advances will drive progress in IL-based lignin valorization by providing deeper molecular-level insights and facilitating the rapid screening of novel IL-lignin systems.

09 BIOMASS FUELS