Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer implementation”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

CoverM: read alignment statistics for metagenomics

SUMMARY: Genome-centric analysis of metagenomic samples is a powerful method for understanding the function of microbial communities. Calculating read coverage is a central part of analysis, enabling differential coverage binning for recovery of genomes and estimation of microbial community composition. Coverage is determined by processing read alignments to reference sequences of either contigs or genomes. Per-reference coverage is typically calculated in an ad-hoc manner, with each software package providing its own implementation and specific definition of coverage. Here we present a unified software package CoverM which calculates several coverage statistics for contigs and genomes in an ergonomic and flexible manner. It uses "Mosdepth arrays" for computational efficiency and avoids unnecessary I/O overhead by calculating coverage statistics from streamed read alignment results. AVAILABILITY AND IMPLEMENTATION: CoverM is free software available at https://github.com/wwood/coverm. CoverM is implemented in Rust, with Python (https://github.com/apcamargo/pycoverm) and Julia (https://github.com/JuliaBinaryWrappers/CoverM_jll.jl) interfaces.

Aroney, Samuel T N↗
DOE OSTI2025

Massively parallel phase-field simulations targeting exascale

The interface thickness in the phase-field (PF) method limits its simulation scales. Consequently, large-scale PF simulations become prohibitively expensive for resolving the extremely fine microstructures that typically form during rapid solidification processing. This challenge is significant in predicting microstructure evolution in metal additive manufacturing and has been identified by the United States Department of Energy’s Exascale Computing Project. Here, to address this, we develop a multi-GPU and MPI-based massively parallel simulation code, utilizing state-of-the-art algorithms, software, and libraries, for large-scale three-dimensional (3D) PF simulations. We report the first GPU-parallel PF simulations on Frontier (currently the second TOP500 exascale cluster) and Summit machines, taking dendritic growth as an example problem. We evaluate the parallel performance of our implementation using scaling studies with more than 24 000 GPUs (among the largest known computations to date) and the acceleration performance using large-scale simulations of dendritic growth in 3D. Finally, massively parallel GPUs in these supercomputers enabled the first coupled multiscale simulations of laser melting and subsequent dendritic solidification on the scale of a full melt-pool, demonstrating the feasibility of performing PF simulations with a point total over 2 billion grid points within an acceptable time.

Exascale↗
DOE OSTI2025

A cross-platform execution engine for the quantum intermediate representation

Hybrid languages like the quantum intermediate representation (QIR) are essential for programming systems that mix quantum and conventional computing models, while execution of these programs is often deferred to a system-specific implementation. Here, we develop the QIR Execution Engine (QIR-EE) for parsing, interpreting, and executing QIR across multiple hardware platforms. QIR-EE uses LLVM to execute hybrid instructions specifying quantum programs and, by design, presents extension points that support customized runtime and hardware environments. We demonstrate an implementation that uses the XACC quantum hardware-accelerator library to dispatch prototypical quantum programs on different commercial quantum platforms and numerical simulators, and we validate execution of QIR-EE on IonQ, Quantinuum, and IBM hardware. Our results highlight the efficiency of hybrid executable architectures for handling mixed instructions, managing mixed data, and integrating with quantum computing frameworks to realize cross-platform execution.

LLVM↗
DOE OSTI2026

Preliminary Investigation of Target keff Search for Fuel Feed in MSRs

Fluid fuel molten salt reactor (MSR) concepts may achieve continuous-at-power operation with continuous or batch fresh fuel feed to counter reactivity loss from fuel burnup and fission product buildup. Accurate modeling and simulation of MSRs requires consideration of online fuel feed during depletion as well as a capability to determine the required feed amount to maintain a target multiplication factor (keff). As a first step supporting a full implementation of a new search capability into the SCALE code system’s TRITON reactor physics and depletion sequence, a preliminary investigation was performed to identify the best approach for a critical feed search capability considering computation time and accuracy. Using a simple iterative approach in which initial feed amounts were guessed based on previous depletion steps, the main drivers of computation time were found as the Monte Carlo neutron transport settings and the applied tolerance for the target keff. In the applied model, with tight convergence criteria (keff convergence to 8 pcm and a tolerance of ±15 pcm), the critical search calculation required twice the number of neutron transport calculations compared to a depletion calculation without critical search. In contrast, with a relaxed tolerance of ±50 pcm, the overall computation time for the critical search for merely increased by 30-40%. Further studies will be performed before implementing the critical search capability into TRITON.

Faulkner, Jonathon [ORNL]↗
DOE OSTI2026

A Review of Software for Designing and Operating Quantum Networks

Quantum networks development is crucial to realizing a production-grade network that can support distributed sensing, secure communication, and utility-scale quantum computation. However, the transition from laboratory demonstration to deployable networks requires software implementations of architectures and protocols tailored to the unique constraints of quantum systems. This paper reviews the current state of software implementations for quantum networks, organized around a three-plane abstraction of infrastructure, logical, and control/service planes. We cover software for both designing quantum network protocols (e.g., SeQUeNCe, QuISP, and NetSquid) and operating testbeds, with a focus on essential control/service plane functions such as entanglement, topology, and resource management, in a proposed taxonomy. Our review highlights a persistent gap between theoretical architecture and protocol proposals and their realization in simulators or testbeds, particularly in dynamic topology and network management. We conclude by outlining open challenges and proposing a roadmap for developing scalable software architectures to enable hybrid, large-scale quantum networks.

Network Design↗
DOE OSTI2024

3-center and 4-center 2-particle Gaussian AO integrals on modern accelerated processors

We report an implementation of the McMurchie–Davidson (MD) algorithm for 3-center and 4-center 2-particle integrals over Gaussian atomic orbitals (AOs) with low and high angular momenta l and varying degrees of contraction for graphical processing units (GPUs). This work builds upon our recent implementation of a matrix form of the MD algorithm that is efficient for GPU evaluation of 4-center 2-particle integrals over Gaussian AOs of high angular momenta (l ≥ 4) [A. Asadchev and E. F. Valeev, J. Phys. Chem. A 127, 10889–10895 (2023)]. The use of unconventional data layouts and three variants of the MD algorithm allow for the evaluation of integrals with double precision and sustained performance between 25% and 70% of the theoretical hardware peak. Performance assessment includes integrals over AOs with l ≤ 6 (a higher l is supported). Preliminary implementation of the Hartree–Fock exchange operator is presented and assessed for computations with up to a quadruple-zeta basis and more than 20 000 AOs. The corresponding C++ code is part of the experimental open-source LibintX library available at https://github.com/ValeevGroup/libintx.

Chemistry↗
DOE OSTI2025

Geometric GNNs for charged particle tracking at GlueX

Nuclear physics experiments are aimed at uncovering the fundamental building blocks of matter. The experiments involve high-energy collisions that produce complex events with many particle trajectories. Tracking charged particles resulting from collisions in the presence of a strong magnetic field is critical to enable the reconstruction of particle trajectories and precise determination of interactions. It is traditionally achieved through combinatorial approaches that scale worse than linearly as the number of hits grows. Since particle hit data naturally form a point cloud and can be structured as graphs, graph neural networks (GNNs) emerge as an intuitive and effective choice for this task. In this study, we evaluate the GNN model for track finding on the data from the GlueX experiment at Jefferson Lab. We use simulation data to train the model and test on both simulation and real GlueX measurements. We demonstrate that GNN-based track finding outperforms the currently used traditional method at GlueX in terms of segment-based efficiency at a fixed purity while providing faster inferences. We show that the GNN model can achieve significant speedup by processing multiple events in batches, which exploits the parallel computation capability of graphical processing units (GPUs). Finally, we compare the GNN implementation on GPU and field-programmable gate array and describe the trade-off.

batched GNN pipeline↗
DOE OSTI2024

Evaluation of phase shifts for nonrelativistic elastic scattering using quantum computers

Simulations of scattering processes are essential in understanding the physics of our universe. Computing relevant scattering quantities from ab initio methods is extremely difficult on classical devices because of the substantial computational resources needed. Here, this work reports the development of an algorithm that makes it possible to obtain phase shifts for generic nonrelativistic elastic scattering processes on a quantum computer. This algorithm is based on extracting phase shifts from the direct implementation of the real-time evolution. The algorithm is improved by a variational procedure making it more accurate and resistant to the quantum noise. The reliability of the algorithm is first demonstrated by means of classical numerical simulations for different potentials and later tested on existing quantum hardware, specifically on IBM quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Single-ancilla ground state preparation via Lindbladians

We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this Lindbladian is algorithmic and should not be seen as a specific approximation to some weakly coupled system-bath dynamics in nature. Our algorithm can be implemented using just one ancilla qubit and efficiently simulated on a quantum computer. It can prepare the ground state even when the initial state has zero overlap with the ground state, bypassing the most significant limitation of methods like quantum phase estimation. As a variant, we also propose a discrete-time algorithm, demonstrating even better efficiency and providing a near-optimal simulation cost depending on the desired evolution time and precision. Numerical simulations using Ising and Hubbard models demonstrate the efficacy and applicability of our method. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗
DOE OSTI2025

Advanced System Thermal Fluids Solver Development for SAM

This work summarizes a feasibility study on testing numerical algorithms that are suitable and efficient for advanced system analysis code development under the mutli-physics framework, MOOSE. The key is the implementation of a high-order one-dimensional staggered-grid finite volume method (SG-FVM), and its direct interaction with the linear/nonlinear solver, PETSc. Leveraging the existing capabilities of the SAM code, significant code coverages were established in the finite volume method code. This in turn allows for a suite of test problems with different problem sizes and levels of complexity to be used to quantify the performance improvement of the finite volume method code. As evidently shown in this study, the implemented SG-FVM demonstrated superior performance improvement against a direct finite element method implementation through MOOSE for the wide range of selected problems. On two computer systems, the speedup was observed to be significant, with at least one order of magnitude of solving time reduction. In addition, for a complex reactor model, transient simulation was performed using the finite volume method code, the results of which agree very well with the reference results from the finite element method code. Overall, this study demonstrates a successful feasibility study on the proposed numerical algorithms and software structure to support advanced system analysis tool development. In this work, short-term priority development and testing items were identified, and long-term code adoption and integration plans were made for the eventual deployment of the finite volume method in the SAM code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Modal Field Reconstruction in Resonant Cavities in the Fundamental and Undermoded Frequency Regimes

Theory, simulations, and experiments are presented that demonstrate reconstruction of electromagnetic fields in a cavity from sparse probe measurements. Such techniques are often referred to as virtual sensing, allowing fields at unobserved locations to be predicted. These methods are appropriate for the fundamental and undermoded regimes, providing the ability to estimate fields (and shielding effectiveness) throughout an arbitrarily shaped cavity from a few judiciously spaced probes. A modal simulation method is implemented that allows the response of arbitrarily shaped cavities to be rapidly computed with respect to varying probe locations and slot parameters, enabling statistical analysis of probe placement on reconstruction performance. A cylindrical vessel with numerous probe holes is developed for experiments, referred to as Perforated Vessel 2 (PV2). Experiments are performed on the vessel with and without a steel box inside, where transmit power is delivered into the vessel either through probes (probe injection) or through slots using an external antenna (slot excitation). Simulations and experiments illustrate that when the number of probes is minimal (equal to the number of mode coefficients to be estimated at each frequency), probe placement is critical to avoid missed peaks and to have acceptable reconstruction error. Probe placement becomes less important as the number of probes is increased, but care is still required to avoid probe locations giving poor performance.

42 ENGINEERING↗
DOE OSTI2026

FAIR Data Meets FAIR Software

Modern scientific research is increasingly defined by the interplay between data, software, and the workflows that connect them. Yet while the FAIR (Findable, Accessible, Interoperable, Reusable) principles have become foundational for scientific data stewardship, the same level of structure and expectation has only recently begun to extend to research software. This talk covers why and how FAIR principles are being applied to data and software to support data reuse. It outlines the gaps in current sharing norms, the growing federal emphasis on persistent identifiers and public access, and the opportunities created when datasets, computational workflows, code, and models are linked through rich, standardized metadata. Practical implementation pathways for the EIC and JLab communities are described, including datacards for structured dataset documentation and provenance-aware workflows. By aligning data lifecycle management with FAIR-aligned software practices, the scientific community can advance toward autonomous knowledge graphs, generative workflows, and high-quality, AI-ready scientific datasets.

McSpadden, Diana [Thomas Jefferson National Accele↗
DOE OSTI2024

Nuclear Requalification of the ATR Core

The Advanced Test Reactor (ATR) creates a unique, high neutron flux materials testing environment that subsequently causes neutron embrittlement damage to its beryllium reflector. The reflector is eventually required to be replaced during a reactor Outage. Concurrently, a piece-for-piece core replacement is conducted to maintain reactor functionality called a core internals changeout (CIC). Once changeout is complete, ATR Reactor Engineering utilizes previous CIC data, notably 1977-1994 CIC data, to conduct predictive criticality analysis on the new, unirradiated core. However, CIC data has been inconsistently reported over the years making it difficult, and in some cases impossible, to utilize. These inconsistencies arise in various forms of not using correct units, inconsistent diagram usage, and not portraying the same kind of data similarly across the reports. To work around this inconsistency issue, Reactor Engineering is implementing the use of several new neutronic modeling codes that utilize modern computation speeds and methods to model the new core in different criticality environments. Further validation is then conducted by nuclear testing and bringing the reactor critical and conducting various irradiation tests. Upon completion and certification that the reactor passed all testing requirements, ATR can once again re-start normal operations.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2025

Status of the MARS code

This report describes major features of the most recent version of the MARS code as well as ongoing developments. The list of features includes various options for geometry models, a beam line builder based on MADX code, import of geometry models in GDML format, use of structured and unstructured meshes for scoring purposes, an update to the recent TENDL library for a number of projectiles at low energies (up to 250 MeV), and a recently implemented method to calculate spatial distribution of residual dose in a single computer run without an intermediate source. Examples of the code application to various projects are presented as well.

Rakhno, Igor [Fermilab] (ORCID:0000000265828058)↗
DOE OSTI2025

SA-GAT-SR: self-adaptable graph attention networks with symbolic regression for high-fidelity material property prediction

Recent advances in machine learning have demonstrated an enormous utility of deep learning approaches, particularly Graph Neural Networks (GNNs) for materials science. These methods have emerged as powerful tools for high-throughput prediction of material properties, offering a compelling enhancement and alternative to traditional first-principles calculations. While the community has predominantly focused on developing increasingly complex and universal models to enhance predictive accuracy, such approaches often lack physical interpretability and insights into materials behavior. Here, we introduce a novel computational paradigm—Self-Adaptable Graph Attention Networks integrated with Symbolic Regression (SA-GAT-SR)—that synergistically combines the predictive capability of GNNs with the interpretative power of symbolic regression. Our framework employs a self-adaptable encoding algorithm that automatically identifies and adjust attention weights so as to screen critical features from an expansive 180-dimensional feature space while maintaining O(n) computational scaling. The integrated SR module subsequently distills these features into compact analytical expressions that explicitly reveal quantum-mechanically meaningful relationships, achieving 23 × acceleration compared to conventional SR implementations that heavily rely on first-principle calculations-derived features as input. This work suggests a new framework in computational materials science, bridging the gap between predictive accuracy and physical interpretability, offering valuable physical insights into material behavior.

36 MATERIALS SCIENCE↗
DOE OSTI2026

New Time Integrators and Capabilities in SUNDIALS Versions 6.2.0-7.4.0

SUNDIALS is a well-established numerical library that provides robust and efficient time integrators and nonlinear solvers. This article overviews several significant improvements and new features added over the last 3 years to support scientific simulations run on high-performance computing systems. Notably, three new classes of one-step methods have been implemented: low storage Runge–Kutta, symplectic partitioned Runge–Kutta, and operator splitting. In addition, we describe new timestep adaptivity support for multirate methods, adjoint sensitivity analysis capabilities for explicit Runge–Kutta methods, additional options for Anderson acceleration in nonlinear solvers, and improved error handling and logging.

Computer science↗
DOE OSTI2025

Efficiently Verifiable Quantum Advantage on Near-Term Analog Quantum Simulators

Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on verification of an analog quantum simulation, in which the verifier need only run an O ( λ 2 ) -time classical computation, and the prover need only prepare O ( 1 ) samples of a history state and perform O ( λ 2 ) single-qubit measurements, for a security parameter λ . We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations. Published by the American Physical Society 2025

Liu, Zhenning (ORCID:000000020794419X)↗
DOE OSTI2025

Solving sparse finite element problems on neuromorphic hardware

The finite element method (FEM) is one of the most important and ubiquitous numerical methods for solving partial differential equations (PDEs) on computers for scientific and engineering discovery. Applying the FEM to larger and more detailed scientific models has driven advances in high-performance computing for decades. Here we demonstrate that scalable spiking neuromorphic hardware can directly implement the FEM by constructing a spiking neural network that solves the large, sparse, linear systems of equations at the core of the FEM. We show that for the Poisson equation, a fundamental PDE in science and engineering, our neural circuit achieves meaningful levels of numerical accuracy and close to ideal scaling on modern, inherently parallel and energy-efficient neuromorphic hardware, specifically Intel’s Loihi 2 neuromorphic platform. We illustrate extensions to irregular mesh geometries in both two and three dimensions as well as other PDEs such as linear elasticity. Our spiking neural network is constructed from a recurrent network model of the brain’s motor cortex and, in contrast to black-box deep artificial neural network-based methods for PDEs, directly translates the well-understood and trusted mathematics of the FEM to a natively spiking neuromorphic algorithm.

Applied mathematics↗