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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Advanced User Interface Capabilities [Slides]

This tutorial will review the data plotting and geometry visualization capabilities in the Fulcrum user interface. This tutorial will help you become familiar with Fulcrum’s 2D plot, and 2D and 3D geometry visualization features. You will learn how to identify plottable data items, compose and export plot and plot data for SCALE plot formats (SDF, Ampx MG/CE, PLT, F71, PTP, SPF, ORIGEN Gamma data, etc.) and visualize, navigate, cut, hide, and export the geometry and spatial data (fission-, dose-map, etc.) overlays in 2D and 3D. No prior experience with SCALE is required. Attendees can follow along using 6.3.0-beta.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

LDRD Abbreviated report: High-Order General-Discrete-Ordinates Method Enabling Efficient Deterministic Transport in Hydrodynamic Simulations

Deterministic transport simulations for national-security and energy applications often operate in high-dimensional phase-space, where accuracy and cost both become major challenges. A common numerical artifact in such problems is the “ray-effect,” which appears as unphysical streaks. Beyond misinterpretation, these artifacts can contaminate tightly coupled physics, such as fluid dynamics, radiation-hydrodynamics, and laser-plasma interactions, eroding the predictive capability of entire multiphysics workflows. Our objective was to make high-dimension studies practical on modern hardware while mitigating the ray-effect without relying on prohibitively expensive sampling approaches such as Monte Carlo methods. We developed the Generic Discretization Library (GenDiL), a Graphics Processing Unit (GPU)-first framework that uses high-order Discontinuous Galerkin (DG) methods and matrix-free algorithms to reduce memory usage and improve computational efficiency, critical for phase-space simulations. GenDiL supports phase-space adaptivity in both mesh size and polynomial order (hp-adaptivity) to place resolution only where it is needed. A central capability is Local Dimensional Refinement (LDR), which couples lower-dimension continuum models to higher-dimension kinetic models through stable and conservative interfaces, so that high-fidelity physics is applied only in regions where it is essential. Building on the GenDiL framework, we developed the General SN (GSN) family of algorithms as a true generalization of the polar SN approach (discrete ordinates, often denoted SN). Rather than tying discrete ordinates to a specific polar change of coordinates, GSN formulates transport on an arbitrary change of coordinates chosen to reduce ray-effect. We studied two complementary variants: an analytic variant, where the coordinate map is prescribed in advance by a closed-form function; and a data-driven variant, where a quantity of interest, such as the net flux, guides the coordinate system. GenDiL provides the library infrastructure for efficient GPU execution, but the GSN concept is algorithmic and independent of any one library. Across representative high-dimension tests, including non-symmetric solutions, both variants delivered strong ray-effect mitigation at practical cost, moving four- to six-dimensional analysis toward repeatable, routine studies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

SonicPy: a suite of programs for ultrasound pulse-echo data acquisition and analysis

Sound speed and elastic constants measurements in solids and liquids are commonly performed using the ultrasound pulse-echo technique. Recent advances have expanded the use of this technique at numerous high pressure synchrotron beamlines and offline laboratories. However, the increased experimental throughput has revealed many limitations in existing software for handling the rapid measurement and the subsequent data-reduction. Here, we report the development of a collection of computer programs for sound speed measurements using the ultrasound pulse-echo technique, compatible with stepped multi-frequency, as well as broadband-pulse, couplant-corrected methods. The programs provide a highly interactive graphical interface, enable efficient measurement, exploration and near real-time analysis of the ultrasound data, and contain features useful for working with samples under high pressure and/or high temperature. The included analysis programs can alleviate the time required for data reduction from hours to less than a minute, allowing users to make timely and informed decisions regarding the appropriate experimental parameters.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

R and DE Robotic Sensor Intern Team: Advanced Sensor Suite Prototype

The Department of Energy (DOE) nuclear complex includes many hazardous and challenging environments that must be inspected remotely and routinely for structural integrity evaluation and long-term planning purposes. The H-Canyon Air Exhaust (HCAEX) Tunnel is an example of such an environment where a biannual inspection is currently performed. Presently inspections are performed by teleoperated robotic crawlers which provide low-res video feedback to the structural engineers. Advanced sensors: including Lidar and panospheric hi-res cameras have the potential to provide additional valuable data in future inspections. The primary goal of the sensor suite is to provide an internal 3D map of the HCAEX tunnel. Possible sensors were a stereo camera, a 3D Lidar, or a 2D Lidar that would need to be spun around. The issues with the stereo camera were that it does not have a large field-of-view and that its depth information was not nearly as accurate as even the baseline Lidars. The Hokuyo UTM-30LX-EW shown below provides a 270 deg. FOV with high accuracy and resolution while the largest FOV on a 3D Lidar is 40 deg. This was the reason a 2D Lidar was chosen over the 3D Lidar. Even though the 2D Lidar requires additional components and software to generate a 3D map, its FOV advantage is too great given that the HCAEX tunnel is a relatively confined space. Along with the Lidar, a camera sensor, IMU sensor, pan-tit unit, and on board computer needed to be identified. The two panospheric cameras allow for full 360 deg. FOV. The IMU will give data on the state of the robot inside the tunnel. The computer is used to gather and process data on board and to control the pan-tilt system. Mounts were designed and 3D printed to build the prototype of the sensor suite. It was designed to have the Lidar on top With its full FOV free while having the camera below and as close to together as possible while still leaving much of their FOV visible. The design also managed the cables such that they were unlikely to be damaged if in tension and so that they did not intrude much on the cameras vision. The sensor tree developed for the H-Canyon tunnel inspection project produces a large quantity of camera and Lidar data. a postprocessing pipeline was created to facilitate the analysis of these data. The pipeline follows the following routine: 1) Registration - Salient local features in subsequent scans are identified and used to align the scans With one another. This allows production of a single cohesive map of the tunnel. 2) Sensor Fusion - RGB camera data is 'painted' onto the depth data created by the Lidar. 3) Segmentation - Individual surfaces from within the scene are segmented out separately for individual analysis. 4) Degradation Analysis - Automatic mapping of local deviation from the plane in position or surface normal is performed, as is detection of exposed rebar using Lidar return intensity. 2) Obstacle Detection - Lidar data is also used in real time to detect obstacles in the environment. This could give feedback to the operator to successfully drive in the tunnel. 6) Graphic User Interface - a custom GUI was created to facilitate customer use of the system. The system provides real-time feedback from both the cameras and Lidar. The Lidar point-cloud data is also used for obstacle detection. As the Lidar spins, various algorithms are run to analyze the current 'slice' and obstacles in the environment are determined and registered on a cost-map. A Graphical User Interface (GUI) was developed to allow the user to easily command the crawler to set the rotational speed of the Lidar, perform a scan, and register and save the 3D generated cloud after a scan is done. For the good of the crawler, a critical aspect of the GUI design is to allow the user to cancel a scan any time after it is commanded and before it is saved. The sensor trees depth accuracy was evaluated in comparison to a high end commercial FARO Terrestrial Laser Scanner (TLS) with specifications for millimeter accuracy at distances above 10 m. For the purposes of these tests, the depth measurements produced by the TLS were taken as ground truth. Example test wall panels were scanned with the TLS and postprocessed with its proprietary software, and subsequently scanned with the sensor tree system. The two scans were manually aligned and for each point in the output cloud from the sensor tree, the distance to the nearest ground truth point in the FARO cloud was determined. 98.7% of all produced points were within the specified target range of 6 mm, with an average deviation of 1.75 mm. The test walls used have an overall in-wall depth variation of around 40 mm.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2018

SCALE Code System

The SCALE Code System is a widely-used modeling and simulation suite for nuclear safety analysis and design that is developed, maintained, tested, and managed by the Reactor and Nuclear Systems Division (RNSD) of Oak Ridge National Laboratory (ORNL). SCALE provides a comprehensive, verified and validated, user-friendly tool set for criticality safety, reactor and lattice physics, radiation shielding, spent fuel and radioactive source term characterization, and sensitivity and uncertainty analysis. Since 1980, regulators, licensees, and research institutions around the world have used SCALE for safety analysis and design. SCALE provides an integrated framework with dozens of computational modules including three deterministic and three Monte Carlo radiation transport solvers that are selected based on the desired solution strategy. SCALE includes current nuclear data libraries and problem-dependent processing tools for continuous-energy (CE) and multigroup (MG) neutronics and coupled neutron-gamma calculations, as well as activation, depletion, and decay calculations. SCALE includes unique capabilities for automated variance reduction for shielding calculations, as well as sensitivity and uncertainty analysis. SCALE’s graphical user interfaces assist with accurate system modeling, visualization of nuclear data, and convenient access to desired results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Parallel beamlet dose calculation via beamlet contexts in a distributed multi‐GPU framework

Purpose Dose calculation is one of the most computationally intensive, yet essential tasks in the treatment planning process. With the recent interest in automatic beam orientation and arc trajectory optimization techniques, there is a great need for more efficient model‐based dose calculation algorithms that can accommodate hundreds to thousands of beam candidates at once. Foundational work has shown the translation of dose calculation algorithms to graphical processing units ( GPU s), lending to remarkable gains in processing efficiency. But these methods provide parallelization of dose for only a single beamlet, serializing the calculation of multiple beamlets and under‐utilizing the potential of modern GPU s. In this paper, the authors propose a framework enabling parallel computation of many beamlet doses using a novel beamlet context transformation and further embed this approach in a scalable network of multi‐ GPU computational nodes. Methods The proposed context‐based transformation separates beamlet‐local density and TERMA into distinct beamlet contexts that independently provide sufficient data for beamlet dose calculation. Beamlet contexts are arranged in a composite context array with dosimetric isolation, and the context array is subjected to a GPU collapsed‐cone convolution superposition procedure, producing the set of beamlet‐specific dose distributions in a single pass. Dose from each context is converted to a sparse representation for efficient storage and retrieval during treatment plan optimization. The context radius is a new parameter permitting flexibility between the speed and fidelity of the dose calculation process. A distributed manager‐worker architecture is constructed around the context‐based GPU dose calculation approach supporting an arbitrary number of worker nodes and resident GPU s. Phantom experiments were executed to verify the accuracy of the context‐based approach compared to Monte Carlo and a reference CPU ‐ CCCS implementation for single beamlets and broad beams composed by addition of beamlets. Dose for representative 4 π beam sets was calculated in lung and prostate cases to compare its efficiency with that of an existing beamlet‐sequential GPU ‐ CCCS implementation. Code profiling was also performed to evaluate the scalability of the framework across many networked GPU s. Results The dosimetric accuracy of the context‐based method displays <1.35% and 2.35% average error from the existing serialized CPU ‐ CCCS algorithm and Monte Carlo simulation for beamlet‐specific PDD s in water and slab phantoms, respectively. The context‐based method demonstrates substantial speedup of up to two orders of magnitude over the beamlet‐sequential GPU ‐ CCCS method in the tested configurations. The context‐based framework demonstrates near linear scaling in the number of distributed compute nodes and GPU s employed, indicating that it is flexible enough to meet the performance requirements of most users by simply increasing the hardware utilization. Conclusions The context‐based approach demonstrates a new expectation of performance for beamlet‐based dose calculation methods. This approach has been successful in accelerating the dose calculation process for very large‐scale treatment planning problems ‐ such as automatic 4 π IMRT beam orientation and VMAT arc trajectory selection, with hundreds of thousands of beamlets ‐ in clinically feasible timeframes. The flexibility of this framework makes it as a strong candidate for use in a variety of other very large‐scale treatment planning tasks and clinical workflows.

Neph, Ryan↗
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

Acceleration of the particle-in-cell code Osiris with graphics processing units

Fully relativistic particle-in-cell (PIC) simulations are crucial for advancing our knowledge of plasma physics. Modern supercomputers based on graphics processing units (GPUs) offer the potential to perform PIC simulations of unprecedented scale, but require robust and feature-rich codes that can fully leverage their computational resources. In this work, this demand is addressed by adding GPU acceleration to the PIC code Osiris. An overview of the algorithm, which features a CUDA extension to the underlying Fortran architecture, is given. Detailed performance benchmarks for thermal plasmas are presented, which demonstrate excellent weak scaling on NERSC's Perlmutter supercomputer and high levels of absolute performance. The robustness of the code to model a variety of physical systems is demonstrated via simulations of Weibel filamentation and laser-wakefield acceleration run with dynamic load balancing. Finally, measurements and analysis of energy consumption are provided that indicate that the GPU algorithm is up to ~14 times faster and ~7 times more energy efficient than the optimized CPU algorithm on a node-to-node basis. The described development addresses the PIC simulation community's computational demands both by contributing a robust and performant GPU-accelerated PIC code and by providing insight into efficient use of GPU hardware.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2015

Hydromagnetic flow of third grade nanofluid with viscous dissipation and flux conditions

This article investigates the magnetohydrodynamic flow of third grade nanofluid with thermophoresis and Brownian motion effects. Energy equation is considered in the presence of thermal radiation and viscous dissipation. Rosseland’s approximation is employed for thermal radiation. The heat and concentration flux conditions are taken into account. The governing nonlinear mathematical expressions of velocity, temperature and concentration are converted into dimensionless expressions via transformations. Series solutions of the dimensionless velocity, temperature and concentration are developed. Convergence of the constructed solutions is checked out both graphically and numerically. Effects of interesting physical parameters on the temperature and concentration are plotted and discussed in detail. Numerical values of skin-friction coefficient are computed for the hydrodynamic and hydromagnetic flow cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

Technique for fast and efficient hierarchical clustering

A fast and efficient technique for hierarchical clustering of samples in a dataset includes compressing the dataset to reduce a number of variables within each of the samples of the dataset. A nearest neighbor matrix is generated to identify nearest neighbor pairs between the samples based on differences between the variables of the samples. The samples are arranged into a hierarchy that groups the samples based on the nearest neighbor matrix. The hierarchy is rendered to a display to graphically illustrate similarities or differences between the samples.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2021

VERAIO Software Management Plan

VERAIO is a set of utility codes used to provide a common set of input and outputs to the Virtual Environment for Reactor Applications (VERA). VERA is a collection of several different computer codes that all have a common input and output. This prevents the need to manage input and output from each individual code, allowing for ease of use and reducing errors associated with code operability. The VERAIO utilities include VERAIn, VERAView, and VERARun. Each of these utilities is described below. VERAIn is an input processor that reads an ASCII input file generated by users, parses the file, performs some error checking, and writes an XML file to be read by other VERA codes. The main purpose of VERAIn is to provide a common input to all of the VERA codes so users only need to learn one input. VERAIn is written in Perl and uses YAML configuration files to provide flexibility. VERAView is a graphical user interface (GUI) that reads a VERA HDF output file and allows users to visualize results. VERAView is written in Python. VERARun is a script that drives the VERA execution in a high performance computing (HPC) environment. Work performed at the code level supports the Quality Assurance Program Plan (QAPP) (VERA-QA-001), and VERA Software Quality Assurance Plan (VERA-QA-002).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Edge counts for the auxiliary pair graph within the graphical unitary group approach

Closed-form expressions are presented for the numbers of edges in the auxiliary pair graphs (APGs) associated with non spin-orbit and spin-orbit Shavitt graphs for full configuration interaction expansions. A Shavitt graph is a visual representation of a configuration state function expansion space constructed via the graphical unitary group approach (GUGA). An APG is an organisational aid and a programmatic tool generated from a Shavitt graph. The number of edges in an APG determines bounds on the computational scaling as a function of the total numbers of electrons, orbitals, and spin multiplicities. The edge counts extend a suite of Shavitt graph statistics based on these functional parameters. The derivation and the presentation of the formulas for the edge counts has been assisted by the bra-ket interchange symmetry and the particle-hole interchange symmetry in the GUGA formalism. Furthermore, these symmetry operators produce one-to-one correspondences between various sets of edges, and this yields identities among some edge count formulas. There are 208 possible edge types. Of these, some do not contribute to two-electron operators, some are related by bra-ket interchange symmetry, and some are related by particle-hole interchange symmetry. For the remaining unique edge types, explicit expressions are derived for the numbers of edges.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2019

Parallel accelerated Custom Correlation Coefficient calculations for genomics applications

The massive quantities of genomic data being made available through gene sequencing techniques are enabling breakthroughs in genomic science in many areas such as medical advances in the diagnosis and treatment of diseases. Analyzing this data, however, is a computational challenge insofar as the computational costs of the relevant algorithms can grow with quadratic, cubic or higher complexity—leading to the need for leadership scale computing. In this paper we describe a new approach to calculations of the Custom Correlation Coefficient (CCC) between Single Nucleotide Polymorphisms (SNPs) across a population, suitable for parallel systems equipped with graphics processing units (GPUs) or Intel Xeon Phi processors. We describe the mapping of the algorithms to accelerated processors, techniques used for eliminating redundant calculations due to symmetries, and strategies for efficient mapping of the calculations to many-node parallel systems. Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than nine quadrillion (9 × 10 15 ) elementwise comparisons achieved per second with the latest optimized code on the ORNL Titan system, this being orders of magnitude faster than rates achieved using other codes and platforms as reported in the literature. Also it is estimated that as many as 90 quadrillion (90 × 10 15 ) comparisons per second may be achievable on the upcoming ORNL Summit system, an additional 10X performance increase. Finally, in a companion paper we describe corresponding techniques applied to calculations of the Proportional Similarity metric for comparative genomics applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Heterogeneous Reconstruction of Tracks and Primary Vertices With the CMS Pixel Tracker

The High-Luminosity upgrade of the Large Hadron Collider (LHC) will see the accelerator reach an instantaneous luminosity of 7 × 10 34 cm −2 s −1 with an average pileup of 200 proton-proton collisions. These conditions will pose an unprecedented challenge to the online and offline reconstruction software developed by the experiments. The computational complexity will exceed by far the expected increase in processing power for conventional CPUs, demanding an alternative approach. Industry and High-Performance Computing (HPC) centers are successfully using heterogeneous computing platforms to achieve higher throughput and better energy efficiency by matching each job to the most appropriate architecture. In this paper we will describe the results of a heterogeneous implementation of pixel tracks and vertices reconstruction chain on Graphics Processing Units (GPUs). The framework has been designed and developed to be integrated in the CMS reconstruction software, CMSSW. The speed up achieved by leveraging GPUs allows for more complex algorithms to be executed, obtaining better physics output and a higher throughput.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Landau singularities of the 7-point ziggurat. Part I

We compute the leading (first-type Landau) singularities of a certain four-loop 7-point graph that is related to the 7-point “ziggurat” graph by the graphical moves familiar from equivalent circuit theory. We find perfect agreement with a subset of the “heptagon symbol alphabet” that has appeared in the context of planar Ν = 4 super-Yang-Mills theory. The remaining heptagon symbol letters are found in its subleading Landau singularities, which we address in a companion paper.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

TTDFT: A GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations

We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtered subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. In conclusion, the computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.

97 MATHEMATICS AND COMPUTING↗