Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

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↗
DOE OSTI2024

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↗
DOE OSTI2024

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↗
DOE OSTI2026

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↗
DOE OSTI2024

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↗
DOE OSTI2025

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,↗
DOE OSTI2024

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↗
DOE OSTI2024

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗
DOE OSTI2024

Wind farm structural response and wake dynamics for an evolving stable boundary layer: computational and experimental comparisons

Abstract. The wind turbine design process requires performing thousands of simulations for a wide range of inflow and control conditions, which necessitates computationally efficient yet time-accurate models, especially when considering wind farm settings. To this end, FAST.Farm is a dynamic-wake-meandering-based mid-fidelity engineering tool developed by the National Renewable Energy Laboratory targeted at accurately and efficiently predicting wind turbine power production and structural loading in wind farm settings, including wake interactions between turbines. This work is an extension of a study that addressed constructing a diurnal cycle evolution based on experimental data (Quon, 2024). Here, this inflow is used to validate the turbine structural and wake-meandering response between experimental data, FAST.Farm simulation results, and high-fidelity large-eddy simulation results from the coupled Simulator fOr Wind Farm Applications (SOWFA)–OpenFAST tool. The validation occurs within the nocturnal stable boundary layer when corresponding meteorological and turbine data are available. To this end, we compared the load results from FAST.Farm and SOWFA–OpenFAST to multi-turbine measurements from a subset of a full-scale wind farm. Computational predictions of blade-root and tower-base bending loads are compared to 10 min statistics of strain gauge measurements during 3.5 h of the evolving stable boundary layer, generally with good agreement. This time period coincided with an active wake-steering campaign of an upstream turbine, resulting in time-varying yaw positions of all turbines. Wake meandering was also compared between the computational solutions, generally with excellent agreement. Simulations were based on a high-fidelity precursor constructed from inflow measurements and using state-of-the-art mesoscale-to-microscale coupling.

17 WIND ENERGY↗
DOE OSTI2024

Data-Driven Computation of Probabilistic Marching Cubes for Efficient Visualization of Level-Set Uncertainty

Uncertainty visualization is an important emerging research area. Being able to visualize data uncertainty can help scientists improve trust in analysis and decision-making. However, visualizing uncertainty can add computational overhead, which can hinder the efficiency of analysis. In this paper, we propose novel data-driven techniques to reduce the computational requirements of the probabilistic marching cubes (PMC) algorithm. PMC is an uncertainty visualization technique that studies how uncertainty in data affects level-set positions. However, the algorithm relies on expensive Monte Carlo (MC) sampling for the multivariate Gaussian uncertainty model because no closed-form solution exists for the integration of multivariate Gaussian. In this work, we propose the eigenvalue decomposition and adaptive probability model techniques that reduce the amount of MC sampling in the original PMC algorithm and hence speed up the computations. Our proposed methods produce results that show negligible differences compared with the original PMC algorithm demonstrated through metrics, including root mean squared error, maximum error, and difference images. We demonstrate the performance and accuracy evaluations of our data-driven methods through experiments on synthetic and real datasets.

Athawale, Tushar↗
DOE OSTI2024

Computational Approaches for Clean Energy Materials

Currently, 80% of the global final energy consumption occurs in form of fuels and only 20% as electricity. On the other hand, renewable energy additions come almost exclusively in the form of electricity (dominantly photovoltaics and wind). Thus, a successful energy transition will require enormous growth in renewables, sufficient to convert excess electricity into fuels, as well as the development of non-electricity based solar fuel technologies. As much as photovoltaic capacities have grown over the past 20 years, it is far from clear that current technologies and materials are up to the task to grow from here by yet another factor 100 until 2050. Therefore, sustained research efforts on emerging inorganic semiconductors for solar electricity and fuels are essential for facing the double challenge of climate change and energy security. Computational materials science can make important contributions, guiding and supporting research activities through both materials search and discovery and through detailed studies that help to develop a mechanistic understanding of materials performance and bottlenecks. This presentation will highlight three recent computational projects with relevance for photovoltaics and solar fuels (1) Defect graph neural networks (dGNN) for materials discovery in solar thermochemical hydrogen (STCH) [1]. The dGNN approach facilitates broad and fast materials screening for defect properties. (2) Modeling highly off-stoichiometric systems by evaluating the free energy of defect interaction [2]. This approach allows quantitative prediction of H2 production in complex STCH oxides. (3) First-principles atomic structure prediction for interfaces [3]. This work showed how an atomically thin CdCl2 interlayer phase enables in principle ideal electron transport across the incommensurate SnO2/CdTe interface. [1] M.D. Witman, A. Goyal, T. Ogitsu, A.H. McDaniel, S. Lany, Nat. Comput. Sci. (2023). https://doi.org/10.1038/s43588-023-00495-2. [2] A. Goyal, M.D. Sanders, R.P. O'Hayre, S. Lany, PRX Energy 3, 013008 (2024). https://doi.org/10.1103/PRXEnergy.3.013008. [3] A. Sharan, M. Nardone, D. Krasikov, N. Singh, S. Lany, Appl. Phys. Rev. 9, 041411 (2022). https://doi.org/10.1063/5.0104008.

density functional theory↗
DOE OSTI2026

Scientific computing

Our research generates a vast amount of data that scientists must gather, store, analyze and interpret. These activities require expertise and the right tools. Fermilab is home to one of the largest tape robotic systems available today, providing more than 800 petabytes of storage capability. The lab is growing the tape facilities to meet expected demands of over 1,000 petabytes of additional data per year by the end of the decade. Fermilab also has the technology and computing power to efficiently pr ocess these data to facilitate scientific discoveries. Our computation al experts work closely with experimenters and the scientific commu - nity at large to provide and facilitate the use of the cutting-edge computing tools necessary for these discoveries.

Fermilab, Fermilab↗
DOE OSTI2024

Large language model evaluation for high–performance computing software development

We apply AI-assisted large language model (LLM) capabilities of GPT-3 targeting high-performance computing (HPC) kernels for (i) code generation, and (ii) auto-parallelization of serial code in C ++, Fortran, Python and Julia. Our scope includes the following fundamental numerical kernels: AXPY, GEMV, GEMM, SpMV, Jacobi Stencil, and CG, and language/programming models: (1) C++ (e.g., OpenMP [including offload], OpenACC, Kokkos, SyCL, CUDA, and HIP), (2) Fortran (e.g., OpenMP [including offload] and OpenACC), (3) Python (e.g., numpy, Numba, cuPy, and pyCUDA), and (4) Julia (e.g., Threads, CUDA.jl, AMDGPU.jl, and KernelAbstractions.jl). Kernel implementations are generated using GitHub Copilot capabilities powered by the GPT-based OpenAI Codex available in Visual Studio Code given simple + + prompt variants. To quantify and compare the generated results, we propose a proficiency metric around the initial 10 suggestions given for each prompt. For auto-parallelization, we use ChatGPT interactively giving simple prompts as in a dialogue with another human including simple “prompt engineering” follow ups. Results suggest that correct outputs for C++ correlate with the adoption and maturity of programming models. For example, OpenMP and CUDA score really high, whereas HIP is still lacking. We found that prompts from either a targeted language such as Fortran or the more general-purpose Python can benefit from adding language keywords, while Julia prompts perform acceptably well for its Threads and CUDA.jl programming models. Finally, we expect to provide an initial quantifiable point of reference for code generation in each programming model using a state-of-the-art LLM. Overall, understanding the convergence of LLMs, AI, and HPC is crucial due to its rapidly evolving nature and how it is redefining human-computer interactions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Spatiotemporal pattern detection, generation, and computation with circuits

Abstract Implementations of neurons, delays, and synapse circuits are presented with simulations. These neural elements are used to create two small spiking neural networks, the Rate-Window and Order-Biased clusters, which are capable of detecting simple two-spike spatiotemporal patterns. A simple pattern detecting network (SPDN) is created by combining the Rate-Window and Order-Biased clusters, where clusters are small spiking neural networks, and its simple pattern detection ability is demonstrated in simulation. The SPDN is used to implement a complex pattern detecting network (CPDN) and its complex pattern detection ability is demonstrated in simulation. Methods for generating arbitrary spatiotemporal patterns are presented. The CPDN and spatiotemporal pattern generation methods are then used to implement a novel spatiotemporal computing paradigm based on detecting and responding to spatiotemporal symbols. A simulation of a spatiotemporal half adder is presented to demonstrate the computing paradigm.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

WorkflowHub: a registry for computational workflows

The rising popularity of computational workflows is driven by the need for repetitive and scalable data processing, sharing of processing know-how, and transparent methods. As both combined records of analysis and descriptions of processing steps, workflows should be reproducible, reusable, adaptable, and available. Workflow sharing presents opportunities to reduce unnecessary reinvention, promote reuse, increase access to best practice analyses for non-experts, and increase productivity. In reality, workflows are scattered and difficult to find, in part due to the diversity of available workflow engines and ecosystems, and because workflow sharing is not yet part of research practice. WorkflowHub provides a unified registry for all computational workflows that links to community repositories, and supports both the workflow lifecycle and making workflows findable, accessible, interoperable, and reusable (FAIR). By interoperating with diverse platforms, services, and external registries, WorkflowHub adds value by supporting workflow sharing, explicitly assigning credit, enhancing FAIRness, and promoting workflows as scholarly artefacts. The registry has a global reach, with hundreds of research organisations involved, and more than 800 workflows registered.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

ChemGraph as an agentic framework for computational chemistry workflows

Atomistic simulations are essential in chemistry and materials science but remain challenging to run due to the expert knowledge required for the setup, execution, and validation stages of these calculations. We present ChemGraph, an agentic framework powered by artificial intelligence and state-of-the-art simulation tools to streamline and automate computational chemistry and materials science workflows. ChemGraph leverages graph neural network-based foundation models for accurate yet computationally efficient calculations and large language models (LLMs) for natural language understanding, task planning, and scientific reasoning to provide an intuitive and interactive interface. We evaluate ChemGraph across 13 benchmark tasks and demonstrate that smaller LLMs (GPT-4o-mini, Claude-3.5-haiku, Qwen-2.5-14B) perform well on simple workflows, while more complex tasks benefit from using larger models. Importantly, we show that decomposing complex tasks into smaller subtasks through a multi-agent framework enables GPT-4o to reach perfect accuracy and smaller LLMs to match or exceed single-agent GPT-4o's performance in these benchmarks.

Computational chemistry↗
DOE OSTI2024

From Design to Device: Challenges and Opportunities in Computational Discovery of p -Type Transparent Conductors

A high-performance p -type transparent conductor (TC) does not yet exist but could lead to advances in a wide range of optoelectronic applications and enable new architectures for, e.g., next-generation photovoltaic (PV) devices. High-throughput computational material screenings have been a promising approach to filter databases and identify new p -type TC candidates and some of these predictions have been experimentally validated. However, most of these predicted candidates do not have experimentally achieved properties on par with n -type TCs used in solar cells and therefore have not yet been used in commercial devices. Thus, there is still a significant divide between transforming predictions into results that are actually achievable in the laboratory and an even greater lag in scaling predicted materials into functional devices. In this perspective, we outline some of the major disconnects in this materials discovery process—from scaling computational predictions into synthesizable crystals and thin films in the laboratory to scaling laboratory-grown films into real-world solar devices—and share insights to inform future strategies for TC discovery and design. Published by the American Physical Society 2024

14 SOLAR ENERGY↗
DOE OSTI2025

Educational Consortium for Energy-related Data Science & Computation in Building Engineering Programs

The project spearheaded by Pennsylvania State University aims to address the growing need for integrating energy-focused computation and data science into building engineering education. As the demand for energy-efficient building designs and operations increases, the educational sector must adapt to equip future engineers with the necessary skills. This initiative responds to this need by developing a consortium that unites multiple institutions to enhance curriculum development, dataset curation, and resource sharing, thereby ensuring students are well-prepared for the evolving energy sector. The primary goal of the project is to establish a consortium that will develop and disseminate educational materials and training programs focused on energy-related data science and computation. Key accomplishments include the creation of a beta website for resource sharing, the development of training programs and standalone modules, and the curation of datasets accessible to the public. This effort will culminate in a curriculum that incorporates advanced modeling technologies and data science skills into building engineering programs.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗