Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “accelerated computation”

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 1,603 records · Page 89
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Analytical investigation of the dynamics of tethered constellations in Earth orbit, phase 2

This Quarterly Report deals with the deployment maneuver of a single-axis, vertical constellation with three masses. A new, easy to handle, computer code that simulates the two-dimensional dynamics of the constellation has been implemented. This computer code is used for designing control laws for the deployment maneuver that minimizes the acceleration level of the low-g platform during the maneuver.

Lorenzini, E.↗
NASA NTRS1992

Point-implicit relaxation strategies for viscous, hypersonic flows

An upwind-biased, point-implicit relaxation algorithm for obtaining the numerical solution to the governing equations for 3D, viscous, hypersonic flows in chemical and thermal nonequilibrium is described. The algorithm is derived using a finite-volume formulation in which the inviscid components of flux across cell walls are described with a modified Roe's averaging and Harten's entropy fix with second-order corrections based on Yee's symmetric total variation diminishing scheme. Newton relaxation of the fully coupled equation set is employed on a cell-to-cell basis. Under-relaxation of the inviscid and over-relaxation of the viscous contributions to the residual are implemented. Computational work is easily partitioned among many processors in an asynchronous, dynamic mode for convergence acceleration. An overview of the physical models employed herein for thermochemical nonequilibrium is included. Several test cases and comparisons with experimental data are presented involving hypersonic flow over blunt bodies which illustrate the qualitative and quantitative capabilities of this approach.

Gnoffo, P. A.↗
NASA NTRS1994

Magnetocentrifugally driven flows from young stars and disks. 2: Formulation of the dynamical problem

We formulate the dynamical problem of a cool wind centrifugally driven from the magnetic interface of a young star and an adjoining Keplerian disk. We examine the situation for mildly accreting T Tauri stars that rotate slowly as well as rapidly accreting protostars that rotate near break-up. In both cases a wind can be driven from a small X-region just outside the stellar magnetopause, where the field lines assume an open geometry and are rooted to material that rotates at an angular speed equal both to the local Keplerian value and to the stellar angular speed. Assuming axial symmetry for the ideal magnetohydrodynamic flow, which requires us to postpone asking how the (lightly ionized) gas is loaded onto field lines, we can formally integrate all the governing equations analytically except for a partial equation that describes how streamlines spread in the meridional plane. Apart from the difficulty of dealing with PDEs of mixed type, finding the functional forms of the conserved quantities along streamlines - the ratio beta of magnetic field to mass flux, the specific energy H of the fluid in the rotating frame, and the total specific angular momentum J carried in the matter and the field - constitutes a standard difficulty in this kind of (Grad-Shafranov) formalism. Fortunately, because the ratio of the thermal speed of the mass-loss regions to the Keplerian speed of rotation of the interface constitutes a small parameter epsilon, we can attack the overall problem by the method of matched asymptotic expansions. This procedure leads to a natural and systematic technique for obtaining the relevant functional dependences of beta, H, and J. Moreover, we are able to solve analytically for the properties of the flow emergent from the small transsonic region driven by gas pressure without having to specify the detailed form of any of the conserved functions, beta, H, and J. This analytical solution provides inner boundary conditions for the numerical computation in a companion paper by Najita & Shu of the larger region where the main acceleration to terminal speeds occurs.

Shu, Frank H.↗
NASA NTRS1999

Realistic NLTE Radiative Transfer for Modeling Stellar Winds

This NASA grant supported the development of codes to solve the non-LTE multi-level spherical radiative transfer problem in the presence of velocity fields. Much of this work was done in collaboration with Graham Harper (CASA, University of Colorado). These codes were developed for application to the cool, low-velocity winds of evolved late-type stars. Particular emphasis was placed on modeling the wind of lambda Velorum (K4 lb), the brightest K supergiant in the sky, based on extensive observations of the ultraviolet spectrum with the HST/GHRS from GO program 5307. Several solution techniques were examined, including the Eddington factor Approach described in detail by Bennett & Harper (1997). An Eddington factor variant of Harper's S-MULTI code (Harper 1994) for stationary atmospheres was developed and implemented, although full convergence was not realized. The ratio of wind terminal velocity to turbulent velocity is large (approx. 0.3-0.5) in these cool star winds so this assumption of stationarity provides reasonable starting models. Final models, incorporating specified wind laws, were converged using the comoving CRD S-MULTI code. Details of the solution procedure were published by Bennett & Harper (1997). Our analysis of the wind of lambda Vel, based on wind absorption superimposed on chromospheric emission lines in the ultraviolet, can be found in Carpenter et al. (1999). In this paper, we compare observed wind absorption features to an exact CRD calculation in the comoving frame, and also to a much quicker, but approximate, method using the SEI (Sobolev with Exact Integration) code of Lamers, Cerruti-Sola, & Perinotto (1987). Carpenter et al. (1999) provide detailed comparisons of the exact CRD and approximate SEI results and discuss when SEI is adequate to use for computing wind line profiles. Unfortunately, the observational material is insufficient to unambiguously determine the wind acceleration law for lambda Vel. Relatively few unblended Fe II lines of optical depth sensitive to the wind acceleration region are present in the existing HST/GHRS data set. Most of the Fe II lines are either too optically thick (resulting in a board, black wind absorption profile) or too optically thin (resulting in no wind absorption feature present). Also, most of the ultraviolet spectra obtained from HST GO-5307 was at medium resolution (R approx. 40,000, corresponding to a velocity resolution of 7.5 km/s). This is simply inadequate to resolve the turbulence in the outer wind; a key parameter in theoretical wind models. We can now say that an unambiguous determination of the wind velocity law in lambda Vel will require complete coverage of the ultraviolet spectrum at high dispersion (R approx. 10(exp 5), or 3 km/s). This is now feasible usin, the STIS echelle spectrograph on-board HST.

Bennett, Philip D.↗
NASA NTRS2004

Wavefront Sensing via High Speed DSP

Future light-weighted and segmented primary mirror systems require active optical control to maintain mirror positioning and figure to within nanometer tolerances. Current image-based wavefront sensing approaches rely on post-processing techniques to return an estimate of the aberrated optical wavefront with accuracies to the nanometer level. But the lag times between wavefront sensing, and then control, contributes to a significant latency in the wavefront sensing implementation. In this analysis we demonstrate accelerated image-based wavefront sensing performance using multiple digital signal processors (DSP's). The computational architecture is discussed as well as the heritage leading to the approach.

Smith, J. Scott↗
NASA NTRS2005

Integrated Structural Analysis and Test Program

An integrated structural-analysis and structure-testing computer program is being developed in order to: Automate repetitive processes in testing and analysis; Accelerate pre-test analysis; Accelerate reporting of tests; Facilitate planning of tests; Improve execution of tests; Create a vibration, acoustics, and shock test database; and Integrate analysis and test data. The software package includes modules pertaining to sinusoidal and random vibration, shock and time replication, acoustics, base-driven modal survey, and mass properties and static/dynamic balance. The program is commanded by use of ActiveX controls. There is minimal need to generate command lines. Analysis or test files are selected by opening a Windows Explorer display. After selecting the desired input file, the program goes to a so-called analysis data process or test data process, depending on the type of input data. The status of the process is given by a Windows status bar, and when processing is complete, the data are reported in graphical, tubular, and matrix form.

Kaufman, Daniel↗
DOE OSTI2020

Scientific Computing

Scientists, engineers and programmers at Fermilab are tackling today’s most challenging computational problems. Their solutions, motivated by the needs of worldwide research in particle physics and accelerators, help America stay at the forefront of innovation.

Fermilab, Fermilab↗
DOE OSTI2025

Machine Learning-Driven Conservative-to-Primitive Conversion in Hybrid Piecewise Polytropic and Tabulated Equations of State

We present a novel machine learning (ML)-based method to accelerate conservative-to-primitive inversion, focusing on hybrid piecewise polytropic and tabulated equations of state. Traditional root-finding techniques are computationally expensive, particularly for large-scale relativistic hydrodynamics simulations. To address this, we employ feedforward neural networks (NNC2PS and NNC2PL), trained in PyTorch (2.0+) and optimized for GPU inference using NVIDIA TensorRT (8.4.1), achieving significant speedups with minimal accuracy loss. The NNC2PS model achieves 𝐿 1 and 𝐿 ∞ errors of 4.54 × 10 −7 and 3.44 × 10−6, respectively, while the NNC2PL model exhibits even lower error values. TensorRT optimization with mixed-precision deployment substantially accelerates performance compared to traditional root-finding methods. Specifically, the mixed-precision TensorRT engine for NNC2PS achieves inference speeds approximately 400 times faster than a traditional single-threaded CPU implementation for a dataset size of 1,000,000 points. Ideal parallelization across an entire compute node in the Delta supercomputer (dual AMD 64-core 2.45 GHz Milan processors and 8 NVIDIA A100 GPUs with 40 GB HBM2 RAM and NVLink) predicts a 25-fold speedup for TensorRT over an optimally parallelized numerical method when processing 8 million data points. Moreover, the ML method exhibits sub-linear scaling with increasing dataset sizes. We release the scientific software developed, enabling further validation and extension of our findings. By exploiting the underlying symmetries within the equation of state, these findings highlight the potential of ML, combined with GPU optimization and model quantization, to accelerate conservative-to-primitive inversion in relativistic hydrodynamics simulations.

conservative-to-primitive conversion↗
DOE OSTI2025

Machine learning for arbitrary single-qubit rotations on an embedded device

Here, in this study, we present a technique for using machine learning (ML) for single-qubit gate synthesis on field-programmable logic for a superconducting transmon-based quantum computer based on simulated studies. Our approach is multi-stage. We first “bootstrap” a model based on simulation with access to the full state vector for measuring gate fidelity. We next present an algorithm, named adapted randomized benchmarking (ARB), for fine-tuning the gate on hardware based on measurements of the devices. We also present techniques for deploying the model on programmable devices with care to reduce the required resources. While the techniques here are applied to a transmon-based computer, many of them are portable to other architectures.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2001

HZETRN: neutron and proton production in quasi-elastic scattering of GCR heavy-ions

The development of transport models for radiation shielding design and evaluation has provided a series of deterministic computer codes that describe galactic cosmic radiation (GCR), solar particle events, and experimental beams at particle accelerators. These codes continue to be modified to accommodate new theory and improvements to the particle interaction database (Cucinotta et al., 1994, NASA Technical Paper 3472, US Government Printing Office, Washington DC). The solution employed by the heavy-ion transport code HZETRN was derived with the assumption that nuclear fragments are emitted with the same velocity as the incident ion through velocity conserving nuclear interactions. This paper presents a version of the HZETRN transport code that provides a more realistic distribution of the energy of protons and neutrons emitted from GCR interactions in shields. This study shows that the expected GCR dose equivalent is lower than previously calculated for water shields that are less than 110 g cm-2 thick. Calculations of neutron energy spectra in low Earth orbit indicate substantial contributions from relativistic neutrons. c2001 Elsevier Science Ltd. All rights reseved.

NASA Center LaRC↗
DOE OSTI2025

Introduction: Neuromorphic Materials

The explosive growth in data collection and the need to process it efficiently, as well as the desire to automate increasingly complex tasks in transportation, medical care, manufacturing, security and many other fields have motivated a growing interest in neuromorphic computing. Unlike the binary, transistorbased ON/OFF logic gates and separate logic and memory functionalities employed in digital computing, neuromorphic computing is inspired by animal brains that use interconnected synapses and neurons to perform processing, storage and transmission of information at the same location, while only consuming ~20 W or less of power. Motivated by the brain’s efficiency, adaptability, self-learning and resiliency qualities, neuromorphic computing can be broadly defined as an approach to processing and storing information using hardware and algorithms inspired by models of biological neural systems. Present research in neuromorphic computing encompasses approaches that vary significantly in their degree of neuro-inspiration, from systems that only incorporate features such as asynchronous, event-driven operation or use crossbar arrays of non-volatile memory (NVM) elements to accelerate deep neural networks (DNNs), to designs that embrace the extreme parallelism, sparsity, reconfigurability, adaptability, complexity and stochasticity observed in nervous systems. The term ‘neuromorphic’ computing is often credited to Carver Mead, who in the 1980s investigated Si-based analog electronics to replicate functions of the animal retina. Earlier important advances in this field include the work of Frank Rosenblatt, who proposed the concept of the perceptron, Bernard Widrow, who used this concept to build one of the first analog neural networks, the Adaline and many other researchers (see ref. 6 for an historical perspective on neuromorphic computing). With the recent increase in the use of artificial intelligence and large language models, and rising concerns over the associated energy costs, interest in neuromorphic hardware has expanded rapidly. According to some estimates, driven largely by the drastic growth in the training use of artificial intelligence (AI) models using the current computing architectures, the energy cost of computing is projected to reach the energy supply worldwide by 2045. Furthermore, while this is not a realistic outcome, it means that, if more efficient computing technologies are not developed -- soon -- the world will soon become one where demand for energy and market constraints limit the continued increase of societal access to AI and cloud services from data centers. Data centers used for training and use of these models consume hundreds of terawatt hours of electricity, already past 4% of the US electricity demand.

Circuits↗
DOE OSTI2022

A Framework for Neural Network Inference on FPGA-Centric SmartNICs

FPGA-based SmartNICs offer great potential to significantly improve the performance of high-performance computing and warehouse data processing by tightly coupling support for reconfigurable data-intensive computation with cross-node communication, thereby mitigating the von Neumann bottleneck. Existing work, however, has been generally been limited in that it assumes an accelerator model where kernels are offloaded to SmartNICs, but most control tasks are left to the CPUs. This leads to frequent waiting, inferior performance, and scaling challenges. In this work, we propose a new distributive data-centric computing framework, named FCsN, for reconfigurable SmartNIC-based systems. Through a lightweight task circulation execution model and its implementation architecture, FCsN allows the complete detaching of kernel execution, control logic, system scheduling, and network communication to the SmarNICs. This boosts performance by: (i) avoiding the control dependency with CPUs and (ii) supporting streaming kernel execution and network communication at line rate and in a very fine-grained manner. We demonstrate the efficiency and flexibility of FCsN using various types of neural network applications including graph neural networks; as these last are both irregular and data intensive they offer an especially robust demonstration. Evaluations using commonly-used neural network models and graph datasets show that a system with the support of FCsN can achieve, on average, 144 speedups over the MPI-based standard CPU baselines.

Guo, Anqi↗
NASA NTRS1997

RNS Applications for Interacting Sub- and Supersonic Flows

A solution based grid adaptation method that combines elements of the multigrid method for solution acceleration and the domain decomposition philosophy for grid optimization is described. Unlike other solution based adaptive gridding schemes, wherein the overhead of recomputing the grid and re-evaluating the solution on the adapted grid leads to higher computational costs compared to a non-adapted calculation, the present methodology reduces the computational time required to obtain the solution. The computational effort involved in the present calculation is significantly lower than a non-adapted calculation that utilizes the multigrid method purely as a convergence acceleration tool. In addition to convergence acceleration, the multigrid framework provides a mechanism of information transfer from regions wherein grid refinement is specified to unrefined coarse grid regions. The basis for domain decomposition in the current procedure is the variation in grid refinement requirements for each coordinate direction in different portions of the flow field. The method is demonstrated herein on an efficient set of governing equations termed the reduced Navier Stokes equations, applied in conjunction with a set of physical boundary conditions. The governing equations are discretized through a pressure based flux splitting procedure that is uniformly applicable from incompressible to supersonic Mach numbers.

Rubin, Stanley G.↗
DOE OSTI2023

Optimizing Communication in 2D Grid-Based MPI Applications at Exascale

The new reality of exascale computing faces many challenges in achieving optimal performance on large numbers of nodes. A key challenge is the efficient utilization of the message-passing interface (MPI), a critical component for process communication. This paper explores communication optimization strategies to harness the GPU-accelerated architectures of these supercomputers. We focus on MPI applications where processors form a two-dimensional process grid, a common arrangement in applications involving dense matrix operations. This configuration offers a unique opportunity to implement innovative strategies to improve performance and maintain effective load distribution. We study two applications— Dist-FW (Apsp:all-pair-shortest-path) and HPL-MxP (LU factorization with Mixed precision)—on two accelerated systems: Summit (IBM Power and NVIDIA V100) and Frontier (AMD EPYC and MI250X). These supercomputers are operated by the Oak Ridge Leadership Computing Facility (OLCF) and are currently ranked #1 and #5 on the Top500 list. We show how to scale up both applications to exascale levels and tackle the MPI challenges related to implementation, synchronization, and performance. We also compare the performance of several communication strategies at an unprecedented scale. Accurately predicting application performance becomes crucial for cost reduction as the computational scale grows. To address this, we suggest a hyperbolic model as a better alternative to the traditional one-sided asymptotic model for predicting future application performance at such large scales.

Lu, Hao↗
NASA NTRS1983

Accommodation of practical constraints by a linear programming jet select

An experimental spacecraft control system will be incorporated into the Space Shuttle flight software and exercised during a forthcoming mission to evaluate its performance and handling qualities. The control system incorporates a 'phase space' control law to generate rate change requests and a linear programming jet select to compute jet firings. Posed as a linear programming problem, jet selection must represent the rate change request as a linear combination of jet acceleration vectors where the coefficients are the jet firing times, while minimizing the fuel expended in satisfying that request. This problem is solved in real time using a revised Simplex algorithm. In order to implement the jet selection algorithm in the Shuttle flight control computer, it was modified to accommodate certain practical features of the Shuttle such as limited computer throughput, lengthy firing times, and a large number of control jets. To the authors' knowledge, this is the first such application of linear programming. It was made possible by careful consideration of the jet selection problem in terms of the properties of linear programming and the Simplex algorithm. These modifications to the jet select algorithm may by useful for the design of reaction controlled spacecraft.

Bergmann, E.↗
DOE OSTI2023

BitGNN: Unlocking the Performance Potential of Binary Graph Neural Networks on GPUs

Graph Neural Networks (GNNs) have shown compelling results in many graph-based learning tasks. They are, however, time-consuming. Recent work has shown a promising direction in improving GNN speed and shrinking the size — network binarization, which binarizes network values and operations. Prior work, however, mainly focused on algorithm designs, leaving it open on how to fully materialize the performance potential. This work fills the gap by proposing techniques to best map binary GNNs and their computations to fit the nature of bit manipulations, optimizations and algorithms to maximize BSpMM kernel efficiency, and solutions to other factors influencing the end-to-end time on GPUs. Results on real-world graphs show that the proposed techniques outperform state of-the-art binary GNN implementations by 21-67× with little accuracy loss.

Chen, Jou-An↗
DOE OSTI2022

DUNE Software and High Performance Computing

DUNE, like other HEP experiments, faces a challenge related to matching execution patterns of our production simulation and data processing software to the limitations imposed by modern high-performance computing facilities. In order to efficiently exploit these new architectures, particularly those with high CPU core counts and GPU accelerators, our existing software execution models require adaptation. In addition, the large size of individual units of raw data from the far detector modules pose an additional challenge somewhat unique to DUNE. Here we describe some of these problems and how we begin to solve them today with existing software frameworks and toolkits. We also describe ways we may leverage these existing software architectures to attack remaining problems going forward. This whitepaper is a contribution to the Computational Frontier of Snowmass21.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Attractive Noncovalent Interactions versus Steric Confinement in Asymmetric Supramolecular Catalysis

The remarkable catalytic performance of enzymes stems from their ability to engage in precise noncovalent interactions (NCIs) within a sterically confined space. Supramolecular catalysis seeks to emulate and understand these strategies through the rational design of simple and controlled catalyst microenvironments. While both steric confinement and attractive interactions have been invoked as key to host activity, their relative contribution to rate enhancement and selectivity, as well as potential trade-offs, remains an outstanding question. Here, we address this question by systematically comparing two metal–organic supramolecular catalysts, which differ in the strength of their attractive noncovalent interactions and in their cavity volume. Our findings reveal that the catalyst with the larger cavity, and with stronger available NCIs, exhibits both significant rate acceleration (100-fold) and enhanced enantioselectivity (84% vs 14% ee) in a model ketone reduction compared to its smaller analogue. Mechanistic analysis, binding competition experiments, and computational modeling indicate that these differences predominantly stem from stabilizing noncovalent interactions in the larger catalyst, a result that challenges existing steric-based models of supramolecular stereoinduction. Understanding the governing factors of asymmetric induction and rate acceleration in supramolecular hosts will undoubtedly inform future catalyst design.

Catalysts↗