Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear equations”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Theoretical study of turbulent channel flow - Bulk properties, pressure fluctuations, and propagation of electromagnetic waves

In this paper, we apply two theoretical turbulence models, DIA and the recent GISS model, to study properties of a turbulent channel flow. Both models provide a turbulent kinetic energy spectral function E(k) as the solution of a non-linear equation; the two models employ the same source function but different closures. The source function is characterized by a rate n sub s (k) which is derived from the complex eigenvalues of the Orr-Sommerfeld (OS) equation in which the basic flow is taken to be of a Poiseuille type. The O-S equation is solved for a variety of Reynolds numbers corresponding to available experimental data. A physical argument is presented whereby the central line velocity characterizing the basic flow, U0 sup L, is not to be identified with the U0 appearing in the experimental Reynolds number. The theoretical results are compared with two types of experimental data: (1) turbulence bulk properties, and (2) properties that depend strongly on the structure of the turbulence spectrum at low wave numbers. The only existing analytical expression for Pi (k) cannot be used in the present case because it applies to the case of a flat plate, not a finite channel.

Canuto, V. M.↗
NASA NTRS1990

A parallel-vector algorithm for rapid structural analysis on high-performance computers

A fast, accurate Choleski method for the solution of symmetric systems of linear equations is presented. This direct method is based on a variable-band storage scheme and takes advantage of column heights to reduce the number of operations in the Choleski factorization. The method employs parallel computation in the outermost DO-loop and vector computation via the 'loop unrolling' technique in the innermost DO-loop. The method avoids computations with zeros outside the column heights, and as an option, zeros inside the band. The close relationship between Choleski and Gauss elimination methods is examined. The minor changes required to convert the Choleski code to a Gauss code to solve non-positive-definite symmetric systems of equations are identified. The results for two large-scale structural analyses performed on supercomputers, demonstrate the accuracy and speed of the method.

Storaasli, Olaf O.↗
NASA NTRS1990

The pdf approach to turbulent flow

This paper provides a detailed discussion of the theory and application of probability density function (pdf) methods, which provide a complete statistical description of turbulent flow fields at a single point or a finite number of points. The basic laws governing the flow of Newtonian fluids are set up in the Eulerian and the Lagrangian frame, and the exact and linear equations for the characteristic functionals in those frames are discussed. Pdf equations in both frames are derived as Fourier transforms of the equations of the characteristic functions. Possible formulations for the nonclosed terms in the pdf equation are discussed, their properties are assessed, and closure modes for the molecular-transport and the fluctuating pressure-gradient terms are reviewed. The application of pdf methods to turbulent combustion flows, supersonic flows, and the interaction of turbulence with shock waves is discussed.

Kollmann, W.↗
NASA NTRS1989

Parallel solution of pentadiagonal systems using generalized odd-even elimination

A method for the solution of pentadiagonal systems of linear equations is presented. The method is a generalization of ordinary odd-even elimination used for tridiagonal systems. Using n processors, an n x n pentadiagonal system can be solved using the new method (generalized odd-even elimination) in time proportional to log(2) n.

Levit, Creon↗
NASA NTRS1990

Optimal orbital rendezvous using high and low thrust

Optimal control theory is used to examine a specific class of spacecraft trajectory problems where high- and low-thrust propulsion systems are utilized. These problems assume a spacecraft is in an established orbit about a planet. It is desired to execute an intercept of a pre-determined position in space in a specified amount of time using an optimal high-thrust program. The spacecraft then returns to the original orbit station using the low-thrust propulsion system in an optimal fashion. A minimum fuel solution is sought using the linearized equations of motion, known as the CW equations, which simplify the necessary computations. Solutions are obtained for problems with a fixed final time. However, for the time-open case, the optimal solution is for the final time to be infinite. With a weighted function of the final time in the performance index, a limited range of optimal single impulse solutions for the time -open case can also be found.

Prussing, John E.↗
NASA NTRS1990

Predicted torque equilibrium attitude utilization for Space Station attitude control

An approximate knowledge of the torque equilibrium attitude (TEA) is shown to improve the performance of a control moment gyroscope (CMG) momentum management/attitude control law for Space Station Freedom. The linearized equations of motion are used in conjunction with a state transformation to obtain a control law which uses full state feedback and the predicted TEA to minimize both attitude excursions and CMG peak and secular momentum. The TEA can be computationally determined either by observing the steady state attitude of a 'controlled' spacecraft using arbitrary initial attitude, or by simulating a fixed attitude spacecraft flying in desired orbit subject to realistic environmental disturbance models.

Kumar, Renjith R.↗
NASA NTRS1990

Automated terminal guidance for a Shuttle rendezvous to Space Station Freedom

An automated terminal guidance for a Shuttle rendezvous based on the Clohessy-Wiltshire (CW) linear equations of relative motion is described. The algorithm guides the Shuttle from the last rendezvous midcourse maneuver (MC4) through docking with Space Station Freedom (SSF). The uniqueness of this algorithm is that it makes it possible to use the CW equations to fly a line-of-sight (LOS) Vbar or Rbar in the final-approach docking phase. The algorithm is made of two parts, in and out-of-plane, and can also be used for station keeping during final approaches. Simulation results of the guidance integrated with the Shuttle's flight control system in the Systems Engineering Simulator (SES) at NASA Johnson are discussed. Plans to add a laser radar docking sensor to the SES and integrate it with the Shuttle's rendezvous navigation are examined.

Olszewski, Oscar W.↗
NASA NTRS1991

Conjugate Gradient Algorithms For Manipulator Simulation

Report discusses applicability of conjugate-gradient algorithms to computation of forward dynamics of robotic manipulators. Rapid computation of forward dynamics essential to teleoperation and other advanced robotic applications. Part of continuing effort to find algorithms meeting requirements for increased computational efficiency and speed. Method used for iterative solution of systems of linear equations.

Fijany, Amir↗
NASA NTRS1990

Boundary-layer receptivity due to a wall suction and control of Tollmien-Schlichting waves

A numerical study of the generation of Tollmien-Schlichting (T-S) waves due to the interaction between a small free-stream disturbance and a small localized suction slot on an otherwise flat surface was carried out using finite difference methods. The nonlinear steady flow is of the viscous-inviscid interactive type while the unsteady disturbed flow is assumed to be governed by the Navier-Stokes equations linearized about this flow. Numerical solutions illustrate the growth or decay of T-S waves generated by the interaction between the free-stream disturbance and the suction slot, depending on the value of the scaled Strouhal number. An important result of this receptivity problem is the numerical determination of the amplitude of the T-S waves and the demonstration of the possible active control of the growth of T-S waves.

Bodonyi, R. J.↗
NASA NTRS1990

Influence of vane sweep on rotor-stator interaction noise

The influence of vane sweep in rotor-stator interaction noise is investigated. In an analytical approach, the interaction of a convected gust representing the rotor viscous wake, with a cascade of cascade of finite span swept airfoils, representing the stator, is analyzed. The analysis is based on the solution of the exact linearized equations of motion. High frequency convected gusts for which noise generation is concentrated near the leading edge of airfoils is considered. In a preliminary study, the problem of an isolated finite span swept airfoil interacting with a convected gust is analyzed. Results indicate that sweep can substantially reduce the farfield noise levels for a single airfoil. Using the single airfoil model, an approximate solution to the problem of noise radiation from a cascade of finite span swept airfoils interacting with a convected gust is derived. A parametric study of noise generated by gust cascade interaction is carried out to assess the effectiveness of vane sweep in reducing rotor-stator interaction noise. The results show that sweep is beneficial in reducing noise levels. Rotor wake twist or circumferential lean substantially influences the effectiveness of vane sweep. The orientation of vane sweep must be chosen to enhance the natural phase lag caused by wake lean, in which case rather small sweep angles substantially reduce the noise levels.

Envia, Edmane↗
NASA NTRS1991

Determination of real machine-tool settings and minimization of real surface deviation by computerized inspection

A numerical method is developed for the minimization of deviations of real tooth surfaces from the theoretical ones. The deviations are caused by errors of manufacturing, errors of installment of machine-tool settings and distortion of surfaces by heat-treatment. The deviations are determined by coordinate measurements of gear tooth surfaces. The minimization of deviations is based on the proper correction of initially applied machine-tool settings. The contents of accomplished research project cover the following topics: (1) Descriptions of the principle of coordinate measurements of gear tooth surfaces; (2) Deviation of theoretical tooth surfaces (with examples of surfaces of hypoid gears and references for spiral bevel gears); (3) Determination of the reference point and the grid; (4) Determination of the deviations of real tooth surfaces at the points of the grid; and (5) Determination of required corrections of machine-tool settings for minimization of deviations. The procedure for minimization of deviations is based on numerical solution of an overdetermined system of n linear equations in m unknowns (m much less than n ), where n is the number of points of measurements and m is the number of parameters of applied machine-tool settings to be corrected. The developed approach is illustrated with numerical examples.

Litvin, Faydor L.↗
NASA NTRS1990

Ballooning stability of anisotropic, rotating plasmas

The linearized equation of motion is given in a Lagrangian representation for a rotating plasma with anisotropic pressure. A WKB theory is developed for large-n ballooning modes in an axisymmetric configuration with field-aligned and rigid toroidal flows. In the presence of field-aligned flows, it is shown that a resonance occurs which is strongly suggestive of a generalized mirror instability. In the presence of toroidal rotation, a possible stabilizing effect is identified for P(normal) greater than P(parallel). Finally, as a special case of the theory, the necessary and sufficient conditions for stability in a static, anisotropic plasma are obtained.

Wang, X.-H.↗
NASA NTRS1990

Implementation of two projection methods on a shared memory multiprocessor - DEC VAX 6240

The relative performance of two iterative schemes, based on projection techniques, is compared on a shared memory multiprocessor - VAX 6240. The CG accelerated Block-SSOR method and the CG accelerated Symmetric-Kaczmarz method are considered for the solution of large sparse nonsymmetric systems of linear equations. It is shown that the regular structure of many matrices can be exploited by the CG-accelerated Block-SSOR method to provide good speedup in a multiprocessing environment. However, the CG accelerated Symmetric-Kaczmarz method, while being a viable alternative on a scalar machine, is unable to benefit from multiprocessing.

Kamath, C.↗
NASA NTRS1991

Efficient use of direct solvers for the calculation of compressible flows

While the direct solution of systems of linear equations resulting from fluid dynamic problems has generally not been practical in the past, it is presently demonstrated that the direct method is often more efficient than the most popular iterative schemes when constructed in such a way as to take advantage of presently available vector processing capabilities and large memory. The vertical line Gauss-Seidel algorithm was chosen as the iterative method to be compared with the direct method. It is fond that the direct method becomes efficient only when large residual reductions are desired.

Riggins, David W.↗
NASA NTRS1991

A simple method to derive bounds on the size and to train multilayer neural networks

A new derivation is presented for the bounds on the size of a multilayer neural network to exactly implement an arbitrary training set; namely, the training set can be implemented with zero error with two layers and with the number of the hidden-layer neurons equal to no.1 is greater than p - 1. The derivation does not require the separation of the input space by particular hyperplanes, as in previous derivations. The weights for the hidden layer can be chosen almost arbitrarily, and the weights for the output layer can be found by solving no.1 + 1 linear equations. The method presented exactly solves (M), the multilayer neural network training problem, for any arbitrary training set.

Sartori, Michael A.↗
NASA NTRS1991

Development of a CFD Code for Analysis of Fluid Dynamic Forces in Seals

The aim is to develop a 3-D computational fluid dynamics (CFD) code for the analysis of fluid flow in cylindrical seals and evaluation of the dynamic forces on the seals. This code is expected to serve as a scientific tool for detailed flow analysis as well as a check for the accuracy of the 2D industrial codes. The features necessary in the CFD code are outlined. The initial focus was to develop or modify and implement new techniques and physical models. These include collocated grid formulation, rotating coordinate frames and moving grid formulation. Other advanced numerical techniques include higher order spatial and temporal differencing and an efficient linear equation solver. These techniques were implemented in a 2D flow solver for initial testing. Several benchmark test cases were computed using the 2D code, and the results of these were compared to analytical solutions or experimental data to check the accuracy. Tests presented here include planar wedge flow, flow due to an enclosed rotor, and flow in a 2D seal with a whirling rotor. Comparisons between numerical and experimental results for an annular seal and a 7-cavity labyrinth seal are also included.

Athavale, Mahesh M.↗
NASA NTRS1991

LinkFinder: An expert system that constructs phylogenic trees

An expert system has been developed using the C Language Integrated Production System (CLIPS) that automates the process of constructing DNA sequence based phylogenies (trees or lineages) that indicate evolutionary relationships. LinkFinder takes as input homologous DNA sequences from distinct individual organisms. It measures variations between the sequences, selects appropriate proportionality constants, and estimates the time that has passed since each pair of organisms diverged from a common ancestor. It then designs and outputs a phylogenic map summarizing these results. LinkFinder can find genetic relationships between different species, and between individuals of the same species, including humans. It was designed to take advantage of the vast amount of sequence data being produced by the Genome Project, and should be of value to evolution theorists who wish to utilize this data, but who have no formal training in molecular genetics. Evolutionary theory holds that distinct organisms carrying a common gene inherited that gene from a common ancestor. Homologous genes vary from individual to individual and species to species, and the amount of variation is now believed to be directly proportional to the time that has passed since divergence from a common ancestor. The proportionality constant must be determined experimentally; it varies considerably with the types of organisms and DNA molecules under study. Given an appropriate constant, and the variation between two DNA sequences, a simple linear equation gives the divergence time.

Inglehart, James↗
NASA NTRS1990

A parallel-vector algorithm for rapid structural analysis on high-performance computers

A fast, accurate Choleski method for the solution of symmetric systems of linear equations is presented. This direct method is based on a variable-band storage scheme and takes advantage of column heights to reduce the number of operations in the Choleski factorization. The method employs parallel computation in the outermost DO-loop and vector computation via the loop unrolling technique in the innermost DO-loop. The method avoids computations with zeros outside the column heights, and as an option, zeros inside the band. The close relationship between Choleski and Gauss elimination methods is examined. The minor changes required to convert the Choleski code to a Gauss code to solve non-positive-definite symmetric systems of equations are identified. The results for two large scale structural analyses performed on supercomputers, demonstrate the accuracy and speed of the method.

Storaasli, Olaf O.↗