Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 271 records · Page 15

New reflective symmetry design capability in the JPL-IDEAS Structure Optimization Program

The JPL-IDEAS antenna structure analysis and design optimization computer program was modified to process half structure models of symmetric structures subjected to arbitrary external static loads, synthesize the performance, and optimize the design of the full structure. Significant savings in computation time and cost (more than 50%) were achieved compared to the cost of full model computer runs. The addition of the new reflective symmetry analysis design capabilities to the IDEAS program allows processing of structure models whose size would otherwise prevent automated design optimization. The new program produced synthesized full model iterative design results identical to those of actual full model program executions at substantially reduced cost, time, and computer storage.

Strain, D.↗

A Parallel Compact Multi-Dimensional Numerical Algorithm with Aeroacoustics Applications

In this study we propose a novel method to parallelize high-order compact numerical algorithms for the solution of three-dimensional PDEs (Partial Differential Equations) in a space-time domain. For this numerical integration most of the computer time is spent in computation of spatial derivatives at each stage of the Runge-Kutta temporal update. The most efficient direct method to compute spatial derivatives on a serial computer is a version of Gaussian elimination for narrow linear banded systems known as the Thomas algorithm. In a straightforward pipelined implementation of the Thomas algorithm processors are idle due to the forward and backward recurrences of the Thomas algorithm. To utilize processors during this time, we propose to use them for either non-local data independent computations, solving lines in the next spatial direction, or local data-dependent computations by the Runge-Kutta method. To achieve this goal, control of processor communication and computations by a static schedule is adopted. Thus, our parallel code is driven by a communication and computation schedule instead of the usual "creative, programming" approach. The obtained parallelization speed-up of the novel algorithm is about twice as much as that for the standard pipelined algorithm and close to that for the explicit DRP algorithm.

Povitsky, Alex↗

KU-Band rendezvous radar performance computer simulation model

The preparation of a real time computer simulation model of the KU band rendezvous radar to be integrated into the shuttle mission simulator (SMS), the shuttle engineering simulator (SES), and the shuttle avionics integration laboratory (SAIL) simulator is described. To meet crew training requirements a radar tracking performance model, and a target modeling method were developed. The parent simulation/radar simulation interface requirements, and the method selected to model target scattering properties, including an application of this method to the SPAS spacecraft are described. The radar search and acquisition mode performance model and the radar track mode signal processor model are examined and analyzed. The angle, angle rate, range, and range rate tracking loops are also discussed.

Griffin, J. W.↗

A general method for calculating three-dimensional compressible laminar and turbulent boundary layers on arbitrary wings

The method described utilizes a nonorthogonal coordinate system for boundary-layer calculations. It includes a geometry program that represents the wing analytically, and a velocity program that computes the external velocity components from a given experimental pressure distribution when the external velocity distribution is not computed theoretically. The boundary layer method is general, however, and can also be used for an external velocity distribution computed theoretically. Several test cases were computed by this method and the results were checked with other numerical calculations and with experiments when available. A typical computation time (CPU) on an IBM 370/165 computer for one surface of a wing which roughly consist of 30 spanwise stations and 25 streamwise stations, with 30 points across the boundary layer is less than 30 seconds for an incompressible flow and a little more for a compressible flow.

Cebeci, T.↗

Matrix computations in MACSYMA

Facilities built into MACSYMA for manipulating matrices with numeric or symbolic entries are described. Computations will be done exactly, keeping symbols as symbols. Topics discussed include how to form a matrix and create other matrices by transforming existing matrices within MACSYMA; arithmetic and other computation with matrices; and user control of computational processes through the use of optional variables. Two algorithms designed for sparse matrices are given. The computing times of several different ways to compute the determinant of a matrix are compared.

Wang, P. S.↗

Preliminary study of the use of the STAR-100 computer for transonic flow calculations

A description is presented for a new explicit algorithm for solving the transonic small-disturbance potential equation on the STAR-100 computer. The STAR computer has a 'pipeline' type of processor which is very efficient in doing arithmetic operations on long vectors. Unfortunately, the successive line over-relaxation method, which represents the best method for solving the considered equation, is not suitable for vector-arithmetic procedures. The described algorithm, however, can be vectorized to make an employment of the STAR-100 possible. It is found that a use of the new algorithm for solving the equation on the STAR-100 computer can almost halve the computer time required for this type of computation when compared to successive line over-relaxation on the CYBER 175 computer.

Keller, J. D.↗

Boundary conditions for the solution of compressible Navier-Stokes equations by an implicit factored method

A method is presented for formulating the boundary conditions in implicit finite-difference form needed for obtaining solutions to the compressible Navier-Stokes equations by the Beam and Warming implicit factored method. The usefulness of the method was demonstrated (a) by establishing the boundary conditions applicable to the analysis of the flow inside an axisymmetric piston-cylinder configuration and (b) by calculating velocities and mass fractions inside the cylinder for different geometries and different operating conditions. Stability, selection of time step and grid sizes, and computer time requirements are discussed in reference to the piston-cylinder problem analyzed.

Shih, T. I.-P.↗

Viscous equilibrium computations using program LAURA

The Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA) has been modified to compute viscous equilibrium flow. Periodic calls to the thermodynamic and transport property curve-fits enable solutions to be computed for small percentage increase in computer time when compared with perfect gas times. The code is used to compute the hypersonic flow over slender and blunt cones, and solutions are compared with other computational techniques and flight data.

Greene, Francis A.↗

Improving NASA's Multiscale Modeling Framework for Tropical Cyclone Climate Study

One of the current challenges in tropical cyclone (TC) research is how to improve our understanding of TC interannual variability and the impact of climate change on TCs. Recent advances in global modeling, visualization, and supercomputing technologies at NASA show potential for such studies. In this article, the authors discuss recent scalability improvement to the multiscale modeling framework (MMF) that makes it feasible to perform long-term TC-resolving simulations. The MMF consists of the finite-volume general circulation model (fvGCM), supplemented by a copy of the Goddard cumulus ensemble model (GCE) at each of the fvGCM grid points, giving 13,104 GCE copies. The original fvGCM implementation has a 1D data decomposition; the revised MMF implementation retains the 1D decomposition for most of the code, but uses a 2D decomposition for the massive copies of GCEs. Because the vast majority of computation time in the MMF is spent computing the GCEs, this approach can achieve excellent speedup without incurring the cost of modifying the entire code. Intelligent process mapping allows differing numbers of processes to be assigned to each domain for load balancing. The revised parallel implementation shows highly promising scalability, obtaining a nearly 80-fold speedup by increasing the number of cores from 30 to 3,335.

tropical cyclone interannual variability↗

Application of real-time engine simulations to the development of propulsion system controls

The development of digital controls for turbojet and turbofan engines is presented by the use of real-time computer simulations of the engines. The engine simulation provides a test-bed for evaluating new control laws and for checking and debugging control software and hardware prior to engine testing. The development and use of real-time, hybrid computer simulations of the Pratt and Whitney TF30-P-3 and F100-PW-100 augmented turbofans are described in support of a number of controls research programs at the Lewis Research Center. The role of engine simulations in solving the propulsion systems integration problem is also discussed.

Szuch, J. R.↗

Application of real-time engine simulations to the development of propulsion system controls

The development of digital controls for turbojet and turbofan engines can be facilitated by the use of real-time computer simulations of the engines. The engine simulation provides a 'test-bed' for evaluating new control laws and for checking and 'debugging' control software and hardware prior to engine testing. This paper describes the development and use of real-time, hybrid computer simulations of the Pratt & Whitney TF30-P-3 and F100-PW-100 augmented turbofans in support of a number of controls research programs at the Lewis Research Center. The role of engine simulations in solving the propulsion systems integration problem is also discussed.

Szuch, J. R.↗

Brief Communication: A Simplified Approach to Transient Convective Droplet Evaporation and Burning

Empirical correlations for evaporation rates from single fuel droplets have existed since the 1930s. These correlations, which will be referred to in this article as Froessling/Ranz-Marshall types of correlations, are appropriate to the special cases of steady-state evaporation in the absence of chemical reaction. In a previous article by the authors, the quasi-steady evaporation and burning processes associated with a fuel drop in a convective environment are examined through a droplet model based on the boundary layer approach. For droplet Reynolds numbers of practical interest, this model produces very reasonable steady state as well as quasi-time-dependent droplet simulations, requiring relatively short computational times and yielding good agreement with the above-mentioned empirical correlations. The steady-state case, however, is usually relevant to practical combustor situations only when the drop has reached a nearly uniform temperature since the heating process of the drop cannot be considered to be quasi-steady. In the present study, the transient heating process of the droplet interior during evaporation and/or burning is taken into account, and thus calculations pertaining to the entire life-time of the droplet are carried out. It is of particular interest here to obtain simplified correlations to describe the transient behavior of evaporating and burning droplets; these may be incorporated with greater ease into spray calculations. Accordingly, we have chosen to use stagnation conditions in the present model in a modification of the Froessling/Ranz-Marshall correlations. These modified correlations, incorporating an effective transfer number, produce a fairly accurate representation of droplet evaporation and burning, while requiring only one tenth the computational effort used in a full boundary layer solution.

Madooglu, K.↗

Development of an Efficient Binaural Simulation for the Analysis of Structural Acoustic Data

Applying binaural simulation techniques to structural acoustic data can be very computationally intensive as the number of discrete noise sources can be very large. Typically, Head Related Transfer Functions (HRTFs) are used to individually filter the signals from each of the sources in the acoustic field. Therefore, creating a binaural simulation implies the use of potentially hundreds of real time filters. This paper details two methods of reducing the number of real-time computations required by: (i) using the singular value decomposition (SVD) to reduce the complexity of the HRTFs by breaking them into dominant singular values and vectors and (ii) by using equivalent source reduction (ESR) to reduce the number of sources to be analyzed in real-time by replacing sources on the scale of a structural wavelength with sources on the scale of an acoustic wavelength. The ESR and SVD reduction methods can be combined to provide an estimated computation time reduction of 99.4% for the structural acoustic data tested. In addition, preliminary tests have shown that there is a 97% correlation between the results of the combined reduction methods and the results found with the current binaural simulation techniques

Johnson, Marty E.↗

The role of time and speed in NASA's SUNLITE program

The SUNLITE program of NASA's LaRC aims to demonstrate lower noise and better frequency stability for continuous-wave (CW) solid-state lasers in the microgravity environment of space. The program will utilize laser-diode-pumped nonplanar-ring oscillators regulated by ultra-stable high-finesse Fabry-Perot Spectrometers to produce light beams with phase rate or frequency variations as low as 3 Hz. SUNLITE will use the period-method (P-method) to measure the phase rate and frequency stability of the lasers. The P-method was chosen because it requires less memory space for the raw data, because frequencies can be analyzed on-line in real-time simply by reciprocating the periods (fi = 1/pi), and because the mean and variance of the frequencies can be calculated as fast or faster than they can be with the fastest fast Fourier transformations. Furthermore, for a given signal-to-noise power ratio, the P-method requires less data and less computer time to extract the noise components. Although the P-method does require fast Time Interval Counters, the Fourier transformation method requires comparably fast Sampling Volt meters. For either method, however, time and computer speed play a critical role.

Hafele, Joseph C.↗