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

Programmable simulations of molecules and materials with reconfigurable quantum processors

Simulations of quantum chemistry and quantum materials are believed to be among the most important applications of quantum information processors. However, realizing practical quantum advantage for such problems is challenging because of the prohibitive computational cost of programming typical problems into quantum hardware. Here we introduce a simulation framework for strongly correlated quantum systems represented by model spin Hamiltonians that uses reconfigurable qubit architectures to simulate real-time dynamics in a programmable way. Our approach also introduces an algorithm for extracting chemically relevant spectral properties via classical co-processing of quantum measurement results. We develop a digital–analogue simulation toolbox for efficient Hamiltonian time evolution using digital Floquet engineering and hardware-optimized multi-qubit operations to accurately realize complex spin–spin interactions. As an example, we propose an implementation based on Rydberg atom arrays. In addition, we show how detailed spectral information can be extracted from the dynamics through snapshot measurements and single-ancilla control, enabling the evaluation of excitation energies and finite-temperature susceptibilities from a single dataset. To illustrate the approach, we show how to use the method to compute key properties of a polynuclear transition-metal catalyst and two-dimensional magnetic materials.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Accelerating high-order continuum kinetic plasma simulations using multiple GPUs

Kinetic plasma simulations solve the Vlasov-Poisson or Vlasov-Maxwell equations to evolve scalar-variable distribution functions in position-velocity phase space and vector-variable electromagnetic fields in configuration space. The immense computational cost of evolving high-dimensional variables, and their large number of degrees of freedom, often limits the utility of continuum kinetic simulations and presents a challenge when it comes to accurately simulating real-world physical phenomena. To address this challenge, we present techniques that accelerate and minimize the computational work required for a scalable Vlasov-Poisson solver. We show theoretical hardware compute and communication bounds for solving a fourth-order finite-volume Vlasov-Poisson system. These bounds are then used to inform and evaluate the design of performance portable algorithms for a multiple graphics processing unit (GPU) accelerated version of the Vlasov-Poisson solver VCK-CPU [1]. We demonstrate that the multi-GPU Vlasov solver implementation, VCK-GPU, simultaneously minimizes required inter-process data transfer while also being bounded by the machine network performance limits. This results in an overall strong scaling speedup per timestep of up to 40x in three-dimensional phase space (one position, two velocity coordinates) and 54x in four dimensional phase space (two position, two velocity coordinates) and a 341x increase in simulation throughput of the GPU accelerated code over the existing CPU code. The GPU code is also able to weak scale up to 256 compute nodes and 1024 GPUs. In conclusion, we demonstrate that the improved compute performance enables exploring configurations which were previously computationally infeasible, including resolving fine-scale distribution function filamentation and multi-species dynamics with realistic electron-proton mass ratios.

Continuum kinetics↗
DOE OSTI2025

Techniques for improved statistical convergence in quantification of eddy diffusivity moments

While recent approaches, such as the macroscopic forcing method (MFM) or Green's function-based approaches, can be used to compute Reynolds-averaged Navier-Stokes closure operators using forced direct numerical simulations, MFM can also be used to directly compute moments of the effective nonlocal and anisotropic eddy diffusivities. The low-order spatial and temporal moments contain limited information about the eddy diffusivity but are often sufficient for quantification and modeling of nonlocal and anisotropic effects. However, when using MFM to compute eddy diffusivity moments, the statistical convergence can be slow for higher-order moments. In this work, we demonstrate that using the same direct numerical simulation (DNS) for all forced MFM simulations improves statistical convergence of the eddy diffusivity moments. We present its implementation in conjunction with a decomposition method that handles the MFM forcing semianalytically and allows for consistent boundary condition treatment, which we develop for both scalar and momentum transport. We demonstrate that for a two-dimensional Rayleigh-Taylor instability case study, using the same DNS for all forced MFM simulations results in convergence with 𝒪⁡(100) simulations rather than 𝒪⁡(1000) simulations. In conclusion, we then demonstrate the impacts of improved convergence on the quantification of the eddy diffusivity.

general physics↗
DOE OSTI2024

Massive twistor worldline in electromagnetic fields

We study the (ambi-)twistor model for spinning particles interacting via electromagnetic field, as a toy model for studying classical dynamics of gravitating bodies including effects of both spins to all orders. We compute the momentum kick and spin kick up to one-loop order and show precisely how they are encoded in the classical eikonal. The all-orders-in-spin effects are encoded as a dynamical implementation of the Newman-Janis shift, and we find that the expansion in both spins can be resummed to simple expressions in special kinematic configurations, at least up to one-loop order. We confirm that the classical eikonal can be understood as the generator of canonical transformations that map the in-states of a scattering process to the out-states. We also remark that cut contributions for converting worldline propagators from time-symmetric to retarded amount to the iterated action of the leading eikonal at one-loop order.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

ClassNMSW- a real-time classification approach for non-recycled municipal solid waste using hyperspectral imaging

Real-time classification of non-recycled municipal solid waste (NMSW) is essential for efficient valorization. This study introduces ClassNMSW, a comprehensive framework for classifying 22 NMSW subclasses under industrial constraints by using hyperspectral imaging (HSI). A primary innovation of this work is the development of a variance-controlled spectral extraction algorithm. Unlike traditional methods that rely on simple averaging, this approach systematically investigates the extent of pixel extraction to minimize the loss of critical chemical information while maximizing data reduction thus ensuring high spectral fidelity with low computational cost. The approach developed in this work integrates automated, computer-vision-based background removal, eliminating the need for the manual thresholding common in current literature. To resolve ambiguities among chemically similar subclasses, a tiered classification and multi-camera fusion strategy (NIR17 and NIR22) is implemented. Results demonstrate that ClassNMSW achieves an object-wise weighted accuracy of 98.70% for single-sensor configurations and 100% under sensor fusion. A novel rolling-window strategy satisfies desired end-to-end latency of <2 s, satisfying the strict deterministic requirements of high-speed industrial sorting environments. The ClassNMSW framework provides a scalable foundation for advancing circularity and resource recovery in large-scale waste valorization operations.

99 - GENERAL AND MISCELLANEOUS↗
DOE OSTI2024

ComDMFT v.2.0: Fully self-consistent ab initio GW+EDMFT for the electronic structure of correlated quantum materials

ComDMFT is a parallel computational package designed to study the electronic structure of correlated quantum materials from first principles. Our approach is based on the combination of first-principles methods and dynamical mean field theories. In version 2.0, we implemented fully-diagrammatic GW+EDMFT from first-principles self-consistently. In this approach, correlated electrons are treated within full GW+EDMFT and the rest are treated within full-GW, seamlessly. Further, this implementation enables the electronic structure calculation of quantum materials with weak, intermediate, and strong electron correlation without prior knowledge of the degree of electron correlation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Laminography as a tool for imaging large-size samples with high resolution

Despite the increased brilliance of the new generation synchrotron sources, there is still a challenge with high-resolution scanning of very thick and absorbing samples, such as a whole mouse brain stained with heavy elements, and, extending further, brains of primates. Samples are typically cut into smaller parts, to ensure a sufficient X-ray transmission, and scanned separately. Compared with the standard tomography setup where the sample would be cut into many pillars, the laminographic geometry operates with slab-shaped sections significantly reducing the number of sample parts to be prepared, the cutting damage and data stitching problems. In this work, a laminography pipeline for imaging large samples (>1 cm) at micrometre resolution is presented. The implementation includes a low-cost instrument setup installed at the 2-BM micro-CT beamline of the Advanced Photon Source. Additionally, sample mounting, scanning techniques, data stitching procedures, a fast reconstruction algorithm with low computational complexity, and accelerated reconstruction on multi-GPU systems for processing large-scale datasets are presented. The applicability of the whole laminography pipeline was demonstrated by imaging four sequential slabs throughout an entire mouse brain sample stained with osmium, in total generating approximately 12 TB of raw data for reconstruction.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

A Versatile Simulated Data Transport Layer for in Situ Workflows Performance Evaluation

In situ processing does not only allow scientific applications to face the explosion in data volume and velocity but also to address the time constraints of many simulation-analysis workflows by providing scientists with early insights about their applications at runtime. Multiple frameworks implement the concept of a data transport layer (DTL) to enable such in situ workflows. These tools are very versatile, directly or indirectly access the data generated on the same node, another node of the same compute cluster, or a completely distinct node, and allow data publishers and subscribers to run on the same computing resources or not. This versatility puts on researchers the onus of taking key decisions related to resource allocation and how to transport data to ensure the most efficient execution of their in situ workflows. However, domain scientists and workflow practitioners lack the appropriate tools to assess the respective performance of particular design and deployment options. In this paper we introduce a versatile simulated DTL designed to provide researchers with insights on the respective performance of different execution scenarios of in situ workflows. This open-source, standalone library builds on the SimGrid toolkit and can be linked to any SimGrid-based simulator. It facilitates the evaluation of the performance behavior, at scale, of different data transport configurations and the study of the effects of resource allocation strategies. We demonstrate the scalability, versatility, and accuracy of this simulated DTL by reproducing the execution of two synthetic benchmarks and of a real-world in situ workflow composed of an MPI application and a parallel data analysis. Results of simulations run on a single core show that the proposed library can simulate the interactions of tens of thousands of simulated processes deployed on two interconnected commodity clusters in a few seconds, and the execution by a thousand simulated processes of an in situ workflow in less than three minutes.

Suter, Fred [ORNL] (ORCID:0000000319021955)↗
DOE OSTI2024

High-performance data management for whole slide image analysis in digital pathology

When dealing with giga-pixel digital pathology in whole-slide imaging, a notable proportion of data records holds relevance during each analysis operation. For instance, when deploying an image analysis algorithm on whole-slide images (WSI), the computational bottleneck often lies in the input-output (I/O) system. This is particularly notable as patch-level processing introduces a considerable I/O load onto the computer system. However, this data management process could be further paralleled, given the typical independence of patch-level image processes across different patches. This paper details our endeavors in tackling this data access challenge by implementing the Adaptable IO System version 2 (ADIOS2). Our focus has been constructing and releasing a digital pathology-centric pipeline using ADIOS2, which facilitates streamlined data management across WSIs. Additionally, we’ve developed strategies aimed at curtailing data retrieval times. The performance evaluation encompasses two key scenarios: (1) a pure CPU-based image analysis scenario (“CPU scenario”), and (2) a GPU-based deep learning framework scenario (“GPU scenario”). Our findings reveal noteworthy outcomes. Under the CPU scenario, ADIOS2 showcases an impressive two-fold speed-up compared to the brute-force approach. In the GPU scenario, its performance stands on par with the cutting-edge GPU I/O acceleration framework, NVIDIA Magnum IO GPU Direct Storage (GDS). From what we know, this appears to be among the initial instances, if any, of utilizing ADIOS2 within the field of digital pathology. The source code has been made publicly available at https://github.com/hrlblab/adios.

Wang, Xiao↗
DOE OSTI2025

A Simple, Scalable Large Deformation Solid Mechanics Implementation in the MOOSE Framework

This article describes a large deformation solid mechanics solver implemented as part of the freely available and open source MOOSE finite element simulation framework. The article documents the choices made in developing the solid mechanics framework and describes novel formulations for the gradient operator and constitutive modeling framework made to simplify implementations of different coordinate systems, stabilized gradient operators, and different constitutive model inputs and outputs. In the process, the article describes a new formulation that casts objective integration of the Cauchy stress as a linear transformation of the small stress rate. Finally, the article presents key implementation details and examines the parallel efficiency of the solid mechanics solver implemented in MOOSE. The implementation retains a good weak scaling efficiency beyond 1,000 parallel processes. The article includes a discussion of the factors limiting the parallel efficiency of implicit, large deformation solid mechanics codes on current high-performance computers, with the main current limitation being the scalability of the algebraic multigrid methods used to solve the linearized equilibrium equations.

Applied computing → Computer-aided design↗
DOE OSTI2026

ObstacleSense: Low-Power Neuromorphic Vision for Corridor Obstacle Awareness in Low-Level ADAS

The automotive industry’s pursuit of Level 5 autonomy is constrained by substantial perception-compute power requirements, often reaching 1, 000 + watts in full autonomy stacks. Reducing this energy burden requires rethinking perception not only at the high-end autonomy level, but also at the foundational Advanced Driver Assistance Systems (ADAS) level where low-power, safety-critical sensing can have broad impact. Neuromorphic vision provides a promising starting point: HD Dynamic Vision Sensors (DVS) can operate below 100 mW at the sensor level by reporting only asynchronous brightness changes. However, low-power sensing alone is insufficient if downstream perception reintroduces dense, energy-intensive computation. In particular, many event-driven object-detection pipelines still rely on CNN backbones, while purely spiking alternatives often trade away accuracy or ignore deployment constraints. We introduce ObstacleSense, a highly compact, CNN-free hybrid ANN–SNN framework for Level 0–1 forward-corridor obstacle awareness. Instead of performing full-scene object detection with a convolutional feature backbone, ObstacleSense targets the safety-critical question of whether the ego corridor is occupied and how far the nearest obstacle is. The architecture combines polarity-conditioned event encoding, lightweight temporal spiking dynamics, axial spatial mixing, and coarse-to-fine range estimation within a regular fixed-grid compute pattern. This design avoids the dense CNN backbone commonly used in event-based detection while maintaining a small state footprint suitable for eventual small-FPGA deployment. Before hardware mapping, we evaluate the software implementation using a model-side power proxy derived from MACs, weight and activation traffic, and spiking state updates under shared FP16 assumptions. On simulated CARLA event corpora, the deployment-oriented model achieves 0.9464 objectness F1, 0.9978 grid-level mAP, and 0.8987 m distance Mean Absolute Error at an estimated 1.92 mW proxy cost, while maintaining performance on unseen generalization test sequences.

Johnson-Scott, Zac [ORNL]↗
DOE OSTI2025

Simulation Center for Runaway Electron Avoidance and Mitigation (SCREAM SciDAC) (Technical Final Report)

Runaway electrons can severely damage the plasma facing components on ITER during a major disruption and pose a major risk for tokamak fusion. It has been recognized that an adequate disruption mitigation system (DMS) is essential for the safe operation of ITER. The United States is responsible for the design and implementation of the disruption mitigation system on ITER, and in July 2016 the Simulation Center for Runaway Electron Avoidance and Mitigation (SCREAM) was launched by DOE, in a joint Fusion Energy Sciences (FES) and Advanced Scientific Computing Research (ASCR) collaboration. SCREAM was a comprehensive theory and simulation SciDAC center that provided physics guidance in the avoidance and mitigation of runaway electrons, and in tandem with domestic and international experiments, helped establish the qualitative and quantitative bases for safe operational scenarios and viable mitigation techniques. The SCREAM center assembled a national team of experts in runaway electron physics, tokamak disruptions, magnetohydrodynamic (MHD) simulation, and advanced algorithms and computing. The team combined advanced simulation and analysis capability facilitated by direct participation of ASCR SciDAC institutes with theoretical models and code development by FES scientists to focus on the runaway risk for ITER and tokamaks in general. The research scope was focussed on integrated simulations of kinetic runaway electrons, including MHD and fluid models of impurity transport, within a research plan guided by theory. The specific research tasks were (1) establish the fundamental physics of runaway generation, saturation, and dynamical evolution in a tokamak; (2) examine the critical path toward runaway avoidance; and (3) investigate the viability and effectiveness of the leading candidate schemes for runaway mitigation. In all three areas, members of the team carried out scoping studies that established the readiness for rapid and critical advances, especially in the deployment and further development of large-to extreme-scale simulation tools. Our multi-pronged computational approach included (1) relativistic Fokker-Planck solvers with discretization in phase space, (2) self-consistent particle-in-cell techniques, (3) particle-based Monte-Carlo, and (4) MHD-particle hybrid simulations. Cross-check between these different methods provided an additional means for verification and further bolstered the fidelity of our physics prediction. Validation against experimental results brings confidence to the predictive capability for ITER and frequently leads to new ideas for understanding and mitigating the thermal quench driven runaway electron phenomenon.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Convex Optimization with Smart Grid Examples

In this talk, we give an overview of the field of convex optimization and work through four canonical problems that relate to electrical power systems and smart grids. The purpose of these examples is to demonstrate the breadth of applications of convex optimization in energy research and to show that toy versions of these problems can be solved in just a few lines of code, indicating the scale and complexity of problems that can be tackled with a more detailed treatment. We emphasize the cvxpy modeling language as a foundational technology that enables rapid development and prototyping of convex optimization problems, allowing researchers to focus on model development rather than get caught in the weeds of numerical and code implementation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Demonstration of the rodeo algorithm on a quantum computer

The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as other fields of quantum many-body physics. The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate. While it is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation, it has yet to be implemented on an actual quantum device. In this work, we apply the rodeo algorithm to determine the energy levels of a random one-qubit Hamiltonian, resulting in a relative error of 0.08% using mid-circuit measurements on the IBM Q device Casablanca. This surpasses the accuracy of directly-prepared eigenvector expectation values using the same quantum device. We take advantage of the high-accuracy energy determination and use the Hellmann-Feynman theorem to compute eigenvector expectation values for a different random one-qubit observable. For the Hellmann-Feynman calculations, we find a relative error of 0.7%. Here, we conclude by discussing possible future applications of the rodeo algorithm for multi-qubit Hamiltonians.

algorithm↗
DOE OSTI2026

Automated and Accelerated Continuum Model Development for Electrochemical Systems (Abbreviated Report)

Despite the availability of computational resources and advancements in numerical computing capabilities, the multiscale models core to understanding, predicting the behaviors of, and designing energy and environmental systems involving porous media are still 1.) developed through by-hand derivations and 2.) limited by many methodological assumptions employed during model derivation. As a result, the advancement of effective media models for engineering DOE mission-critical systems (e.g., batteries, flow batteries, electrolyzers, geothermal systems, subsurface chemical storage systems, etc.) is slow (i.e., it takes years for models to traverse from stages of “development” to “practical utilization”), hindering our ability to effectively optimize such systems and stay at the cutting-edge of the energy frontier. In this work, we aimed to address these limitations by 1.) automating and accelerating multiscale model derivation via symbolic computing and 2.) develop a novel multiscale modeling methodology for flow and transport through porous media that avoids the typical assumptions hindering previous models. As a result of our efforts, we 1.) developed a hybrid symbolic-numeric code called Fouriera for fully-automating the implementation of multiphysical and phase-field models via the Fourier spectral method for materials science research, and 2.) advanced a multiscale modeling methodology called The Method of Finite Averages that rigorously predicts the behaviors of flow and transport through heterogeneous porous media under the influence of non-local effects and strong advection. Ultimately, these deliverables provide strong foundations from which further efforts can advance multiscale modeling tools and capabilities that do not intrinsically rely on 1.) the speed and mathematical capabilities of humans, nor 2.) the methodological assumptions limiting current models.

36 MATERIALS SCIENCE↗
DOE OSTI2025

PvaPy streaming framework for real-time data processing

User facility upgrades, new measurement techniques, advances in data analysis algorithms as well as advances in detector capabilities result in an increasing amount of data collected at X-ray beamlines. Some of these data must be analyzed and reconstructed on demand to help execute experiments dynamically and modify them in real time. In turn, this requires a computing framework for real-time processing capable of moving data quickly from the detector to local or remote computing resources, processing data, and returning results to users. In this paper, we discuss the streaming framework built on top of PvaPy, a Python API for the EPICS pvAccess protocol. We describe the framework architecture and capabilities, and discuss scientific use cases and applications that benefit from streaming workflows implemented on top of this framework. We also illustrate the framework's performance in terms of achievable data-processing rates for various detector image sizes.

EPICS pvAccess↗
DOE OSTI2025

Integration of multiple coinflip devices for high-quality random sampling

Artificial intelligence, scientific computing, and probabilistic computing use random sampling to approximate solutions to various problems, with larger models requiring a substantial quantity of random numbers. To generate the required vast quantity of random numbers at high rates, we explore so-called “coinflip” devices, which are stochastic microelectronic devices ideally capable of independently generating random bits with a tunable weight at a high rate. However, coinflip devices are inherently analog and demonstrate nonidealities, like temperature dependence and drift, that can introduce determinism into the outputs. We present important considerations for building systems of multiple coinflip devices to produce high-quality bitstreams with low error and little dependency on previous bits. Using tunnel diodes as coinflip devices, we implement a control loop to adapt to temperature dependence and generate fair bitstreams with each device. While this can lead to dependencies between bits in a single bitstream, we demonstrate that combining results generated in parallel with individual tunnel diodes can produce fair and unpredictable bitstreams. The suitability of these bitstreams for use in probabilistic computing is then demonstrated through a Monte Carlo approximation of π.

Taylor, Brady Garland [Sandia National Laboratorie↗