Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Impact of Variable Perpendicular Transport Coefficients in WEST Simulations Using SolEdge-HDG

Plasma–wall interaction is one of the key research topics on the way to controlled fusion. To study the best operational designs with reduced heat and particle fluxes onto tokamak plasma facing components (PFCs) comprehensive plasma simulations are required. A recent implementation of a hybridized discontinuous Galerkin scheme into a new version of SolEdge code has the advantage of using magnetic equilibrium-free mesh. This allows us to conduct pioneering 2-D transport simulations of a full discharge in the WEST tokamak. In this work, we implemented plasma transport coefficients as functions of coordinate in the poloidal plane and neutral diffusion as a function of neutral mean free path. Moreover, the perpendicular convection flux terms were added to the code. Using the new features, a few test cases were investigated. Finally, the influence of nonconstant transport coefficients on the simulated particle and heat fluxes onto the WEST tokamak PFCs are demonstrated.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Speed Variation Based Power Regulation Concept for Dynamic Wireless Charging

On-road wireless charging of electric vehicles (EVs) in-motion could potentially reduce range anxiety or battery size with wide-spread deployment. The planning and implementation of such systems are greatly complicated due to their susceptibility to load variation inherent to traffic flow. Here, this paper proposes a method for derisking the potential for traffic slowdowns by compensating for reduced vehicle speed and investigates how implementation may affect system performance. A load modeling case study is presented at 200kW for a mile of high-speed roadway employing speed-based power regulation with results indicating average power usage and maximum car hosting capability can be reduced by 20% and increased by 30% respectively. An 85kHz power electronics model is developed based on designs and prototypes for an 11kW, 190m airgap static system and a 200kW dynamic wireless track. The simulation is validated in the 11kW experimental prototype and modified for 200kW operation to compare with simulated performance. Sensitivity studies are performed in MATLAB/Simulink to evaluate how parameters influence system performance and confirm the capability to reduce output power and maintain efficiency at 11 and 200kW. The static 11kW experimental system operates at 93.6% efficiency and multiple options exist to reduce power while maintaining efficiency greater than 90%. The capability to dynamically modify power output from WPT coils, in an experimentally validated simulation, enables techniques to significantly mitigate load variability due to reductions in vehicle speed.

42 ENGINEERING↗
DOE OSTI2025

Uncertainty Visualization of Critical Points of 2D Scalar Fields for Parametric and Nonparametric Probabilistic Models

This paper presents a novel end-to-end framework for closed-form computation and visualization of critical point uncertainty in 2D uncertain scalar fields. Critical points are fundamental topological descriptors used in the visualization and analysis of scalar fields. The uncertainty inherent in data (e.g., observational and experimental data, approximations in simulations, and compression), however, creates uncertainty regarding critical point positions. Uncertainty in critical point positions, therefore, cannot be ignored, given their impact on downstream data analysis tasks. Here, in this work, we study uncertainty in critical points as a function of uncertainty in data modeled with probability distributions. Although Monte Carlo (MC) sampling techniques have been used in prior studies to quantify critical point uncertainty, they are often expensive and are infrequently used in production-quality visualization software. We, therefore, propose a new end-to-end framework to address these challenges that comprises a threefold contribution. First, we derive the critical point uncertainty in closed form, which is more accurate and efficient than the conventional MC sampling methods. Specifically, we provide the closed-form and semianalytical (a mix of closed-form and MC methods) solutions for parametric (e.g., uniform, Epanechnikov) and nonparametric models (e.g., histograms) with finite support. Second, we accelerate critical point probability computations using a parallel implementation with the VTK-m library, which is platform portable. Finally, we demonstrate the integration of our implementation with the ParaView software system to demonstrate near-real-time results for real datasets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Beyond the visible: Accounting for ultraviolet and far‐red radiation in vegetation productivity and surface energy budgets

Photosynthetically active radiation (PAR) is typically defined as light with a wavelength within 400–700 nm. However, ultra-violet (UV) radiation within 280–400 nm and far-red (FR) radiation within 700–750 nm can also excite photosystems, though not as efficiently as PAR. Vegetation and land surface models (LSMs) typically do not explicitly account for UV's contribution to energy budgets or photosynthesis, nor FR's contribution to photosynthesis. However, whether neglecting UV and FR has significant impacts remains unknown. Here, we explored how canopy radiative transfer (RT) and photosynthesis are impacted when explicitly implementing UV in the canopy RT model and accounting for UV and FR in the photosynthesis models within a next-generation LSM that can simulate hyperspectral canopy RT. We validated our improvements using photosynthesis measurements from plants under different light sources and intensities and surface reflection from an eddy-covariance tower. Our model simulations suggested that at the whole plant level, after accounting for UV and FR explicitly, chlorophyll content, leaf area index (LAI), clumping index, and solar radiation all impact the modeling of gross primary productivity (GPP). At the global scale, mean annual GPP within a grid would increase by up to 7.3% and the increase is proportional to LAI; globally integrated GPP increases by 4.6 PgC year −1 (3.8% of the GPP without accounting for UV + FR). Further, using PAR to proxy UV could overestimate surface albedo by more than 0.1, particularly in the boreal forests. Our results highlight the importance of improving UV and FR in canopy RT and photosynthesis modeling and the necessity to implement hyperspectral or multispectral canopy RT schemes in future vegetation and LSMs.

energy budget↗
DOE OSTI2026

Characterization of Flashback and Flame-Holding in a Jet-in-Crossflow Mixing Configuration With Methane–Hydrogen Fuel Blends

An approach that combines experimental and numerical analyses has been implemented to characterize the fundamentals of flashback events and flame-holding phenomena during high-hydrogen combustion in a jet-in-crossflow (JICF) configuration. Such flame dynamics are visualized experimentally using nanosecond (ns)-based hydroxyl planar laser-induced fluorescence (OH-PLIF) and chemiluminescence diagnostics techniques. The JICF burner has an optically accessible premixing tube allowing the optical diagnostics. The testing was conducted for varied premixer velocities (V) and equivalence ratio (ϕ) for 90–100% (H 2 , by mole) H 2 /CH 4 reactant mixtures at atmospheric temperature and pressure conditions. Two distinct flashback events were identified – conventional rich flashback and lean flashback, recorded while increasing ϕ and decreasing ϕ, respectively. The cause of lean flashback was attributed to lower momentum flux ratio which bends the jet sharply, closer toward the injection plane. The mean OH-PLIF images characterized the flame-holding behavior, where the flame was found to be stabilized on the leeward side only or on both windward and leeward sides as a lifted flame near the fuel port. A large eddy simulation (LES) with detailed chemistry combustion modeling approach was implemented along with an OH* submechanism, and it showed qualitative agreement with the integrated line-of-sight chemiluminescence results as well as the planar OH-PLIF measurements.

chemiluminescence diagnostic↗
DOE OSTI2025

Cooperative On-Ramp Merging with Time-Varying Vehicle-to-Vehicle Communication Delay Compensation via a Model-Free Approach

Cooperative merging strategies enabled by vehicle-to-vehicle (V2V) communication have shown promise in addressing congestion, fuel inefficiency, and collision risks. However, their performance can be severely degraded by time-varying and uncertain communication delays-an issue often overlooked in existing research, which primarily focuses on merging sequence determination and trajectory planning. Furthermore, practical considerations such as heterogeneous vehicle dynamics, varying road conditions, and real-time implementation complexities are frequently neglected. This paper presents a model-free, online planning framework for cooperative on-ramp merging of connected and automated vehicles (CAVs), explicitly accounting for time-varying V2V communication delays. Without relying on detailed vehicle dynamics, the proposed method introduces a data-driven delay compensation scheme. A co-simulation platform integrating high-fidelity vehicle dynamics, traffic simulation (SUMO), and V2V communication within MATLAB/Simulink is developed to evaluate the proposed method. Simulation results demonstrate that unaddressed V2V communication delays significantly impair merging performance. In contrast, the proposed framework enhances intervehicle distance tracking and maintains low CO2 emissions and fuel consumption, under communication delay across different communication frequencies. In conclusion, its lightweight design also facilitates real-time implementation, making it well-suited for deployment in practical CAV systems.

Accounting↗
DOE OSTI2025

Mask-side Hyper-NA EUV imaging on the SHARP microscope

Hyper-NA, the prospective successor to high-numerical aperture (NA) extreme ultraviolet lithography (EUVL) could be inserted soon after 2030. Hyper-NA poses a number of challenges, including reduced depth of focus, amplified mask three-dimensional effects, and increased mask-side angular range. A Hyper-NA capable extreme ultraviolet (EUV) mask-imaging tool can address these challenges and accelerate research and development toward Hyper-NA. The Sharp High-Numerical Aperture Actinic Reticle Review Project (SHARP) EUV mask microscope is supporting mask-side high-NA imaging since 2015. Implementing mask-side Hyper-NA imaging in 2024 enables research and development toward the corresponding nodes of EUVL. Hyper-NA zoneplates at 0.75 4x/8x NA with a 6.7-deg chief ray angle and 0.85 4x/8x NA with a 7.4-deg chief ray angle are added to the SHARP microscope. Imaging at mask-side Hyper-NA is demonstrated. Imaging of 5-nm half-pitch (wafer scale) horizontal lines and spaces is demonstrated using dipole illumination. Imaging of 5-nm half-pitch (wafer scale) vertical lines and spaces is demonstrated using frequency-doubled imaging of 40-nm hp (mask scale) lines and spaces. Normalized image log slope (NILS) and modulation of Hyper-NA image data match closely to simulations for horizontal lines and spaces. A reduction in NILS of 0.3 or less is observed for vertical lines and spaces in the two-beam imaging regime. Through-focus image data are discussed, comparing different dipole sources and mask-side NAs. Mask-side Hyper-NA photomask imaging has been implemented and demonstrated on the SHARP microscope and is now available to users of the instrument.

Benk, Markus↗
DOE OSTI2024

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well structured sparse matrices. Here, in this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes

Here, this paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton’s method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function α cos(1000x) (polynomial degree ≈ 1433) takes 6 iterations to converge to machine precision when α = 0.9, and the number of iterations only increases to 18 iterations when α = 1 – 10 -9 with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product state structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method’s efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Two-Level Sketching Alternating Anderson Acceleration for Complex Physics Applications

We present a novel two-level sketching extension of the Alternating Anderson–Picard (AAP) method for accelerating fixed-point iterations in challenging single- and multiphysics simulations governed by discretized PDEs. Our approach combines a static, physics-based projection that reduces the least-squares (LS) problem to the most informative field (e.g., via Schur-complement insight) with a dynamic, algebraic sketching stage driven by a backward stability analysis under Lipschitz continuity. We introduce inexpensive estimators for stability thresholds and cache-aware randomized selection strategies to balance computational cost against memory access overhead. The resulting algorithm solves reduced LS systems in place, minimizes memory footprints, and seamlessly alternates between low-cost Picard updates and Anderson mixing. Implemented in Julia, our two-level sketching AAP achieves up to 50% time-to-solution reductions compared to standard Anderson acceleration—without degrading convergence rates—on benchmark problems including Stokes, 𝑝-Laplacian, bidomain, and Navier–Stokes formulations at varying problem sizes. These results demonstrate the method’s robustness, scalability, and potential for integration into high-performance scientific computing frameworks. Our implementation is available open source in the AAP.jl library.

Barnafi, Nicolas [University of Chile, Santiago]↗
DOE OSTI2026

Full event interpretation with machine-learning-based particle-flow reconstruction in the CMS detector

The particle-flow (PF) algorithm constructs a global description of each particle collision by producing a comprehensive list of final-state particles, and is central to event reconstruction in the CMS experiment at the CERN LHC. The existing PF implementation relies on physics-motivated heuristics and assumptions that can be replaced by machine-learning (ML) models trained directly on simulated data and naturally suited to modern graphics processing units (GPUs). A state-of-the-art ML-based PF (MLPF) reconstruction algorithm, implemented within the CMS software framework, is presented. The MLPF algorithm performs a learnable full-event reconstruction on GPUs, generalizes across detector conditions and collision energies, and replaces multiple modular reconstruction steps with a single unified model. Physics performance comparable to standard PF reconstruction is achieved in both simulation and data, with improved jet energy resolution and inference time. In simulated top quark-antiquark events under LHC Run-3 (2023-2024) conditions, the jet energy resolution improves by 10-20% for jets with transverse momentum between 30-100 GeV. Inference time is evaluated using simulated multijet events, with a median of $20\,\hbox {ms}$ per event on an Nvidia L4 GPU, compared to approximately $110\,\hbox {ms}$ for the standard CMS PF reconstruction.

Hayrapetyan, Aram [Yerevan Phys. Inst.]↗
DOE OSTI2024

CommBench: Micro-Benchmarking Hierarchical Networks with Multi-GPU, Multi-NIC Nodes

Modern high-performance computing systems have multiple GPUs and network interface cards (NICs) per node. The resulting network architectures have multilevel hierarchies of subnetworks with different interconnect and software technologies. These systems offer multiple vendor-provided communication capabilities and library implementations (IPC, MPI, NCCL, RCCL, OneCCL) with APIs providing varying levels of performance across the different levels. Understanding this performance is currently difficult because of the wide range of architectures and programming models (CUDA, HIP, OneAPI). We present CommBench, a library with cross-system portability and a high-level API that enables developers to easily build microbenchmarks relevant to their use cases and gain insight into the performance (bandwidth & latency) of multiple implementation libraries on different networks. We demonstrate CommBench with three sets of microbenchmarks that profile the performance of six systems. Our experimental results reveal the effect of multiple NICs on optimizing the bandwidth across nodes and also present the performance characteristics of four available communication libraries within and across nodes of NVIDIA, AMD, and Intel GPU networks.

Hidayetoglu, Mert↗
DOE OSTI2025

ChemComp: A Compilation Framework for Computing with Chemical Reaction Networks

The acceleration of scientific computation, data analytics, and artificial intelligence is driving a surge in computational requirements. Yet, state-of-the-art high-performance computing systems are approaching physical limitations that impede further significant improvements in energy efficiency. As we move towards post-exascale computing systems, innovative approaches are necessary to overcome this barrier in power consumption. Novel analog and hybrid digital-analog architectures hold promise for enhancing energy efficiency by several orders of magnitude. Biochemical computation stands out among the various solutions being explored due to its potential to enable new classes of devices with immense computational capabilities. These devices can capitalize on the inherent efficacy of biological cells in solving optimization problems and are scalable through increasing reaction system size or vessel capacity, potentially satisfying scientific computing's high-performance requirements. Nonetheless, several theoretical and practical limitations persist, including problem formulation and mapping to chemical reaction networks (CRNs) and implementation of actual CRN devices. In this paper, we propose a framework for biochemical computation using systems chemistry. We present the initial components of our approach: an abstract chemical reaction dialect implemented as a multi-level intermediate representation (MLIR) compiler extension and a pathway to represent mathematical problems with CRNs. To showcase the potential of this approach, we emulate a simplified chemical reservoir device. This work lays the groundwork for leveraging chemistry's computing potential in creating energy-efficient, high-performance computing systems tailored to contemporary computational needs.

artificial intelligence↗
DOE OSTI2025

QECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architectures

Quantum Error Correction (QEC) codes are essential for achieving fault-tolerant quantum computing (FTQC). However, their implementation faces significant challenges due to disparity between required dense qubit connectivity and sparse hardware architectures. Current approaches often either underutilize QEC circuit features or focus on manual designs tailored to specific codes and architectures, limiting their capability and generality. In response, we introduce QECC-Synth, an automated compiler for QEC code implementation that addresses these challenges. We leverage the ancilla bridge technique tailored to the requirements of QEC circuits and introduces a systematic classification of its design space flexibilities. We then formalize this problem using the MaxSAT framework to optimize these flexibilities. Evaluation shows that our method significantly outperforms existing methods while demonstrating broader applicability across diverse QEC codes and hardware architectures.

Yin, Keyi [University of California, San Diego]↗
DOE OSTI2025

ScaWL: Scaling k-WL (Weisfeiler-Lehman) Algorithms in Memory and Performance on Shared and Distributed-Memory Systems

The k-dimensional Weisfeiler-Lehman (k-WL) algorithm—developed as an efficient heuristic for testing if two graphs are isomorphic—is a fundamental kernel for node embedding in the emerging field of graph neural networks. Unfortunately, the k-WL algorithm has exponential storage requirements, limiting the size of graphs that can be handled. This work presents a novel k-WL scheme with a storage requirement orders of magnitude lower while maintaining the same accuracy as the original k-WL algorithm. Due to the reduced storage requirement, our scheme allows for processing much bigger graphs than previously possible on a single compute node. For even bigger graphs, we provide the first distributed-memory implementation. Our k-WL scheme also has significantly reduced communication volume and offers high scalability. Our experimental results demonstrate that our approach is significantly faster and has superior scalability compared to five other implementations employing state-of-the-art techniques.

algorithims↗
DOE OSTI2025

Complex Parsing for In-Network Acceleration of High-Energy Physics Experiments

This paper describes a novel application and evaluation of programmable networking in High-Energy Physics (HEP): a complete parser for the custom packet format used by Fermilab’s DUNE experiment. Notably, this parser is implemented on a Tofino programmable network switch and evaluated on the FABRIC testbed by using network traffic generated by the ICEBERG DUNE prototype. The parsed network traffic consists of Jumbo Ethernet frames that contain digitizations of sensor readings from ICEBERG’s detector.This work is an early investigation into providing in-network processing support for HEP experiments. The paper describes DUNE’s custom packet format, the challenges encountered when implementing a parser for that format, and an exploration of the techniques that are needed to overcome those challenges. We identify performance bottlenecks and discuss directions for future research.

Sagstad, Bjoern [IIT, Chicago] (ORCID:000900033610↗
DOE OSTI2025

Lowering and Runtime Support for Fortran’s Multi-Image Parallel Features using LLVM Flang, PRIF, and Caffeine

This paper provides an overview of the multi-image parallel features in Fortran 2023 and their implementation in the LLVM flang compiler and the Caffeine parallel runtime library. The features of interest support a Single-Program, Multiple-Data (SPMD) programming model based on executing multiple “images”, each of which is a program instance. The features also support a Partitioned Global Address Space (PGAS) in the form of “coarray” distributed data structures. The paper discusses the lowering of multi-image features to the Parallel Runtime Interface for Fortran (PRIF) and the implementation of PRIF in the Caffeine parallel runtime library. This paper also provides an early view into the design of a new multi-image dialect of the LLVM Multi-Level Intermediate Representation (MLIR). We describe validation and testing of the resulting software stack, and demonstrate that performance compares favorably to another open-source compiler and runtime library: GNU Compiler Collection (GCC) gfortran and OpenCoarrays, respectively.

Bonachea, Dan↗
DOE OSTI2025

HPC Digital Twins for Evaluating Scheduling Policies, Incentive Structures and their Impact on Power and Cooling

Schedulers are critical for optimal resource utilization in high-performance computing. Traditional methods to evaluate sched- ulers are limited to post-deployment analysis, or simulators, which do not model associated infrastructure. In this work, we present the first-of-its-kind integration of scheduling and digital twins in HPC. This enables what-if studies to understand the impact of parameter configurations and scheduling decisions on the physical assets, even before deployment, or regarching changes not easily realizable in production. We (1) provide the first digital twin framework extended with scheduling capabilities, (2) integrate various top-tier HPC systems given their publicly available datasets, (3) implement extensions to integrate external scheduling simulators. Finally, we show how to (4) implement and evaluate incentive structures, as- well-as (5) evaluate machine learning based scheduling, in such novel digital-twin based meta-framework to prototype scheduling. Our work enables what-if scenarios of HPC systems to evaluate sustainability, and the impact on the simulated system.

Maiterth, Matthias [ORNL] (ORCID:000000018698460X)↗