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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,549 records · Page 86

All sources NASA NTRS DOE OSTI

NASA NTRS1995

Comparison of Nonequilibrium Solution Algorithms Applied to Chemically Stiff Hypersonic Flows

Three solution algorithms, explicit under-relaxation, point implicit, and lower-upper symmetric Gauss-Seidel, are used to compute nonequilibrium flow around the Apollo 4 return capsule at the 62-km altitude point in its descent trajectory. By varying the Mach number, the efficiency and robustness of the solution algorithms were tested for different levels of chemical stiffness.The performance of the solution algorithms degraded as the Mach number and stiffness of the flow increased. At Mach 15 and 30, the lower-upper symmetric Gauss-Seidel method produces an eight order of magnitude drop in the energy residual in one-third to one-half the Cray C-90 computer time as compared to the point implicit and explicit under-relaxation methods. The explicit under-relaxation algorithm experienced convergence difficulties at Mach 30 and above. At Mach 40 the performance of the lower-upper symmetric Gauss-Seidel algorithm deteriorates to the point that it is out performed by the point implicit method. The effects of the viscous terms are investigated. Grid dependency questions are explored.

Palmer, Grant↗

NASA NTRS1996

Documentation for a Structural Optimization Procedure Developed Using the Engineering Analysis Language (EAL)

This report describes a structural optimization procedure developed for use with the Engineering Analysis Language (EAL) finite element analysis system. The procedure is written primarily in the EAL command language. Three external processors which are written in FORTRAN generate equivalent stiffnesses and evaluate stress and local buckling constraints for the sections. Several built-up structural sections were coded into the design procedures. These structural sections were selected for use in aircraft design, but are suitable for other applications. Sensitivity calculations use the semi-analytic method, and an extensive effort has been made to increase the execution speed and reduce the storage requirements. There is also an approximate sensitivity update method included which can significantly reduce computational time. The optimization is performed by an implementation of the MINOS V5.4 linear programming routine in a sequential liner programming procedure.

Martin, Carl J., Jr.↗

NASA NTRS1997

Variational Methods in Design Optimization and Sensitivity Analysis for Two-Dimensional Euler Equations

Variational methods (VM) sensitivity analysis employed to derive the costate (adjoint) equations, the transversality conditions, and the functional sensitivity derivatives. In the derivation of the sensitivity equations, the variational methods use the generalized calculus of variations, in which the variable boundary is considered as the design function. The converged solution of the state equations together with the converged solution of the costate equations are integrated along the domain boundary to uniquely determine the functional sensitivity derivatives with respect to the design function. The application of the variational methods to aerodynamic shape optimization problems is demonstrated for internal flow problems at supersonic Mach number range. The study shows, that while maintaining the accuracy of the functional sensitivity derivatives within the reasonable range for engineering prediction purposes, the variational methods show a substantial gain in computational efficiency, i.e., computer time and memory, when compared with the finite difference sensitivity analysis.

Ibrahim, A. H.↗

NASA NTRS1997

Gradient-Based Aerodynamic Shape Optimization Using ADI Method for Large-Scale Problems

A gradient-based shape optimization methodology, that is intended for practical three-dimensional aerodynamic applications, has been developed. It is based on the quasi-analytical sensitivities. The flow analysis is rendered by a fully implicit, finite volume formulation of the Euler equations.The aerodynamic sensitivity equation is solved using the alternating-direction-implicit (ADI) algorithm for memory efficiency. A flexible wing geometry model, that is based on surface parameterization and platform schedules, is utilized. The present methodology and its components have been tested via several comparisons. Initially, the flow analysis for for a wing is compared with those obtained using an unfactored, preconditioned conjugate gradient approach (PCG), and an extensively validated CFD code. Then, the sensitivities computed with the present method have been compared with those obtained using the finite-difference and the PCG approaches. Effects of grid refinement and convergence tolerance on the analysis and shape optimization have been explored. Finally the new procedure has been demonstrated in the design of a cranked arrow wing at Mach 2.4. Despite the expected increase in the computational time, the results indicate that shape optimization, which require large numbers of grid points can be resolved with a gradient-based approach.

Pandya, Mohagna J.↗

NASA NTRS1997

Advanced Signal Processing Methods Applied to Digital Mammography

The work reported here is on the extension of the earlier proposal of the same title, August 1994-June 1996. The report for that work is also being submitted. The work reported there forms the foundation for this work from January 1997 to September 1997. After the earlier work was completed there were a few items that needed to be completed prior to submission of a new and more comprehensive proposal for further research. Those tasks have been completed and two new proposals have been submitted, one to NASA, and one to Health & Human Services WS). The main purpose of this extension was to refine some of the techniques that lead to automatic large scale evaluation of full mammograms. Progress on each of the proposed tasks follows. Task 1: A multiresolution segmentation of background from breast has been developed and tested. The method is based on the different noise characteristics of the two different fields. The breast field has more power in the lower octaves and the off-breast field behaves similar to a wideband process, where more power is in the high frequency octaves. After the two fields are separated by lowpass filtering, a region labeling routine is used to find the largest contiguous region, the breast. Task 2: A wavelet expansion that can decompose the image without zero padding has been developed. The method preserves all properties of the power-of-two wavelet transform and does not add appreciably to computation time or storage. This work is essential for analysis of the full mammogram, as opposed to selecting sections from the full mammogram. Task 3: A clustering method has been developed based on a simple counting mechanism. No ROC analysis has been performed (and was not proposed), so we cannot finally evaluate this work without further support. Task 4: Further testing of the filter reveals that different wavelet bases do yield slightly different qualitative results. We cannot provide quantitative conclusions about this for all possible bases without further support. Task 5: Better modeling does indeed make an improvement in the detection output. After the proposal ended, we came up with some new theoretical explanations that helps in understanding when the D4 filter should be better. This work is currently in the review process. Task 6: N/A. This no longer applies in view of Tasks 4-5. Task 7: Comprehensive plans for further work have been completed. These plans are the subject of two proposals, one to NASA and one to HHS. These proposals represent plans for a complete evaluation of the methods for identifying normal mammograms, augmented with significant further theoretical work.

Stauduhar, Richard P.↗

NASA NTRS1998

Numerical Procedures for Inlet/Diffuser/Nozzle Flows

Two primitive variable, pressure based, flux-split, RNS/NS solution procedures for viscous flows are presented. Both methods are uniformly valid across the full Mach number range, Le., from the incompressible limit to high supersonic speeds. The first method is an 'optimized' version of a previously developed global pressure relaxation RNS procedure. Considerable reduction in the number of relatively expensive matrix inversion, and thereby in the computational time, has been achieved with this procedure. CPU times are reduced by a factor of 15 for predominantly elliptic flows (incompressible and low subsonic). The second method is a time-marching, 'linearized' convection RNS/NS procedure. The key to the efficiency of this procedure is the reduction to a single LU inversion at the inflow cross-plane. The remainder of the algorithm simply requires back-substitution with this LU and the corresponding residual vector at any cross-plane location. This method is not time-consistent, but has a convective-type CFL stability limitation. Both formulations are robust and provide accurate solutions for a variety of internal viscous flows to be provided herein.

Rubin, Stanley G.↗

NASA NTRS1995

Comparison of Implicit Schemes for the Incompressible Navier-Stokes Equations

For a computational flow simulation tool to be useful in a design environment, it must be very robust and efficient. To develop such a tool for incompressible flow applications, a number of different implicit schemes are compared for several two-dimensional flow problems in the current study. The schemes include Point-Jacobi relaxation, Gauss-Seidel line relaxation, incomplete lower-upper decomposition, and the generalized minimum residual method preconditioned with each of the three other schemes. The efficiency of the schemes is measured in terms of the computing time required to obtain a steady-state solution for the laminar flow over a backward-facing step, the flow over a NACA 4412 airfoil, and the flow over a three-element airfoil using overset grids. The flow solver used in the study is the INS2D code that solves the incompressible Navier-Stokes equations using the method of artificial compressibility and upwind differencing of the convective terms. The results show that the generalized minimum residual method preconditioned with the incomplete lower-upper factorization outperforms all other methods by at least a factor of 2.

Rogers, Stuart E.↗

NASA NTRS1998

Two-Dimensional High-Lift Aerodynamic Optimization Using Neural Networks

The high-lift performance of a multi-element airfoil was optimized by using neural-net predictions that were trained using a computational data set. The numerical data was generated using a two-dimensional, incompressible, Navier-Stokes algorithm with the Spalart-Allmaras turbulence model. Because it is difficult to predict maximum lift for high-lift systems, an empirically-based maximum lift criteria was used in this study to determine both the maximum lift and the angle at which it occurs. The 'pressure difference rule,' which states that the maximum lift condition corresponds to a certain pressure difference between the peak suction pressure and the pressure at the trailing edge of the element, was applied and verified with experimental observations for this configuration. Multiple input, single output networks were trained using the NASA Ames variation of the Levenberg-Marquardt algorithm for each of the aerodynamic coefficients (lift, drag and moment). The artificial neural networks were integrated with a gradient-based optimizer. Using independent numerical simulations and experimental data for this high-lift configuration, it was shown that this design process successfully optimized flap deflection, gap, overlap, and angle of attack to maximize lift. Once the neural nets were trained and integrated with the optimizer, minimal additional computer resources were required to perform optimization runs with different initial conditions and parameters. Applying the neural networks within the high-lift rigging optimization process reduced the amount of computational time and resources by 44% compared with traditional gradient-based optimization procedures for multiple optimization runs.

Greenman, Roxana M.↗

NASA NTRS1960

Determination of Satellite Orbits from Radar Data

An optimum method for determining satellite orbits from radar data is presented in this report. Offering a good combination of speed and accuracy, the method makes use of orbit inclination and orbit elements in the plane, and proceeds with a differential correction of the orbit elements. Rapid, accurate methods of computing orbit elements are required to predict satellite positions for acquisition by other radars at points later along the orbit. In some cases the data are limited to a single pass over the observing station. The dynamical method is described in detail, and its accuracy is compared with those of two other methods: the purely geometrical, and the least-squares geometrical. By this optimum method the computing time, including the differential correction time, is 1 minute. Without differential correction, the rough determination takes from 10 to 20 seconds with approximately 5 miles positional uncertainty.

Cahill, W. F.↗

NASA NTRS1998

Development of a Probabilistic Dynamic Synthesis Method for the Analysis of Nondeterministic Structures

Accounting for the statistical geometric and material variability of structures in analysis has been a topic of considerable research for the last 30 years. The determination of quantifiable measures of statistical probability of a desired response variable, such as natural frequency, maximum displacement, or stress, to replace experience-based "safety factors" has been a primary goal of these studies. There are, however, several problems associated with their satisfactory application to realistic structures, such as bladed disks in turbomachinery. These include the accurate definition of the input random variables (rv's), the large size of the finite element models frequently used to simulate these structures, which makes even a single deterministic analysis expensive, and accurate generation of the cumulative distribution function (CDF) necessary to obtain the probability of the desired response variables. The research presented here applies a methodology called probabilistic dynamic synthesis (PDS) to solve these problems. The PDS method uses dynamic characteristics of substructures measured from modal test as the input rv's, rather than "primitive" rv's such as material or geometric uncertainties. These dynamic characteristics, which are the free-free eigenvalues, eigenvectors, and residual flexibility (RF), are readily measured and for many substructures, a reasonable sample set of these measurements can be obtained. The statistics for these rv's accurately account for the entire random character of the substructure. Using the RF method of component mode synthesis, these dynamic characteristics are used to generate reduced-size sample models of the substructures, which are then coupled to form system models. These sample models are used to obtain the CDF of the response variable by either applying Monte Carlo simulation or by generating data points for use in the response surface reliability method, which can perform the probabilistic analysis with an order of magnitude less computational effort. Both free- and forced-response analyses have been performed, and the results indicate that, while there is considerable room for improvement, the method produces usable and more representative solutions for the design of realistic structures with a substantial savings in computer time.

Brown, A. M.↗

NASA NTRS1997

Particle Scattering in the Resonance Regime: Full-Wave Solution for Axisymmetric Particles with Large Aspect Ratios

Reliable descriptions of the optical properties of clouds and aerosols are essential for studies of radiative transfer in planetary atmospheres. The scattering algorithms provide accurate estimates of these properties for spherical particles with a wide range of sizes and refractive indices, but these methods are not valid for non-spherical particles (e.g., ice crystals, mineral dust, and smoke). Even though a host of methods exist for deriving the optical properties of nonspherical particles that are very small or very large compared with the wavelength, only a few methods are valid in the resonance regime, where the particle dimensions are comparable with the wavelength. Most such methods are not ideal for particles with sharp edges or large axial ratios. We explore the utility of an integral equation approach for deriving the single-scattering optical properties of axisymmetric particles with large axial ratios. The accuracy of this technique is shown for spheres of increasing size parameters and an ensemble of randomly oriented prolate spheroids of size parameter equal to 10.079368. In this last case our results are compared with published results obtained with the T-matrix approach. Next we derive cross sections, single-scattering albedos, and phase functions for cylinders, disks, and spheroids of ice with dimensions extending from the Rayleigh to the geometric optics regime. Compared with those for a standard surface integral equation method, the storage requirement and the computer time needed by this method are reduced, thus making it attractive for generating databases to be used in multiple-scattering calculations. Our results show that water ice disks and cylinders are more strongly absorbing than equivalent volume spheres at most infrared wavelengths. The geometry of these particles also affects the angular dependence of the scattering. Disks and columns with maximum linear dimensions larger than the wavelength scatter much more radiation in the forward and backward directions and much less radiation at intermediate phase angles than equivalent volume spheres.

Zuffada, Cinzia↗

NASA NTRS1995

Accelerated Test Methods

Neural network systems were evaluated for use in predicting wear of mechanical systems. Three different neural network software simulation packages were utilized in order to create models of tribological wear tests. Representative simple, medium, and high complexity simulation packages were selected. Pin-on-disk, rub shoe, and four-ball tribological test data was used for training, testing, and verification of the neural network models. Results showed mixed success. The neural networks were able to predict results with some accuracy if the number of input variables was low or the amount of training data was high. Increased neural network complexity resulted in more accurate results, however there was a point of diminishing return. Medium complexity models were the best trade off between accuracy and computing time requirements. A NASA Technical Memorandum and a Society of Tribologists and Lubrication Engineers paper are being published which detail the work.

Jansen, Ralph↗

NASA NTRS1997

Comparison of Two-Equation Turbulence Models for Prediction of Heat Transfer on Film-Cooled Turbine Blades

A three-dimensional Navier-Stokes code has been used to compute the heat transfer coefficient on two film-cooled turbine blades, namely, the VKI rotor with six rows of cooling holes, including three rows on the shower head and the C3X vane with nine rows of holes, including five rows on the shower head. Predictions of heat transfer coefficient at the blade surface using three two-equation turbulence model specifically, Coakley's q-omega model, Chien's k-epsilon model and Wilcox's k-omega model with Menter's modifications, have been compared with the experimental data of Camci and Arts for the VKI rotor, and of Hylton et al. for the C3X vane along with predictions using the Baldwin-Lomar (B-L) model taken from Garg and Gaugler. It is found that for the cases considered here the two equation models predict the blade heat transfer somewhat better than the B-L model except immediately downstream of the film-cooled holes on the suction surface of the VKI rotor, and over most of the suction surface of the C3X vane. However, all two-equation models require 40% more computer core than the B-L model for solution, and while the q-omega and k-epsilon models need 40% more computer time than the B-L model the k-omega model requires at least 65% more time because of the slower rate of convergence. It is found that the heat transfer coefficient exhibit a strong spanwise as well as streamwise variation for both blades and all turbulence models.

Garg, Vijay K.↗

NASA NTRS1999

Multidisciplinary Optimization Branch Experience Using iSIGHT Software

The Multidisciplinary Optimization (MDO) Branch at NASA Langley is investigating frameworks for supporting multidisciplinary analysis and optimization research. A framework provides software and system services to integrate computational tasks and allows the researcher to concentrate more on the application and less on the programming details. A framework also provides a common working environment and a full range of optimization tools, and so increases the productivity of multidisciplinary research teams. Finally, a framework enables staff members to develop applications for use by disciplinary experts in other organizations. This year, the MDO Branch has gained experience with the iSIGHT framework. This paper describes experiences with four aerospace applications, including: (1) reusable launch vehicle sizing, (2) aerospike nozzle design, (3) low-noise rotorcraft trajectories, and (4) acoustic liner design. Brief overviews of each problem are provided, including the number and type of disciplinary codes and computation time estimates. In addition, the optimization methods, objective functions, design variables, and constraints are described for each problem. For each case, discussions on the advantages and disadvantages of using the iSIGHT framework are provided as well as notes on the ease of use of various advanced features and suggestions for areas of improvement.

Padula, S. L.↗

NASA NTRS1995

Implementation and Characterization of Three-Dimensional Particle-in-Cell Codes on Multiple-Instruction-Multiple-Data Massively Parallel Supercomputers

A three-dimensional electrostatic particle-in-cell (PIC) plasma simulation code has been developed on coarse-grain distributed-memory massively parallel computers with message passing communications. Our implementation is the generalization to three-dimensions of the general concurrent particle-in-cell (GCPIC) algorithm. In the GCPIC algorithm, the particle computation is divided among the processors using a domain decomposition of the simulation domain. In a three-dimensional simulation, the domain can be partitioned into one-, two-, or three-dimensional subdomains ("slabs," "rods," or "cubes") and we investigate the efficiency of the parallel implementation of the push for all three choices. The present implementation runs on the Intel Touchstone Delta machine at Caltech; a multiple-instruction-multiple-data (MIMD) parallel computer with 512 nodes. We find that the parallel efficiency of the push is very high, with the ratio of communication to computation time in the range 0.3%-10.0%. The highest efficiency (> 99%) occurs for a large, scaled problem with 64(sup 3) particles per processing node (approximately 134 million particles of 512 nodes) which has a push time of about 250 ns per particle per time step. We have also developed expressions for the timing of the code which are a function of both code parameters (number of grid points, particles, etc.) and machine-dependent parameters (effective FLOP rate, and the effective interprocessor bandwidths for the communication of particles and grid points). These expressions can be used to estimate the performance of scaled problems--including those with inhomogeneous plasmas--to other parallel machines once the machine-dependent parameters are known.

Lyster, P. M.↗

NASA NTRS1966

Radiation from Rocket Exhaust Plumes: Inhomogeneous Radiant Heat Transfer from Saturn Type Rocket Exhaust Plumes - Part 1

A radiant heat transfer computer program has been developed by R-AERO-A to calculate radiation from inhomogeneous gases prevalent in Saturn-type exhaust plumes. The radiating species considered in this computer program are water vapor, carbon dioxide, carbon monoxide and carbon particles. The infrared spectral absorption characteristics of these species have been determined under NASA contract. Band model parameters have been used to represent the infrared spectral absorption coefficients over 25 cm-I increments. A modified Curtis-Goodson approximation is used in the inhomogeneous heat transfer calculation. This has been shown to give satisfactory results over the temperature and pressure range of interest in Saturn exhaust plumes. Results are shown for the Saturn-type engines for specific flow field assumptions. Some comparison with experimental spectroscopic data will also be presented. The effect of wavelength increment, field of view, and distance increment along the line of sight on the heat transfer will be discussed. Computer techniques for minimum computer time in calculating radiation from a three-dimensional flow field will also be outlined.

Huffaker, Robert M.↗

NASA NTRS1999

On the Fast Evaluation Method of Temperature and Gas Mixing Ratio Weighting Functions for Remote Sensing of Planetary Atmospheres in Thermal IR and Microwave

Evaluation of weighting functions in the atmospheric remote sensing is usually the most computer-intensive part of the inversion algorithms. We present an analytic approach to computations of temperature and mixing ratio weighting functions that is based on our previous results but the resulting expressions use the intermediate variables that are generated in computations of observable radiances themselves. Upwelling radiances at the given level in the atmosphere and atmospheric transmittances from space to the given level are combined with local values of the total absorption coefficient and its components due to absorption of atmospheric constituents under study. This makes it possible to evaluate the temperature and mixing ratio weighting functions in parallel with evaluation of radiances. This substantially decreases the computer time required for evaluation of weighting functions. Implications for the nadir and limb viewing geometries are discussed.

Ustinov, E. A.↗

NASA NTRS2000

On Fast Post-Processing of Global Positioning System Simulator Truth Data and Receiver Measurements and Solutions Data

Post-Processing of data related to a Global Positioning System (GPS) simulation is an important activity in qualification of a GPS receiver for space flight. Because a GPS simulator is a critical resource it is desirable to move off the pertinent simulation data from the simulator as soon as a test is completed. The simulator data files are usually moved to a Personal Computer (PC), where the post-processing of the receiver logged measurements and solutions data and simulated data is performed. Typically post-processing is accomplished using PC-based commercial software languages and tools. Because of commercial software systems generality their general-purpose functions are notoriously slow and more than often are the bottleneck problem even for short duration experiments. For example, it may take 8 hours to post-process data from a 6-hour simulation. There is a need to do post-processing faster, especially in order to use the previous test results as feedback for a next simulation setup. This paper demonstrates that a fast software linear interpolation algorithm is applicable to a large class of engineering problems, like GPS simulation data post-processing, where computational time is a critical resource and is one of the most important considerations. An approach is developed that allows to speed-up post-processing by an order of magnitude. It is based on improving the post-processing bottleneck interpolation algorithm using apriori information that is specific to the GPS simulation application. The presented post-processing scheme was used in support of a few successful space flight missions carrying GPS receivers. A future approach to solving the post-processing performance problem using Field Programmable Gate Array (FPGA) technology is described.

Kizhner, Semion↗