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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
NASA NTRS1981

A vortex-lattice method for calculating lifting-surface interference

The interference effect of closely coupled lifting surfaces was investigated. A nonsteady vortex-lattice method was applied to calculate the steady-state and nonsteady lift characteristics of configurations having interference effects. The configurations consist of low-aspect-ratio delta wings, at low and high angles of attack. Leading-edge separation and wake roll-up are simulated by a time-dependent wake-shedding procedure. For steady-state flow conditions, this numerical procedure saves a considerable amount of computer time, compared with iterative methods, and yields the same results. A better understanding of the interference effect can be gained by using the method to study the transient behavior. The nonsteady approach also offers the capability of calculating various nonsteady motions, as is demonstrated in the calculation of the longitudinal damping.

Levin, D.↗
NASA NTRS1983

Computational methods for aerodynamic design using numerical optimization

Five methods to increase the computational efficiency of aerodynamic design using numerical optimization, by reducing the computer time required to perform gradient calculations, are examined. The most promising method consists of drastically reducing the size of the computational domain on which aerodynamic calculations are made during gradient calculations. Since a gradient calculation requires the solution of the flow about an airfoil whose geometry was slightly perturbed from a base airfoil, the flow about the base airfoil is used to determine boundary conditions on the reduced computational domain. This method worked well in subcritical flow.

Peeters, M. F.↗
NASA NTRS1982

VORCOR: A computer program for calculating characteristics of wings with edge vortex separation by using a vortex-filament and-core model

A computer code base on an improved vortex filament/vortex core method for predicting aerodynamic characteristics of slender wings with edge vortex separations is developed. The code is applicable to camber wings, straked wings or wings with leading edge vortex flaps at subsonic speeds. The prediction of lifting pressure distribution and the computer time are improved by using a pair of concentrated vortex cores above the wing surface. The main features of this computer program are: (1) arbitrary camber shape may be defined and an option for exactly defining leading edge flap geometry is also provided; (2) the side edge vortex system is incorporated.

Pao, J. L.↗
NASA NTRS1985

Energy management of three-dimensional minimum-time intercept

A real-time computer algorithm to control and optimize aircraft flight profiles is described and applied to a three-dimensional minimum-time intercept mission. The proposed scheme has roots in two well known techniques: singular perturbations and neighboring-optimal guidance. Use of singular-perturbation ideas is made in terms of the assumed trajectory-family structure. A heading/energy family of prestored point-mass-model state-Euler solutions is used as the baseline in this scheme. The next step is to generate a near-optimal guidance law that will transfer the aircraft to the vicinity of this reference family. The control commands fed to the autopilot (bank angle and load factor) consist of the reference controls plus correction terms which are linear combinations of the altitude and path-angle deviations from reference values, weighted by a set of precalculated gains. In this respect the proposed scheme resembles neighboring-optimal guidance. However, in contrast to the neighboring-optimal guidance scheme, the reference control and state variables as well as the feedback gains are stored as functions of energy and heading in the present approach. Some numerical results comparing open-loop optimal and approximate feedback solutions are presented.

Kelley, H. J.↗
NASA NTRS1991

Dynamic analysis of truss-beam system

A simple truss-beam method for determining the dynamic characteristics of the space structures intended to perform various tasks in orbit is presented. Algorithms are provided to determine the flexibility matrix of the truss beam for use in the equation of motion. The natural frequencies obtained through this method are compared with those obtained through the finite element method. An experimental procedure for verifying the theoretical results is described. It is concluded that the truss-beam method is a simple analysis technique that yields reasonably accurate results with a minimum of computational effort, especially for the critical lower bending modes of flexible structures. The method takes less computer time than more conventional methods and can be programed in both BASIC and FORTRAN for use in micro- and mainframe computers.

Abu-Saba, Elias G.↗
NASA NTRS1992

Improved method for solving the viscous shock layer equations

An improved method for solving the viscous shock layer equations for supersonic/hypersonic flows past blunt-nosed bodies is presented. The method is capable of handling slender to thick bodies. The solution is obtained by solving a coupled set of five equations, built of the four basic viscous shock layer equations and an additional equation for the standoff distance. The coupling of the equations prevents the local iterations divergence problems encountered by previous methods of solution far downstream on slender bodies. It also eliminates the need for local iterations, which were required by previous methods of solution, for a first-order scheme in the streamwise direction. A new global iteration procedure is employed to impose the shock boundary conditions. The procedure prevents the global iteration instability encountered by the basic method of solution and improves the convergence rate of the global iteration procedure of later methods devised to overcome this difficulty. The new technique reduces the computation time by 65-95 percent as compared to previous methods of solution. The method can efficiently be implemented in vector/parallel computers.

Gordon, Rachel↗
NASA NTRS2016

Modeling ARRM Xenon Tank Pressurization Using 1D Thermodynamic and Heat Transfer Equations

As a first step in understanding what ground support equipment (GSE) is required to provide external cooling during the loading of 5,000 kg of xenon into 4 aluminum lined composite overwrapped pressure vessels (COPVs), a modeling analysis was performed using Microsoft Excel. The goals of the analysis were to predict xenon temperature and pressure throughout loading at the launch facility, estimate the time required to load one tank, and to get an early estimate of what provisions for cooling xenon might be needed while the tanks are being filled. The model uses the governing thermodynamic and heat transfer equations to achieve these goals. Results indicate that a single tank can be loaded in about 15 hours with reasonable external coolant requirements. The model developed in this study was successfully validated against flight and test data. The first data set is from the Dawn mission which also utilizes solar electric propulsion with xenon propellant, and the second is test data from the rapid loading of a hydrogen cylindrical COPV. The main benefit of this type of model is that the governing physical equations using bulk fluid solid temperatures can provide a quick and accurate estimate of the state of the propellant throughout loading which is much cheaper in terms of computational time and licensing costs than a Computation Fluid Dynamics (CFD) analysis while capturing the majority of the thermodynamics and heat transfer.

Xenon storage↗
NASA NTRS2017

Modeling Xenon Tank Pressurization using One-Dimensional Thermodynamic and Heat Transfer Equations

As a first step in understanding what ground support equipment (GSE) is required to provide external cooling during the loading of 5,000 kg of xenon into 4 aluminum lined composite overwrapped pressure vessels (COPVs), a modeling analysis was performed using Microsoft Excel. The goals of the analysis were to predict xenon temperature and pressure throughout loading at the launch facility, estimate the time required to load one tank, and to get an early estimate of what provisions for cooling xenon might be needed while the tanks are being filled. The model uses the governing thermodynamic and heat transfer equations to achieve these goals. Results indicate that a single tank can be loaded in about 15 hours with reasonable external coolant requirements. The model developed in this study was successfully validated against flight and test data. The first data set is from the Dawn mission which also utilizes solar electric propulsion with xenon propellant, and the second is test data from the rapid loading of a hydrogen cylindrical COPV. The main benefit of this type of model is that the governing physical equations using bulk fluid solid temperatures can provide a quick and accurate estimate of the state of the propellant throughout loading which is much cheaper in terms of computational time and licensing costs than a Computation Fluid Dynamics (CFD) analysis while capturing the majority of the thermodynamics and heat transfer.

Thermodynamic tank modeling↗
DOE OSTI2024

An Incremental Tensor Train Decomposition Algorithm

We present a new algorithm for incrementally updating the tensor train decomposition of a stream of tensor data. This new algorithm, called the tensor train incremental core expansion (TT-ICE) improves upon the current state-of-the-art algorithms for compressing in tensor train format by developing a new adaptive approach that incurs significantly slower rank growth and guarantees compression accuracy. This capability is achieved by limiting the number of new vectors appended to the TT-cores of an existing accumulation tensor after each data increment. These vectors represent directions orthogonal to the span of existing cores and are limited to those needed to represent a newly arrived tensor to a target accuracy. We provide two versions of the algorithm: TT-ICE and TT-ICE accelerated with heuristics (TT-ICE*). Here, we provide a proof of correctness for TT-ICE and empirically demonstrate the performance of the algorithms in compressing large-scale video and scientific simulation datasets. Compared to existing approaches that also use rank adaptation, TT-ICE* achieves 57× higher compression and up to 95% reduction in computational time.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1971

An efficient parallel algorithm for the solution of a tridiagonal linear system of equations

Tridiagonal linear systems of equations are solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computations on computers of the ILLIAC IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log sub 2 N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.

Stone, H. S.↗
NASA NTRS1973

An efficient parallel algorithm for the solution of a tridiagonal linear system of equations.

Tridiagonal linear systems of equations can be solved on conventional serial machines in a time proportional to N, where N is the number of equations. The conventional algorithms do not lend themselves directly to parallel computation on computers of the Illiac IV class, in the sense that they appear to be inherently serial. An efficient parallel algorithm is presented in which computation time grows as log(sub-2) N. The algorithm is based on recursive doubling solutions of linear recurrence relations, and can be used to solve recurrence relations of all orders.

Stone, H. S.↗
NASA NTRS1974

Processing electrophysiological signals for the monitoring of alertness

Mathematical techniques are described for processing EEG signals associated with varying states of alertness. Fast algorithms for implementing real-time computations of alertness estimates were developed. A realization of the phase-distortionless digital filter is presented which approaches real-time filtering and a transform for EEG signals. This transform provides information for the alertness estimates and can be performed in real time. A statistical test for stationarity in EEG signals is being developed that will provide a method for determining the duration of the EEG signals necessary for estimating the short-time power or energy spectra for nonstationary analysis of EEG signals.

Lai, D. C.↗
NASA NTRS1993

Linear static structural and vibration analysis on high-performance computers

Parallel computers offer the oppurtunity to significantly reduce the computation time necessary to analyze large-scale aerospace structures. This paper presents algorithms developed for and implemented on massively-parallel computers hereafter referred to as Scalable High-Performance Computers (SHPC), for the most computationally intensive tasks involved in structural analysis, namely, generation and assembly of system matrices, solution of systems of equations and calculation of the eigenvalues and eigenvectors. Results on SHPC are presented for large-scale structural problems (i.e. models for High-Speed Civil Transport). The goal of this research is to develop a new, efficient technique which extends structural analysis to SHPC and makes large-scale structural analyses tractable.

Baddourah, M. A.↗
NASA NTRS2009

High-Performance Algorithm for Solving the Diagnosis Problem

An improved method of model-based diagnosis of a complex engineering system is embodied in an algorithm that involves considerably less computation than do prior such algorithms. This method and algorithm are based largely on developments reported in several NASA Tech Briefs articles: The Complexity of the Diagnosis Problem (NPO-30315), Vol. 26, No. 4 (April 2002), page 20; Fast Algorithms for Model-Based Diagnosis (NPO-30582), Vol. 29, No. 3 (March 2005), page 69; Two Methods of Efficient Solution of the Hitting-Set Problem (NPO-30584), Vol. 29, No. 3 (March 2005), page 73; and Efficient Model-Based Diagnosis Engine (NPO-40544), on the following page. Some background information from the cited articles is prerequisite to a meaningful summary of the innovative aspects of the present method and algorithm. In model-based diagnosis, the function of each component and the relationships among all the components of the engineering system to be diagnosed are represented as a logical system denoted the system description (SD). Hence, the expected normal behavior of the engineering system is the set of logical consequences of the SD. Faulty components lead to inconsistencies between the observed behaviors of the system and the SD. Diagnosis the task of finding faulty components is reduced to finding those components, the abnormalities of which could explain all the inconsistencies. The solution of the diagnosis problem should be a minimal diagnosis, which is a minimal set of faulty components. The calculation of a minimal diagnosis is inherently a hard problem, the solution of which requires amounts of computation time and memory that increase exponentially with the number of components of the engineering system. Among the developments to reduce the computational burden, as reported in the cited articles, is the mapping of the diagnosis problem onto the integer-programming (IP) problem. This mapping makes it possible to utilize a variety of algorithms developed previously for IP to solve the diagnosis problem. In the IP approach, the diagnosis problem can be formulated as a linear integer optimization problem, which can be solved by use of well-developed integer-programming algorithms. This concludes the background information.

Fijany, Amir↗
NASA NTRS2000

Airbreathing Propulsion System Analysis Using Multithreaded Parallel Processing

In this paper, parallel processing is used to analyze the mixing, and combustion behavior of hypersonic flow. Preliminary work for a sonic transverse hydrogen jet injected from a slot into a Mach 4 airstream in a two-dimensional duct combustor has been completed [Moon and Chung, 1996]. Our aim is to extend this work to three-dimensional domain using multithreaded domain decomposition parallel processing based on the flowfield-dependent variation theory. Numerical simulations of chemically reacting flows are difficult because of the strong interactions between the turbulent hydrodynamic and chemical processes. The algorithm must provide an accurate representation of the flowfield, since unphysical flowfield calculations will lead to the faulty loss or creation of species mass fraction, or even premature ignition, which in turn alters the flowfield information. Another difficulty arises from the disparity in time scales between the flowfield and chemical reactions, which may require the use of finite rate chemistry. The situations are more complex when there is a disparity in length scales involved in turbulence. In order to cope with these complicated physical phenomena, it is our plan to utilize the flowfield-dependent variation theory mentioned above, facilitated by large eddy simulation. Undoubtedly, the proposed computation requires the most sophisticated computational strategies. The multithreaded domain decomposition parallel processing will be necessary in order to reduce both computational time and storage. Without special treatments involved in computer engineering, our attempt to analyze the airbreathing combustion appears to be difficult, if not impossible.

Schunk, Richard Gregory↗
NASA NTRS1991

Aerodynamic preliminary analysis system 2. Part 2: User's manual

An aerodynamic analysis system based on potential theory at subsonic and/or supersonic speeds and impact type finite element solutions at hypersonic conditions is described. Three dimensional configurations have multiple nonplanar surfaces of arbitrary planforms and bodies of noncircular contour may be analyzed. Static, rotary, and control longitudinal and lateral-directional characteristics may be generated. The analysis was implemented on a time sharing system in conjunction with an input tablet digitizer and an interactive graphics input/output display and editing terminal to maximize its responsiveness to the preliminary analysis. Computation times on an IBM 3081 are typically less than one minute of CPU/Mach number at subsonic, supersonic, or hypersonic speeds. This is a user manual for the computer programming.

Sova, G.↗
NASA NTRS1989

Numerical Simulation of Flow Through an Artificial Heart

A solution procedure was developed that solves the unsteady, incompressible Navier-Stokes equations, and was used to numerically simulate viscous incompressible flow through a model of the Pennsylvania State artificial heart. The solution algorithm is based on the artificial compressibility method, and uses flux-difference splitting to upwind the convective terms; a line-relaxation scheme is used to solve the equations. The time-accuracy of the method is obtained by iteratively solving the equations at each physical time step. The artificial heart geometry involves a piston-type action with a moving solid wall. A single H-grid is fit inside the heart chamber. The grid is continuously compressed and expanded with a constant number of grid points to accommodate the moving piston. The computational domain ends at the valve openings where nonreflective boundary conditions based on the method of characteristics are applied. Although a number of simplifing assumptions were made regarding the geometry, the computational results agreed reasonably well with an experimental picture. The computer time requirements for this flow simulation, however, are quite extensive. Computational study of this type of geometry would benefit greatly from improvements in computer hardware speed and algorithm efficiency enhancements.

Rogers, Stuart E.↗