Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational graph”

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 91 records · Page 5

Transonic airfoil calculations including wind tunnel wall-interference effects

The results of Reynolds-averaged time-dependent inviscid and turbulent compressible Navier-Stokes computations using the implicit finite-difference approach of Steger (1978), modified by incorporating a pressure boundary condition, (PBC) to account for wall interference are compared with experimental data on a NACA 64A010 airfoil (Johnson and Bachalo, 1980) in graphs and briefly characterized. The computational approach is the same as that used by King and Johnson (1980), but a 137 x 50 mesh is used instead of a 97 x 35 mesh, and special care is taken in resolving the nose, shock, and trailing-edge regions. Imposition of PBC is shown to improve significantly the accuracy of the computations for the flowfield on the upper surface of the airfoil, shifting the shock forward to its experimentally measured position in the case of turbulent flow. The failure of the method, even with PBC, to match the experimental shock location in the case of a flow with a separation bubble is attributed to inadequacies in the algebraic turbulence model employed (Baldwin and Lomax, 1978).

King, L. S.↗

Pulse Detonation Engine Modeled

Pulse Detonation Engine Technology is currently being investigated at Glenn for both airbreathing and rocket propulsion applications. The potential for both mechanical simplicity and high efficiency due to the inherent near-constant-volume combustion process, may make Pulse Detonation Engines (PDE's) well suited for a number of mission profiles. Assessment of PDE cycles requires a simulation capability that is both fast and accurate. It should capture the essential physics of the system, yet run at speeds that allow parametric analysis. A quasi-one-dimensional, computational-fluid-dynamics-based simulation has been developed that may meet these requirements. The Euler equations of mass, momentum, and energy have been used along with a single reactive species transport equation, and submodels to account for dominant loss mechanisms (e.g., viscous losses, heat transfer, and valving) to successfully simulate PDE cycles. A high-resolution numerical integration scheme was chosen to capture the discontinuities associated with detonation, and robust boundary condition procedures were incorporated to accommodate flow reversals that may arise during a given cycle. The accompanying graphs compare experimentally measured and computed performance over a range of operating conditions for a particular PDE. Experimental data were supplied by Fred Schauer and Jeff Stutrud from the Air Force Research Laboratory at Wright-Patterson AFB and by Royce Bradley from Innovative Scientific Solutions, Inc. The left graph shows thrust and specific impulse, Isp, as functions of equivalence ratio for a PDE cycle in which the tube is completely filled with a detonable hydrogen/air mixture. The right graph shows thrust and specific impulse as functions of the fraction of the tube that is filled with a stoichiometric mixture of hydrogen and air. For both figures, the operating frequency was 16 Hz. The agreement between measured and computed values is quite good, both in terms of trend and magnitude. The error is under 10 percent everywhere except for the thrust value at an equivalence ratio of 0.8 in the left figure, where it is 14 percent. The simulation results shown were made using 200 numerical cells. Each cycle of the engine, approximately 0.06 sec, required 2.0 min of CPU time on a Sun Ultra2. The simulation is currently being used to analyze existing experiments, design new experiments, and predict performance in propulsion concepts where the PDE is a component (e.g., hybrid engines and combined cycles).

Paxson, Daniel E.↗

A study of the Nordsieck-type predictor-corrector methods

Predictor-corrector schemes are discussed for the numerical integration of initial value problems by computer. Descloux formulas, which are considered modified Nordsieck formulas are studied because of their desirable stability and truncation properties along with the standard Nordsieck formulas. The stability of Nordsieck and modified Nordsieck algorithms are computed, and the results are graphed. Test problems are included as examples for comparing the efficiency of the algorithms.

Eiserike, H. M.↗

Application of numerical methods to extend capabilities for optimal rocket guidance: report on reentry guidance of shuttle orbiter

Analytical models are presented for optimal trajectories and reentry guidance of the space shuttle orbiter. Major emphasis is placed on the development of a "footprint', which refers to a set of reachable destination positions attainable by the shuttle at a specified terminal altitude. An unconstrained reentry footprint was calculated for a shuttle vehicle which enters the earth's atmosphere at 93 km initial altitude after a deboost from a near earth orbit. The method of computation is briefly described, and graphs are presented which illustrate the footprint and the variation of state and control variables along it. The effects of constraints and of variations in initial state upon the footprint are discussed.

Source record↗

Modeling of multi-rotor torsional vibrations in rotating machinery using substructuring

The application of FEM modeling techniques to the analysis of torsional vibrations in complex rotating systems is described and demonstrated, summarizing results reported by Soares (1985). A substructuring approach is used for determination of torsional natural frequencies and resonant-mode shapes, steady-state frequency-sweep analysis, identification of dynamically unstable speed ranges, and characterization of transient linear and nonlinear systems. Results for several sample problems are presented in diagrams, graphs, and tables. STORV, a computer code based on this approach, is in use as a preliminary design tool for drive-train torsional analysis in the High Altitude Wind Tunnel at NASA Lewis.

Soares, Fola R.↗

A model for the distribution of dark matter, galaxies, and the intergalactic medium in a cold dark matter-dominated universe

The spatial distribution of the cold-dark-matter (CDM) and baryonic components of CDM-dominated cosmological models are characterized, summarizing the results of recent theoretical investigations. The evolution and distribution of matter in an Einstein-de Sitter universe on length scales small enough so that the Newtonian approximation is valid is followed chronologically, assuming (1) that the galaxies, CDM, and the intergalactic medium (IGM) are coupled by gravity, (2) that galaxies form by taking mass and momentum from the IGM, and (3) that the IGM responds to the energy input from the galaxies. The results of the numerical computations are presented in extensive graphs and discussed in detail.

Ryu, Dongsu↗

Atmospheric absorption of sound - Update

Best current expressions for the vibrational relaxation times of oxygen and nitrogen in the atmosphere are used to compute total absorption. The resulting graphs of total absorption as a function of frequency for different humidities should be used in lieu of the graph published earlier by Evans et al (1972).

Bass, H. E.↗

Aspects of unstructured grids and finite-volume solvers for the Euler and Navier-Stokes equations

Basic algorithms for unstructured mesh generation and fluid flow calculation are discussed. In particular the following are addressed: preliminaries of graphs and meshes; duality and data structures; basic graph operations important in CFD (Computational Fluid Dynamics); triangulation methods, including Varonoi diagrams and Delaunay triangulation; maximum principle analysis; finite volume schemes for scalar conservation law equations; finite volume schemes for the Euler and Navier-Stokes equations; and convergence acceleration for steady state calculations.

Barth, T. J.↗

Process and representation in graphical displays

Our initial model of graphic comprehension has focused on statistical graphs. Like other models of human-computer interaction, models of graphical comprehension can be used by human-computer interface designers and developers to create interfaces that present information in an efficient and usable manner. Our investigation of graph comprehension addresses two primary questions: how do people represent the information contained in a data graph?; and how do they process information from the graph? The topics of focus for graphic representation concern the features into which people decompose a graph and the representations of the graph in memory. The issue of processing can be further analyzed as two questions: what overall processing strategies do people use?; and what are the specific processing skills required?

Gillan, Douglas J.↗

Advanced Crew Personal Support Computer (CPSC) task

The topics are presented in view graph form and include: background; objectives of task; benefits to the Space Station Freedom (SSF) Program; technical approach; baseline integration; and growth and evolution options. The objective is to: (1) introduce new computer technology into the SSF Program; (2) augment core computer capabilities to meet additional mission requirements; (3) minimize risk in upgrading technology; and (4) provide a low cost way to enhance crew and ground operations support.

Muratore, Debra↗

Maximum likelihood estimation for distributed parameter models of flexible spacecraft

A distributed-parameter model of the NASA Solar Array Flight Experiment spacecraft structure is constructed on the basis of measurement data and analyzed to generate a priori estimates of modal frequencies and mode shapes. A Newton-Raphson maximum-likelihood algorithm is applied to determine the unknown parameters, using a truncated model for the estimation and the full model for the computation of the higher modes. Numerical results are presented in a series of graphs and briefly discussed, and the significant improvement in computation speed obtained by parallel implementation of the method on a supercomputer is noted.

Taylor, L. W., Jr.↗

Geoid undulation computations at laser tracking stations

The accuracy of numerical computations of gravimetric undulations using recently proposed modifications of the classical Stokes formula is investigated. The basic formulations of the methods are outlined, and results from trial computations are presented in tables and graphs and compared with actual gravity data and/or GEOS-3/Seasat sea-surface heights. Although all of the methods gave similar results, the method of Sjoberg (1986) is recommended because of its superior theoretical precision. The importance of including terrain-corrected free-air anomalies in the computations is indicated.

Despotakis, Vasilios K.↗

Reliability models for dataflow computer systems

The demands for concurrent operation within a computer system and the representation of parallelism in programming languages have yielded a new form of program representation known as data flow (DENN 74, DENN 75, TREL 82a). A new model based on data flow principles for parallel computations and parallel computer systems is presented. Necessary conditions for liveness and deadlock freeness in data flow graphs are derived. The data flow graph is used as a model to represent asynchronous concurrent computer architectures including data flow computers.

Kavi, K. M.↗

Experience with parametric binary dissection

Parametric Binary Dissection (PBD) is a new algorithm that can be used for partitioning graphs embedded in 2- or 3-dimensional space. It partitions explicitly on the basis of nodes + (lambda)x(edges cut), where lambda is the ratio of time to communicate over an edge to the time to compute at a node. The new algorithm is faster than the original binary dissection algorithm and attempts to obtain better partitions than the older algorithm, which only takes nodes into account. The performance of parametric dissection with plain binary dissection on 3 large unstructured 3-d meshes obtained from computational fluid dynamics and on 2 random graphs were compared. It was showm that the new algorithm can usually yield partitions that are substantially superior, but that its performance is heavily dependent on the input data.

Bokhari, Shahid H.↗

Graphical User Interface Development for Representing Air Flow Patterns

In the Turbine Branch, scientists carry out experimental and computational work to advance the efficiency and diminish the noise production of jet engine turbines. One way to do this is by decreasing the heat that the turbine blades receive. Most of the experimental work is carried out by taking a single turbine blade and analyzing the air flow patterns around it, because this data indicates the sections of the turbine blade that are getting too hot. Since the cost of doing turbine blade air flow experiments is very high, researchers try to do computational work that fits the experimental data. The goal of computational fluid dynamics is for scientists to find a numerical way to predict the complex flow patterns around different turbine blades without physically having to perform tests or costly experiments. When visualizing flow patterns, scientists need a way to represent the flow conditions around a turbine blade. A researcher will assign specific zones that surround the turbine blade. In a two-dimensional view, the zones are usually quadrilaterals. The next step is to assign boundary conditions which define how the flow enters or exits one side of a zone. way of setting up computational zones and grids, visualizing flow patterns, and storing all the flow conditions in a file on the computer for future computation. Such a program is necessary because the only method for creating flow pattern graphs is by hand, which is tedious and time-consuming. By using a computer program to create the zones and grids, the graph would be faster to make and easier to edit. Basically, the user would run a program that is an editable graph. The user could click and drag with the mouse to form various zones and grids, then edit the locations of these grids, add flow and boundary conditions, and finally save the graph for future use and analysis. My goal this summer is to create a graphical user interface (GUI) that incorporates all of these elements. I am writing the program in Java, a language that is portable among platforms, because it can run on different operating systems such as Windows and Unix without having to be rewritten. I had no prior experience of programming in Java at the start of my internship; I am continuously learning as I create the program. I have written the part of the program that enables a user to draw several zones, edit them, and store their locations. The next phase of my project is to allow the user to click on the side of a zone and create a boundary condition for it. A previous intern wrote a program that allows the user to input boundary conditions. I can integrate the two programs to create a larger, more usable program. After that, I will develop a way for the user to save the graph for future reference. Another eventual goal is to make the GUI capable of creating three-dimensional zones as well. Researchers such as my mentor, Dr. David Ashpis, need a quick, user-friendly

Chaudhary, Nilika↗

Solar radiation measurement project

The Xavier solar radiation measurement project and station are described. Measurements of the total solar radiation on a horizontal surface from an Eppley pyranometer were collected into computer data files. Total radiation in watt hours was converted from ten minute intervals to hourly intervals. Graphs of this total radiation data are included. A computer program in Fortran was written to calculate the total extraterrestrial radiation on a horizontal surface for each day of the month. Educational and social benefits of the project are cited.

Ioup, J. W.↗