Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear equation systems”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

On the Retrieval of Lightning Radio Sources from Time-of-Arrival Data

We examine the problem of retrieving three-dimensional lightning locations from radio frequency Time-Of-Arrival (TOA) measurements. Arbitrary antenna locations are considered. By judiciously differencing measurements that are related to the location of the antennas and their excitation times, the problem is converted from the initial spherical nonlinear form to a system of linear equations. In the linear formalism, the source location and time-of-occurrence is viewed geometrically as an intersection of hyperplanes in the four-dimensional Minkowski space (x,y,z,t). The linear equations are solved to obtain explicit analytic expressions for the location and time variables. Retrieval errors are not interpreted with conventional Geometrical Dilution of Precision (GDOP) arguments as discussed by Holmes and Reedy (1951), but with more recent inversion analyses considered by Twomey (1977). Measurement errors are propagated analytically so that the specific effect of these errors on the solution is clarified. The sensitivity of the solution on the number of antennas used, antenna network geometry, source position, and measurement differencing schemes are discussed in terms of the eigenvalues of the linear system.

Koshak, William J.↗
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

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 NTRS1973

Sparse matrix methods based on orthogonality and conjugacy

A matrix having a high percentage of zero elements is called spares. In the solution of systems of linear equations or linear least squares problems involving large sparse matrices, significant saving of computer cost can be achieved by taking advantage of the sparsity. The conjugate gradient algorithm and a set of related algorithms are described.

Lawson, C. L.↗
NASA NTRS1974

Sound propagation through a real jet flow field with scattering due to interaction with turbulence

The sound propagation through a nonuniform turbulent jet flow field is studied by means of a system of linearized equations governing the acoustic variables. These equations depend on the fluctuating flow-field variables which are prescribed by experimental results. It is shown that the redistribution of the acoustic energy in the far field depends on space-time correlation of the turbulent velocities and on the mean flow variables and their gradients.

Maestrello, L.↗
NASA NTRS1973

Attitude control of a spinning flexible spacecraft

The dynamics of rotational motion of a spinning orbiting spacecraft consisting of two rigid bodies connected by a flexible joint and arbitrary number of flexible appendages (two of which are flexible massless booms having masses on their tips) is analyzed. Active attitude control is provided by momentum exchange devices (e.g. control moment gyroscopes) or a mass expulsion system. The linearized equations of motion describing the vehicle are presented, and a large scale digital simulation that has been developed at the Marshall Space Flight Center is presented. A simplified model of the geometrically complex vehicle is selected to make it analytically tractable. The simplified model consists of a single rigid core body with two attached flexible massless booms having tip masses. The states of the vehicle are defined as small perturbations about its steady-state spin. An analysis is performed to determine the domain of stability.

Seltzer, S. M.↗
NASA NTRS1976

A nonlinear finite-element analysis of wings in steady incompressible flows with wake roll-up

The problem of lifting surfaces and complex aircraft configurations in steady incompressible flow is considered. For lifting surfaces the problem is formulated in terms of an integral equation relating the potential discontinuity on wing and wake to the normal derivative of the potential on the lifting surface. For complex configurations the problem is formulated in terms of an integral equation relating the potential to its normal derivative on the surface of the aircraft. The integral equation is approximated by a system of linear algebraic equations obtained by dividing the surfaces into small quadrilateral elements and by assuming the potential (or the potential discontinuity) and its normal derivative to be constant within each element. The wake geometry is obtained by iteration by satisfying the condition that the velocity be tangent to the surface of the wake and that the potential discontinuity be constant along the streamlines.

Suciu, E. O.↗
NASA NTRS1976

Mathematical formulation for the propagation of sound through a turbulent jet

The sound propagation through a nonuniform turbulent jet flow field is studied by means of a system of linearized equations governing the acoustic variables. These equations depend on the fluctuating flow-field variables which can be prescribed by experimental results. It is shown that the correlations of the acoustic variables depend throughout the flow field on the space-time correlation of the turbulent velocities and on the mean flow variables and their gradients.

Gunzburger, M.↗
NASA NTRS1977

Timing formulas for dissection algorithms on vector computers

The use of the finite element and finite difference methods often leads to the problem of solving large, sparse, positive definite systems of linear equations. MACSYMA plays a major role in the generation of formulas representing the time required for execution of the dissection algorithms. The use of MACSYMA in the generation of those formulas is described.

Poole, W. G., Jr.↗
NASA NTRS1977

Effect of virtual memory on efficient solution of two model problems

Computers with virtual memory architecture allow programs to be written as if they were small enough to be contained in memory. Two types of problems are investigated to show that this luxury can lead to quite an inefficient performance if the programmer does not interact strongly with the characteristics of the operating system when developing the program. The two problems considered are the simultaneous solutions of a large linear system of equations by Gaussian elimination and a model three-dimensional finite-difference problem. The Control Data STAR-100 computer runs are made to demonstrate the inefficiencies of programming the problems in the manner one would naturally do if the problems were indeed, small enough to be contained in memory. Program redesigns are presented which achieve large improvements in performance through changes in the computational procedure and the data base arrangement.

Lambiotte, J. J., Jr.↗
NASA NTRS1977

Nonlinear steady incompressible lifting-surface analysis with wake roll-up

The problem of lifting surfaces in steady incompressible flow is considered in terms of an integral equation relating the potential discontinuity on wing and wake to the normal derivative of the potential (normal wash) on the lifting surface. The integral equation is approximated by a system of linear algebraic equations obtained by dividing the surfaces into small quadrilateral elements and by assuming the potential discontinuity and the normal wash to be constant within each element. The wake geometry is obtained through iteration by satisfying the condition that the velocity be tangent to the surface of the wake and that the potential discontinuity be constant along the streamlines. Numerical results are in good agreement with existing ones

Suciu, E. O.↗
NASA NTRS1977

Perfect decoupling of linear systems with discrete parameter uncertainties

A design procedure based on Gilbert's decoupling parameters for determining a fixed state feedback control law which decouples a linear system with discrete parameter uncertainties is described. Perfect decoupling conditions are established which involve a test for the existence of a solution to a system of linear equations. An actual solution of the linear equations yields the decoupling control law.

Dorato, P.↗
NASA NTRS1978

Radiative transfer calculated from a Markov chain formalism

The theory of Markov chains is used to formulate the radiative transport problem in a general way by modeling the successive interactions of a photon as a stochastic process. Under the minimal requirement that the stochastic process is a Markov chain, the determination of the diffuse reflection or transmission from a scattering atmosphere is equivalent to the solution of a system of linear equations. This treatment is mathematically equivalent to, and thus has many of the advantages of, Monte Carlo methods, but can be considerably more rapid than Monte Carlo algorithms for numerical calculations in particular applications. We have verified the speed and accuracy of this formalism for the standard problem of finding the intensity of scattered light from a homogeneous plane-parallel atmosphere with an arbitrary phase function for scattering. Accurate results over a wide range of parameters were obtained with computation times comparable to those of a standard 'doubling' routine. The generality of this formalism thus allows fast, direct solutions to problems that were previously soluble only by Monte Carlo methods. Some comparisons are made with respect to integral equation methods.

Esposito, L. W.↗
NASA NTRS1981

STAR adaptation of QR algorithm

The QR algorithm used on a serial computer and executed on the Control Data Corporation 6000 Computer was adapted to execute efficiently on the Control Data STAR-100 computer. How the scalar program was adapted for the STAR-100 and why these adaptations yielded an efficient STAR program is described. Program listings of the old scalar version and the vectorized SL/1 version are presented in the appendices. Execution times for the two versions applied to the same system of linear equations, are compared.

Shah, S. N.↗
NASA NTRS1982

Acceleration of convergence of vector sequences

A general approach to the construction of accelerated convergence methods for vector sequences is proposed. A simplified version of minimal polynomial extrapolation is emphasized. The convergence of this method is analyzed and it is shown that it is especially suitable for accelerating the convergence of vector sequences that are obtained when one solves linear systems of equations iteratively.

Sidi, A.↗