Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “space 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 145 records · Page 8

A non-local computational boundary condition for duct acoustics

A non-local boundary condition is formulated for acoustic waves in ducts without flow. The ducts are two dimensional with constant area, but with variable impedance wall lining. Extension of the formulation to three dimensional and variable area ducts is straightforward in principle, but requires significantly more computation. The boundary condition simulates a nonreflecting wave field in an infinite duct. It is implemented by a constant matrix operator which is applied at the boundary of the computational domain. An efficient computational solution scheme is developed which allows calculations for high frequencies and long duct lengths. This computational solution utilizes the boundary condition to limit the computational space while preserving the radiation boundary condition. The boundary condition is tested for several sources. It is demonstrated that the boundary condition can be applied close to the sound sources, rendering the computational domain small. Computational solutions with the new non-local boundary condition are shown to be consistent with the known solutions for nonreflecting wavefields in an infinite uniform duct.

Zorumski, William E.↗

Low-Cost Space Hardware and Software

The goal of this project is to demonstrate and support the overall vision of NASA's Rocket University (RocketU) through the design of an electrical power system (EPS) monitor for implementation on RUBICS (Rocket University Broad Initiatives CubeSat), through the support for the CHREC (Center for High-Performance Reconfigurable Computing) Space Processor, and through FPGA (Field Programmable Gate Array) design. RocketU will continue to provide low-cost innovations even with continuous cuts to the budget.

hardware↗

Computational study of three dimensional viscous flow through a turbine cascade using a multi-domain spectral technique

The three dimensional viscous flow through a planar turbine cascade is numerically simulated by direct solution of the incompressible Navier-Stokes equations. Flow dependence in the spanwise direction is represented by direct expansion in Chebyshev polynomials, while the discretization on planes parallel to the endwalls is accomplished using the spectral element method. Elemental mapping from the physical to the computational space uses an algebraic mapping technique. A fractional time stepping method that consists of an explicit nonlinear convective step, an implicit pressure correction step, and an implicit viscous step is used to advance the Navier-Stokes equations forward in time. Results computed at moderate Reynolds numbers show a three dimensional endwall flow separation, a midspan separation of the blade suction surface boundary layer, and other three-dimensional features such as the presence of a saddle point flow in the endwall region. In addition, the computed skin friction lines are shown to be orthogonal to the surface vorticity lines, demonstrating the accuracy achievable in the present method.

Renaud, Earl W.↗

Periodic Time-Domain Nonlocal Nonreflecting Boundary Conditions for Duct Acoustics

Periodic time-domain boundary conditions are formulated for direct numerical simulation of acoustic waves in ducts without flow. Well-developed frequency-domain boundary conditions are transformed into the time domain. The formulation is presented here in one space dimension and time; however, this formulation has an advantage in that its extension to variable-area, higher dimensional, and acoustically treated ducts is rigorous and straightforward. The boundary condition simulates a nonreflecting wave field in an infinite uniform duct and is implemented by impulse-response operators that are applied at the boundary of the computational domain. These operators are generated by convolution integrals of the corresponding frequency-domain operators. The acoustic solution is obtained by advancing the Euler equations to a periodic state with the MacCormack scheme. The MacCormack scheme utilizes the boundary condition to limit the computational space and preserve the radiation boundary condition. The success of the boundary condition is attributed to the fact that it is nonreflecting to periodic acoustic waves. In addition, transient waves can pass rapidly out of the solution domain. The boundary condition is tested for a pure tone and a multitone source in a linear setting. The effects of various initial conditions are assessed. Computational solutions with the boundary condition are consistent with the known solutions for nonreflecting wave fields in an infinite uniform duct.

Watson, Willie R.↗

Rigorous justification for the space–split sensitivity algorithm to compute linear response in Anosov systems

Ruelle gave a formula for linear response of transitive Anosov diffeomorphisms. Recently, practically computable realizations of Ruelle's formula have emerged that potentially enable sensitivity analysis of certain high-dimensional chaotic numerical simulations encountered in the applied sciences. In this paper, we provide full mathematical justification for the convergence of one such efficient computation, the space–split sensitivity, or S3, algorithm. In S3, Ruelle's formula is computed as a sum of two terms obtained by decomposing the perturbation vector field into a coboundary and a remainder that is parallel to the unstable direction. Such a decomposition results in a splitting of Ruelle's formula that is amenable to efficient computation. Here, we prove the existence of the S3 decomposition and the convergence of the computations of both resulting components of Ruelle's formula.

97 MATHEMATICS AND COMPUTING↗

Influence of nonconservative differencing on transonic streamline shapes

A computer program recently developed by South and Brandt (1976) which contained the Murman (1973) conservative finite-difference scheme is easily modified to use the Garabedian and Korn (1971) nonconservative finite difference scheme. This program solves the transonic small disturbance equation for only symmetric flow, but incorporates several iterative solution techniques. Results are presented for the case where the equally spaced computational grid extended to infinity in both the streamwise and normal directions. Streamline shapes are obtained along several grid lines by a streamwise integration of the normal component of the perturbation velocity. Comparison cases are run for a 10% thick parabolic arc airfoil at zero incidence for freestream Mach numbers of 0, 0.70, 0.84, and 0.95. It is shown that the use of a nonconservative finite-difference scheme in transonic flow calculations destroys the global mass balance when shocks are present. This lack of mass balance may prove to be more crucial in the case of an unconfined external flow.

Newman, P. A.↗

ATHENA: Analytical Tool for Heterogeneous Neuromorphic Architectures

The ASC program seeks to use machine learning to improve efficiencies in its stockpile stewardship mission. Moreover, there is a growing market for technologies dedicated to accelerating AI workloads. Many of these emerging architectures promise to provide savings in energy efficiency, area, and latency when compared to traditional CPUs for these types of applications — neuromorphic analog and digital technologies provide both low-power and configurable acceleration of challenging artificial intelligence (AI) algorithms. If designed into a heterogeneous system with other accelerators and conventional compute nodes, these technologies have the potential to augment the capabilities of traditional High Performance Computing (HPC) platforms [5]. This expanded computation space requires not only a new approach to physics simulation, but the ability to evaluate and analyze next-generation architectures specialized for AI/ML workloads in both traditional HPC and embedded ND applications. Developing this capability will enable ASC to understand how this hardware performs in both HPC and ND environments, improve our ability to port our applications, guide the development of computing hardware, and inform vendor interactions, leading them toward solutions that address ASC’s unique requirements.

97 MATHEMATICS AND COMPUTING↗

Space Station Simulation Computer System (SCS) study for NASA/MSFC. Operations concept report

NASA's Space Station Freedom Program (SSFP) planning efforts have identified a need for a payload training simulator system to serve as both a training facility and as a demonstrator to validate operational concepts. The envisioned MSFC Payload Training Complex (PTC) required to meet this need will train the Space Station payload scientists, station scientists, and ground controllers to operate the wide variety of experiments that will be onboard the Space Station Freedom. The Simulation Computer System (SCS) is made up of computer hardware, software, and workstations that will support the Payload Training Complex at MSFC. The purpose of this SCS Study is to investigate issues related to the SCS, alternative requirements, simulator approaches, and state-of-the-art technologies to develop candidate concepts and designs.

Source record↗

Space Station Simulation Computer System (SCS) study for NASA/MSFC. Phased development plan

NASA's Space Station Freedom Program (SSFP) planning efforts have identified a need for a payload training simulator system to serve as both a training facility and as a demonstrator to validate operational concepts. The envisioned MSFC Payload Training Complex (PTC) required to meet this need will train the Space Station payload scientists, station scientists and ground controllers to operate the wide variety of experiments that will be onboard the Space Station Freedom. The Simulation Computer System (SCS) is made up of computer hardware, software, and workstations that will support the Payload Training Complex at MSFC. The purpose of this SCS Study is to investigate issues related to the SCS, alternative requirements, simulator approaches, and state-of-the-art technologies to develop candidate concepts and designs.

Source record↗

Interactive algebraic grid-generation technique

An algebraic grid generation technique and use of an associated interactive computer program are described. The technique, called the two boundary technique, is based on Hermite cubic interpolation between two fixed, nonintersecting boundaries. The boundaries are referred to as the bottom and top, and they are defined by two ordered sets of points. Left and right side boundaries which intersect the bottom and top boundaries may also be specified by two ordered sets of points. when side boundaries are specified, linear blending functions are used to conform interior interpolation to the side boundaries. Spacing between physical grid coordinates is determined as a function of boundary data and uniformly space computational coordinates. Control functions relating computational coordinates to parametric intermediate variables that affect the distance between grid points are embedded in the interpolation formulas. A versatile control function technique with smooth-cubic-spline functions is presented. The technique works best in an interactive graphics environment where computational displays and user responses are quickly exchanged. An interactive computer program based on the technique and called TBGG (two boundary grid generation) is also described.

Smith, R. E.↗

Numerical prediction of the unsteady flowfield around the F-18 aircraft at large incidence

This paper describes a numerical method capable of solving the steady and unsteady viscous flow around complete aircraft configurations at high angles of attack. This method is used to simulate the external flow around the F-18 aircraft, including deflected control surfaces. The current technique employs a generalized overset zonal grid scheme to decompose the computational space around the aircraft. The grid around various components of the aircraft are created numerically using a three-dimensional hyperbolic grid generation procedure. The Reynolds-averaged Navier-Stokes equations are integrated using a time-accurate, implicit procedure. Results for the turbulent flow around the F-18 aircraft at 30 degrees angle of attack show the details of the flowfield structure, including the unsteadiness created by the vortex burst and the resulting fluctuating airloads exerted on the vertical tail. The computed results agree fairly well with flight data for surface pressure, surface flow pattern, vortex burst location, and the dominant frequency for tail load fluctuations.

Rizk, Yehia M.↗

Path planning for assembly of strut-based structures

A path planning method with collision avoidance for a general single chain nonredundant or redundant robot is proposed. Joint range boundary overruns are also avoided. The result is a sequence of joint vectors which are passed to a trajectory planner. A potential field algorithm in joint space computes incremental joint vectors delta-q = delta-q(sub a) + delta-q(sub c) + delta-q(sub r). Adding delta-q to the robot's current joint vector leads to the next step in the path. Delta-q(sub a) is obtained by computing the minimum norm solution of the underdetermined linear system J delta-q(sub a) = x(sub a) where x(sub a) is a translational and rotational force vector that attracts the robot to its goal position and orientation. J is the manipulator Jacobian. Delta-q(sub c) is a collision avoidance term encompassing collisions between the robot (links and payload) and obstacles in the environment as well as collisions among links and payload of the robot themselves. It is obtained in joint space directly. Delta-q(sub r) is a function of the current joint vector and avoids joint range overruns. A higher level discrete search over candidate safe positions is used to provide alternatives in case the potential field algorithm encounters a local minimum and thus fails to reach the goal. The best first search algorithm A* is used for graph search. Symmetry properties of the payload and equivalent rotations are exploited to further enlarge the number of alternatives passed to the potential field algorithm.

Muenger, Rolf↗