Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “accelerated computing”

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 901 records · Page 50

Turbulence Model Behavior in Low Reynolds Number Regions of Aerodynamic Flowfields

The behaviors of the widely-used Spalart-Allmaras (SA) and Menter shear-stress transport (SST) turbulence models at low Reynolds numbers and under conditions conducive to relaminarization are documented. The flows used in the investigation include 2-D zero pressure gradient flow over a flat plate from subsonic to hypersonic Mach numbers, 2-D airfoil flow from subsonic to supersonic Mach numbers, 2-D subsonic sink-flow, and 3-D subsonic flow over an infinite swept wing (particularly its leading-edge region). Both models exhibit a range over which they behave 'transitionally' in the sense that the flow is neither laminar nor fully turbulent, but these behaviors are different: the SST model typically has a well-defined transition location, whereas the SA model does not. Both models are predisposed to delayed activation of turbulence with increasing freestream Mach number. Also, both models can be made to achieve earlier activation of turbulence by increasing their freestream levels, but too high a level can disturb the turbulent solution behavior. The technique of maintaining freestream levels of turbulence without decay in the SST model, introduced elsewhere, is shown here to be useful in reducing grid-dependence of the model's transitional behavior. Both models are demonstrated to be incapable of predicting relaminarization; eddy viscosities remain weakly turbulent in accelerating or laterally-strained boundary layers for which experiment and direct simulations indicate turbulence suppression. The main conclusion is that these models are intended for fully turbulent high Reynolds number computations, and using them for transitional (e.g., low Reynolds number) or relaminarizing flows is not appropriate.

Rumsey, Christopher L.↗

Computed Tomography Inspection and Analysis for Additive Manufacturing Components

Computed tomography (CT) inspection was performed on test articles additively manufactured from metallic materials. Metallic AM and machined wrought alloy test articles with programmed flaws were inspected using a 2MeV linear accelerator based CT system. Performance of CT inspection on identically configured wrought and AM components and programmed flaws was assessed using standard image analysis techniques to determine the impact of additive manufacturing on inspectability of objects with complex geometries.

Beshears, Ronald D.↗

A Single Thread to Fortran Coarray Transition Process for the Control Algorithm in the Space Radiation Code HZETRN

Exa-scale computing is the direction by industry and government are going to generate solutions to problems they deem necessary. Computing hardware is being developed to achieve the transition from Peta-scale to Exa-scale with more CPUs (Central Processing Units) that have more cores per CPU and more accelerators (GPGPUs (General Purpose Graphics Processing Units) and MICs (Many Integrated Cores)) per node. To fully utilize the hardware available now and in the future, algorithms must become multi-threaded. There are a few methods to generate multi-threaded software such as MPI (Message Passing Interface) and OpenMP (Multi-Processing) / OpenACC (ACCelerator). This paper concentrates on using Coarray Fortran to convert the Fortran 95 based HZETRN (High Z and Energy TRaNsport) code's control algorithm from a single threaded code to a multithreaded code. The resultant Coarray code was 32.5 times faster (with a theoretical speed-up of 74.5 times) than the single threaded version on the hardware tested, as reliable as the Fortran 95 version, and, as it uses native Fortran, was as maintainable as the Fortran 95 version. The Coarray code can be maintained by the same project engineers and scientists who created the original single threaded code. This transition process can be utilized on a C language based code with a compiler that has the UPC (Universal Parallel C) extensions to C.

Singleterry, Robert C., Jr.↗

MONTE's Client-Based Trajectory Propagation Architecture

The Mission Analysis, Operations, and Navigation Toolkit Environment (MONTE) is JPL's (Jet Propulsion Laboratory's) signature astrodynamic computing platform. It supports all phases of space mission development, from early stage mission design and analysis through flight navigation services. MONTE employs a client-based trajectory propagation architecture where accelerations are calculated in the main MONTE library and the integrator exists on the periphery as a client. This paper outlines this approach to a trajectory propagation system and provides a concrete set of examples showing its utility.

Smith, Jonathan↗

Planetary-Induced Nutation of the Earth - Direct Terms

Small torques by the planets can alter the direction of the Earth's rotation axis in space. These direct planetary-induced nutations have been computed using a numerical technique. 55 nutation terms with periods between 0.2 and 243 yr are presented. The maximum nutation is 0.5 milliarcseconds. Also given are planetary-induced rates and accelerations of precession and obliquity.

Planetary-Induced↗

Seeing the forest for the trees: Networked workstations as a parallel processing computer

Unlike traditional 'serial' processing computers in which one central processing unit performs one instruction at a time, parallel processing computers contain several processing units, thereby, performing several instructions at once. Many of today's fastest supercomputers achieve their speed by employing thousands of processing elements working in parallel. Few institutions can afford these state-of-the-art parallel processors, but many already have the makings of a modest parallel processing system. Workstations on existing high-speed networks can be harnessed as nodes in a parallel processing environment, bringing the benefits of parallel processing to many. While such a system can not rival the industry's latest machines, many common tasks can be accelerated greatly by spreading the processing burden and exploiting idle network resources. We study several aspects of this approach, from algorithms to select nodes to speed gains in specific tasks. With ever-increasing volumes of astronomical data, it becomes all the more necessary to utilize our computing resources fully.

Breen, J. O.↗

Convergence acceleration for a three-dimensional Euler/Navier-Stokes zonal approach

A fast diagonal algorithm is coupled with a zonal approach to solve the three-dimensional Euler/Navier-Stokes equations. Transonic viscous solutions are obtained on a 150,000 point mesh for a NACA 0012 wing. The new computational approach yields a speedup by as much as a factor of 40 over the standard Beam-Warming algorithm/zonal method originally coded. A three-order-of-magnitude drop in the L2-norm of the residual requires approximately 500 iterations, which takes about 45 min of CPU time on a Cray-XMP. The numerically computed solutions are in good agreement with experimental results. Effects on convergence rate owing to increasing the zonal boundary overlap regions, different stretching distributions in the viscous regions, and different CFL values are also explored.

Flores, J.↗

Acceleration of convergence by shifting the spectrum of implicit finite difference operators associated with the equations of gas dynamics

Eigensystem analysis techniques are applied to finite difference formulations of the Navier-Stokes equations in one dimension. Spectra of the resulting implicit difference operators are computed. The largest eigenvalues are calculated by using a combination of the Frechet derivative of the operators and Arnoldi's method. The accuracy of Arnoldi's method is tested by comparing the rate of convergence of the iterative method with the dominant eigenvalue of the original iteration matrix. On the basis of the pattern of eigenvalue distributions for various flow configurations, a shifting of the implicit operators in question is devised. This procedure has improved the rates of convergence of CFD codes by 20 - 50 percent.

Cheer, A.↗

Accelerated Training for Large Feedforward Neural Networks

In this paper we introduce a new training algorithm, the scaled variable metric (SVM) method. Our approach attempts to increase the convergence rate of the modified variable metric method. It is also combined with the RBackprop algorithm, which computes the product of the matrix of second derivatives (Hessian) with an arbitrary vector. The RBackprop method allows us to avoid computationally expensive, direct line searches. In addition, it can be utilized in the new, 'predictive' updating technique of the inverse Hessian approximation. We have used directional slope testing to adjust the step size and found that this strategy works exceptionally well in conjunction with the Rbackprop algorithm. Some supplementary, but nevertheless important enhancements to the basic training scheme such as improved setting of a scaling factor for the variable metric update and computationally more efficient procedure for updating the inverse Hessian approximation are presented as well. We summarize by comparing the SVM method with four first- and second- order optimization algorithms including a very effective implementation of the Levenberg-Marquardt method. Our tests indicate promising computational speed gains of the new training technique, particularly for large feedforward networks, i.e., for problems where the training process may be the most laborious.

Stepniewski, Slawomir W.↗

Enhanced Graphics for Extended Scale Range

Enhanced Graphics for Extended Scale Range is a computer program for rendering fly-through views of scene models that include visible objects differing in size by large orders of magnitude. An example would be a scene showing a person in a park at night with the moon, stars, and galaxies in the background sky. Prior graphical computer programs exhibit arithmetic and other anomalies when rendering scenes containing objects that differ enormously in scale and distance from the viewer. The present program dynamically repartitions distance scales of objects in a scene during rendering to eliminate almost all such anomalies in a way compatible with implementation in other software and in hardware accelerators. By assigning depth ranges correspond ing to rendering precision requirements, either automatically or under program control, this program spaces out object scales to match the precision requirements of the rendering arithmetic. This action includes an intelligent partition of the depth buffer ranges to avoid known anomalies from this source. The program is written in C++, using OpenGL, GLUT, and GLUI standard libraries, and nVidia GEForce Vertex Shader extensions. The program has been shown to work on several computers running UNIX and Windows operating systems.

Hanson, Andrew J.↗

Transcriptomics Processing Pipelines for Space Biology: An Open Source and Consensus-Driven Approach

Transcriptomics holds significant value in elucidating the relationship between gene expression, experimental factors, biological factors, and various types of omics data. Enhancing our understanding of these connections is paramount for foundational biology, which plays a pivotal role in devising solutions for challenges pertinent to both space travel and terrestrial life. The NASA GeneLab project, part of the Open Science Data Repository (OSDR.nasa.gov), seeks to accelerate space biology research through cataloging and democratizing ‘omics data, including transcriptomics. Since raw omics data are largely inaccessible to non-bioinformaticians, GeneLab works with the scientific community via the Open Science Analysis Working Groups (AWGs) to develop standard processing pipelines to generate and publish processed data. Unlike raw data, processed data have greater immediate value to diverse users with varying technical backgrounds and computational capabilities. Standardizing processing workflows is essential to match the pace of raw data generation, ensure reproducibility, and enable standardized processed data for comparison across datasets. As of June 2023, transcriptomics studies comprise over half of GeneLab datasets hosted on the OSDR, including data from bulk RNA-seq and Affymetrix or Agilent 1-Channel DNA microarray assays. In collaboration with the AWGs, GeneLab developed consensus processing pipelines for these transcriptomics data types that includes quality control, background correction (microarray only), data normalization and quantification, culminating in the detection and annotation of differentially expressed genes. The work presented here describes Nextflow implementations of GeneLab’s consensus transcriptomics pipelines that automates and accelerates processing of these datasets. In addition to the core data processing, these workflows also include raw data staging and a robust verification and validation program to identify errors in real-time, stop additional downstream computation, and preserve computational resources. These workflows are used to generate GeneLab processed data hosted on the OSDR, and are publicly available as open source software for others to use at: https://github.com/nasa/GeneLab_Data_Processing.

Jonathan Oribello↗

Use of adaptive walls in 2D tests

A new method for computing the wall effects gives precise answers to some questions arising in adaptive wall concept applications: length of adapted regions, fairings with up and downstream regions, residual misadjustments effects, reference conditions. The acceleration of the iterative process convergence and the development of an efficient technology used in CERT T2 wind tunnels give in a single run the required test conditions. Samples taken from CAST 7 tests demonstrate the efficiency of the whole process to obtain significant results with considerations of tridimensional case extension.

Archambaud, J. P.↗

Solution of elliptic PDEs by fast Poisson solvers using a local relaxation factor

A large class of two- and three-dimensional, nonseparable elliptic partial differential equations (PDEs) is presently solved by means of novel one-step (D'Yakanov-Gunn) and two-step (accelerated one-step) iterative procedures, using a local, discrete Fourier analysis. In addition to being easily implemented and applicable to a variety of boundary conditions, these procedures are found to be computationally efficient on the basis of the results of numerical comparison with other established methods, which lack the present one's: (1) insensitivity to grid cell size and aspect ratio, and (2) ease of convergence rate estimation by means of the coefficient of the PDE being solved. The two-step procedure is numerically demonstrated to outperform the one-step procedure in the case of PDEs with variable coefficients.

Chang, Sin-Chung↗

Multigrid acceleration of the isenthalpic form of the compressible flow equations

A numerical method for solving the isenthalpic form of the governing equations for compressible inviscid flows was developed. The method is based on the concept of flux vector splitting in its implicit form and was tested on several demanding configurations. Time marching to steady state was accelerated by the implementation of the multigrid procedure which very effectively increased the rate of convergence. High quality steady-state results were obtained for various test cases and required only short computational times due to the relative efficiency of the basic method.

Melson, N. Duane↗

Multigrid acceleration of the isenthalpic form of the compressible flow equations

A numerical method for solving the isenthalpic form of the governing equations for compressible inviscid flows was developed. The method is based on the concept of flux vector splitting in its implicit form and was tested on several demanding configurations. Time marching to steady state was accelerated by the implementation of the multigrid procedure which very effectively increased the rate of convergence. High quality steady-state results were obtained for various test cases and required only short computational times due to the relative efficiency of the basic method.

Melson, N. Duane↗

Shielding from space radiations

Progress during the period of 1 Jun. - 1 Dec. 1991 is presented. An analytical solution to heavy ion transport equation in terms of Green's function formalism is developed. The mathematical development is recasted into efficient computer code for space applications. The efficiency of this algorithm is accomplished by a nonperturbative technique of extending the Green's function over the solution domain. The code is also applied to accelerator boundary conditions to allow code validation in laboratory experiments.

Chang, C. Ken↗

Use of non-spherical gravity harmonics for relative motion GN/C (category 2)

Detailed analysis of the Automatic Rendezvous and Capture problem indicate a need for three different regions of mathematical description for the GN&C algorithms: (1) multi-vehicle orbital mechanics to the rendezvous interface point, i.e., within 100 nm; (2) relative motion solutions (such as Clohessy-Wiltshire type) from the far-field to the near-field interface, i.e., within 1 nm and; (3) close proximity motion - the near-field motion where the relative differences in the gravitational and orbit inertial accelerations can be neglected from the equations of motion. Limit boundaries to these regions can be precisely defined by further analysis and will be functions of the tracking measurement accuracies and the computer resources available for the solution of the algorithms. This paper analyzes the relative motion in Regions 2 and 3 above and present the derivation and discussion of the general case of non-spherical gravitational perturbed relative motion. Mathematical deviations from the numerically integrated spherical gravity case and solutions from the Clohessy-Wiltshire equations are presented in the analysis. Based upon this preliminary analysis, it is recommended that further efforts be used to assess the relative position and velocity differences in Region 2 due to non-spherical gravity harmonics and that viable GN&C algorithms be developed to include these gravity perturbations (especially the effects of the first gravity harmonic, J2).

Henderson, David M.↗