Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer graphics”

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

Speed Optimizations for Physics Ray Trace Algorithms

Ray tracing is a process used commonly in computer graphics and in physics to track light photons and particles, respectively. Much research was found on improving execution times for the computer graphics applications; however, in the short time frame of this literary review, almost no research was found on improving the execution times for the physics applications that were relevant to this problem. Two ray trace algorithms, a STL raytrace and a conebeam raytrace, were optimized using OpenMP and CUDA.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Enabling Scientific Applications with Performance-Portability and High-Productivity for Multi-GPU Programming with JACC.Multi

This work bridges the gap between multi-GPU computing and high-productivity, performance-portable programming solutions. Our goal is to enhance scientific applications with a productive and portable solution—program once, deploy everywhere—for multi-GPU programming with no cost to programmability. To accomplish this, we implemented JACC.Multi, which is part of the Julia for ACCelerators (JACC) performance-portable framework. JACC. Multi is the only high-level, portable metaprogramming solution that targets multi-GPU environments and is integrated in a readily accessible programming language (e.g., Julia language). With transparent GPU-to-GPU communication, JACC. Multi is optimized for scientific application workloads and is portable for NVIDIA and AMD accelerators. For the evaluation, we use two modern multi-GPU systems: Hudson, which features two NVIDIA H100 Hopper GPUs per node, and Frontier, which features four AMD MI250X GPUs per node, each with two Graphics Compute Dies (GCDs) for a total of eight GCDs per node. Additionally, as part of the evaluation, we use JACC (one GPU), MPI+JACC, and JACC. Multi codes that implement well-known and widely used scientific algorithms/kernels such as the conjugate gradient algorithm and an explicit forward Euler solver that requires GPU-to-GPU communication. Overall, JACC. Multi codes achieve better performance than MPI+JACC codes and significant speedups over JACC (one GPU), with up to 1.9× on Hudson and 6× on Frontier.

Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗
DOE OSTI2025

Generalized fiducial inference on differentiable manifolds

We introduce a novel approach to inference on parameters that take values in a Riemannian manifold embedded in a Euclidean space. Parameter spaces of this form are ubiquitous across many fields, including chemistry, physics, computer graphics, and geology. Here, this new approach uses generalized fiducial inference (GFI) to obtain a posterior-like distribution on the manifold, without needing to know local parameterizations that map to the constrained space from an unconstrained Euclidean space. Using mathematical tools from Riemannian geometry, we construct a constrained generalized fiducial distribution (CGFD). A Bernstein-von Mises-type result for the CGFD, which provides intuition for how the desirable asymptotic qualities of the unconstrained generalized fiducial distribution are inherited by the CGFD, is provided. To illustrate the practical use of the CGFD, we provide a proof-of-concept example in the context of a linear logspline density estimation problem, and demonstrate that CGFD-based confidence sets exhibit desirable coverage properties via simulation. As an application, we fit a CGFD to COVID-19 case count data from North Carolina, USA.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Tusqh

SAND2025-00675O Tusqh is a software tool that generates cubical meshes in 2D and 3D and computes the homology of these meshes using persistent homology. It includes a grid cell in the output if its volume-fraction is above a selectable threshold, estimated by sampling points within the cell. Tusqh incorporates anti-aliasing algorithms to mitigate grid orientation and scale effects. It is designed for creating finite element meshes for simulations and can be used in various applications such as heat diffusion, mechanical simulations, and computer graphics rendering. The software outputs meshes in an open format compatible with downstream software. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗
NASA NTRS1981

Synthetic battery cycling

The use of interactive computer graphics is suggested as an aid in battery system development. Mathematical representations of simplistic but fully representative functions of many electrochemical concepts of current practical interest will permit battery level charge and discharge phenomena to be analyzed in a qualitative manner prior to the assembly and testing of actual hardware. This technique is a useful addition to the variety of tools available to the battery system designer as he bridges the gap between interesting single cell life test data and reliable energy storage subsystems.

Thaller, L. H.↗
NASA NTRS1982

Synthetic battery cycling techniques

Synthetic battery cycling makes use of the fast growing capability of computer graphics to illustrate some of the basic characteristics of operation of individual electrodes within an operating electrochemical cell. It can also simulate the operation of an entire string of cells that are used as the energy storage subsystem of a power system. The group of techniques that as a class have been referred to as Synthetic Battery Cycling is developed in part to try to bridge the gap of understanding that exists between single cell characteristics and battery system behavior.

Leibecki, H. F.↗
NASA NTRS1981

Synthetic battery cycling

The trend in energy storage is toward systems with high-voltage and high-power outputs. These conditions accentuate the cumulative effects of small differences in characteristics from cell to cell in any large multicell battery. These considerations are of particular concern with a number of emerging electrochemical concepts where convenient overcharge reactions do not exist. The use of interactive computer graphics is suggested as an aid in battery system development. Mathematical representations of simplistic but fully representative functions of many electrochemical concepts of current practical interest will permit battery-level charge and discharge phenomena to be analyzed in a qualitative manner prior to the assembly and testing of actual hardware. This technique will be a useful addition to the variety of tools available to the battery system designer as he bridges the gap between interesting single-cell life test data and reliable energy storage subsystems.

Thaller, L. H.↗
NASA NTRS1982

Synthetic battery cycling techniques

The group of techniques that as a class are referred to as synthetic battery cycling are described with reference to spacecraft battery systems. Synthetic battery cycling makes use of the capability of computer graphics to illustrate some of the basic characteristics of operation of individual electrodes within an operating electrochemical cell. It can also simulate the operation of an entire string of cells that are used as the energy storage subsystem of a power system.

Leibecki, H.↗
DOE OSTI2025

Automated Hybrid Variance Reduction on Advanced Architectures in the Shift Monte Carlo Code

Monte Carlo transport methods are the most accurate schemes for solving problems with complex energy and spatial features, but they come with a high computational cost. Although hybrid methods have enabled the use of Monte Carlo transport for a large class of problems, they still require significant computing resources. Modern multicore CPUs with large numbers of compute cores and graphical processing units (GPUs) provide opportunities to optimize the memory and run-time costs of hybrid Monte Carlo methods. This paper documents the development and analysis of three Monte Carlo transport algorithms that support hybrid transport using the consistent adjoint-driven importance sampling (CADIS) and forward-weighted CADIS methods in the Shift Monte Carlo code: history-based transport using static and dynamic threading on multicore CPUs and event-based transport enabling weight window tracking on GPUs. The results are shown for two challenging hybrid problems on the Frontier supercomputer at the Oak Ridge Leadership Computing Facility. The results show that all three methods yield good performance and enable solutions of difficult fixed-source transport problems in less than 2 min on 20 nodes of Frontier. Dynamic threading was observed to give up to 20% better scaling behavior than static threading. Moreover, the AMD Instinct 250X GPU was found to give 9 to 11 times greater throughput per graphics compute die than the best CPU performance. In conclusion, additional opportunities for optimization of hybrid transport on GPUs are discussed.

Denovo↗
DOE OSTI2025

DG2DAG: Learning Directed Acyclic Graphs from Functional Priors

Physics-based systems-of-systems models are computationally expensive. Reduced graphical models can decrease computational complexity, but may not proffer an end-to-end model from upstream inputs to downstream outputs. We consequently are interested in reducing models on directed graphs to models on a directed acyclic subgraph such that preserves accurate reconstruction of nodes. The consequence is a model with a topological ordering, providing a one-way flow of computation, and a causal interpr

Voronin, Alexey [Sandia National Laboratories (SNL↗
DOE OSTI2026

Computationally efficient Bayesian estimation of graphical networks for omics data

Graphical networks are useful, widely-used modeling approaches to represent complex biological processes with biological measurements generated by platforms such as mass spectrometry. Bayesian analyses of graphical networks for omics data have several advantages over their frequentist counterparts, such as the inclusion of prior knowledge in the estimation of models. However, Bayesian approaches to date have only been feasible for data with a couple hundred biomolecules due to prohibitive computational time, but omics data often contains tens of thousands of biomolecules. Here, we present and illustrate a more computationally efficient approach named BPlane (Bayesian PseudoLikelihood-based Algorithm for Network Estimation) to extend Bayesian modeling capabilities for larger-sized datasets, such as most untargeted proteomics data. Via simulation, we demonstrate that BPlane produces substantial computational savings over a current state-of-the-art Bayesian algorithm while maintaining competitive edge detection accuracy. On a SARS-CoV2 proteomics data with 7000 proteins, the competing algorithm takes three times as long to complete the first iteration as BPlane takes to converge after over 100 iterations.

EM algorithm↗
DOE OSTI2025

Advanced Simulation of ITER Core X-ray Crystal Spectroscopy

X-Ray Simulation Analysis (XRSA) is an analytical ray-tracing mixed code developed specifically for the ITER Core X-Ray Crystal Spectroscopy (XRCS-Core) diagnostic, which employs a dual-reflection configuration incorporating multiple pre-reflectors made of Highly Oriented Pyrolytic Graphite (HOPG) and spherically curved analyzing crystals. The ITER XRCS-Core is designed for high spectral resolution measurement in specific wavelength ranges, including narrow bands around 1.354 Å for W 64+ , 2.19 Å for Xe 51+ , and 2.555 Å for Xe 44+ and Xe 47+ , enabling diagnostic capability across a broad electron temperature range in the ITER plasma. XRSA facilitates efficient simulation of the spectral performance of this complex X-ray spectroscopic system. Recent updates to the XRSA code have incorporated two critical effects: auto-focusing, which specifically applies to HOPG, and polarization. These two effects are particularly important in the dual-reflection configuration used in the ITER XRCS-Core system to provide more accurate modeling results. Here, simulations conducted with the updated code demonstrate that polarization has a substantial impact on the performance of the dual-reflection system. Additionally, the combined influence of polarization and system layout introduces performance variations across channels through the same crystal.

Computer graphics↗
DOE OSTI2025

A three-dimensional laser ray-tracing methodology for radiation-hydrodynamics simulations

We report on a methodology for performing laser ray-tracing in three spatial dimensions for radiation-hydrodynamics simulation codes. Our method, which is an extension of that developed in Haines et al., Comput. Fluids 201, 104478 (2020), utilizes an automatically generated separate mesh for the laser ray-tracing from the radiation-hydrodynamics mesh. This enables the laser mesh to be tailored to minimize ray noise with significantly fewer rays than would be required when the ray-tracing is performed on the radiation-hydrodynamics mesh, primarily by allowing the use of high-aspect-ratio cells that are not suitable for hydrodynamics solvers. For a planar target, we show that our method provides a ≈ 100× reduction in computational expense to achieve a fixed level of ray noise relative to ray-tracing directly on the radiation-hydrodynamics mesh. The relatively low ray requirement also enables efficient computation of cross-beam energy transfer. Each cell in the logically cubic laser mesh is a non-convex dodecahedron with triangular sides, and numerical integration of the ray trajectories and inverse bremsstrahlung is performed by mapping each cell to the unit cube. We will describe our methodology in detail as well as its implementation in the xRAGE radiation-hydrodynamics code, discuss performance, and present the results from applying the methodology to test problems with analytic solutions for laser ray-tracing through a quadratic density gradient with an analytic solution as well as for a laser-driven heat front. In 3D radiation-hydrodynamics simulations of laser-driven experiments performed on the National Ignition Facility, laser ray-tracing with our methodology uses less than 1% of total computational time while introducing acceptably low levels of ray noise.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

High-resolution bandpass x-ray imaging with crystal reflectors: Overcoming geometric aberrations

The imaging problem of a specular reflector is revisited. Retaining terms through the second order in the reflector surface expansion, we derive the form of the aberration-limiting aperture for arbitrary magnification, assuming no bandwidth limitations. A permissible relative aperture size of the reflector is limited by a set relative aberration tolerance and scales with the tangent of the central glancing angle of incidence. These limiting aberrations become practically insignificant near backscattering. The results extend to x-ray diffracting crystals in symmetric Bragg geometry shaped as an ellipsoid of revolution. This geometry permits polychromatic imaging for hard x-rays over a bandwidth defined by the accepted range of Bragg angles, thereby suppressing aberrations of higher orders. We assess ellipsoidal crystal imagers using ray tracing simulations for two high-magnification designs with Bragg angles far from and close to backscattering. Finally, in both cases, the ellipsoidal crystals produce images of higher quality compared to those formed by equivalent toroidal crystal imagers.

Bragg reflection↗
DOE OSTI2025

Integrating Energy-Efficient Computing with Computational Research to Accelerate Energy Technology

NREL's computational sciences center hosts the largest high performance computing (HPC) capabilities dedicated to energy research while functioning as a living laboratory for energy-efficient computing. NREL's HPC capabilities support the research needs of the Department of Energy's Office of Energy Efficiency and Renewable Energy (EERE). In ten years of operation, HPC use in EERE-sponsored research has grown by a factor of 30, including work in electricity generation, energy efficiency, transportation, and energy system modeling. This paper analyzes this research portfolio, providing examples of individual use cases. The paper documents NREL's history of operating one of the world's most energy-efficient data centers while examining pathways to reduce economic and environmental impact beyond reduction of Power Usage Efficiency (PUE). This paper concludes by examining the unique opportunities created for accelerating improvements in data center efficiency created by combining an HPC system dedicated to energy research and a research program in energy-efficient computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Benchmarking Operators in Deep Neural Networks for Improving Performance Portability of SYCL

SYCL is a portable programming model for heterogeneous computing, so it is important to obtain reasonable performance portability of SYCL. Towards the goal of better understanding and improving performance portability of SYCL for machine learning workloads, we have been developing benchmarks for basic operators in deep neural networks (DNNs). These operators could be offloaded to heterogeneous computing devices such as graphics processing units (GPUs) to speed up computation. In this paper, we introduce the benchmarks, evaluate the performance of the operators on GPU-based systems, and describe the causes of the performance gap between the SYCL and Compute Unified Device Architecture (CUDA) kernels. We find that the causes are related to the utilization of the texture cache for read-only data, optimization of the memory accesses with strength reduction, use of local memory, and register usage per thread. We hope that the efforts of developing benchmarks for studying performance portability will stimulate discussion and interactions within the community.

Jin, Zheming [ORNL] (ORCID:000000027197780X)↗
DOE OSTI2025

AMR-Wind: A Performance-Portable, High-Fidelity Flow Solver for Wind Farm Simulations

We present AMR-Wind, a verified and validated high-fidelity computational-fluid-dynamics code for wind farm flows. AMR-Wind is a block-structured, adaptive-mesh, incompressible-flow solver that enables predictive simulations of the atmospheric boundary layer and wind plants. It is a highly scalable code designed for parallel high-performance computing with a specific focus on performance portability for current and future computing architectures, including graphical processing units (GPUs). In this paper, we detail the governing equations, the numerical methods, and the turbine models. Establishing a foundation for the correctness of the code, we present the results of formal verification and validation. The verification studies, which include a novel actuator line test case, indicate that AMR-Wind is spatially and temporally second-order accurate. The validation studies demonstrate that the key physics capabilities implemented in the code, including actuator disk models, actuator line models, turbulence models, and large eddy simulation (LES) models for atmospheric boundary layers, perform well in comparison to reference data from established computational tools and theory. We conclude with a demonstration simulation of a 12-turbine wind farm operating in a turbulent atmospheric boundary layer, detailing computational performance and realistic wake interactions.

17 WIND ENERGY↗
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↗