Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “MATRICES”

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 811 records · Page 45

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.↗

An extension of the QZ algorithm for solving the generalized matrix eigenvalue problem

This algorithm is an extension of Moler and Stewart's QZ algorithm with some added features for saving time and operations. Also, some additional properties of the QR algorithm which were not practical to implement in the QZ algorithm can be generalized with the combination shift QZ algorithm. Numerous test cases are presented to give practical application tests for algorithm. Based on results, this algorithm should be preferred over existing algorithms which attempt to solve the class of generalized eigenproblems where both matrices are singular or nearly singular.

Ward, R. C.↗

SYMAT, COVAR: Test Procedures for Matrix Calculations

The FORTRAN subroutine SYMAT and related subroutines are described. In essence SYMAT is an iterative algorithm in which the problem of finding eigenvalues and eigenvectors of a real symmetric matrix is transformed into an equivalent problem of finding eigenvalues and eigenvectors of an infinite sequence of matrices of order two. A DEMO PROGRAM contains a subroutine COVAR which is used to compute the covariance matrix (denoted by A) of a data matrix (denoted by X). Since a covariance matrix is symmetric it can be analyzed by using subroutine SYMAT.

Morris, W. L.↗

Matrix equations of radiation diffusion, 4

The matrices A sup (-1) and T (tau sub O = 0.1 - 1.0) are tabulated, permitting a source function and emission line profile to be easily calculated. It is assumed that the radiation diffuses with complete redistribution in frequency.

Kostyk, R. I.↗

Matrix Perturbation Techniques in Structural Dynamics

Matrix perturbation are developed techniques which can be used in the dynamical analysis of structures where the range of numerical values in the matrices extreme or where the nature of the damping matrix requires that complex valued eigenvalues and eigenvectors be used. The techniques can be advantageously used in a variety of fields such as earthquake engineering, ocean engineering, aerospace engineering and other fields concerned with the dynamical analysis of large complex structures or systems of second order differential equations. A number of simple examples are included to illustrate the techniques.

Caughey, T. K.↗

Analysis and optimization of cyclic methods in orbit computation

The mathematical analysis and computation of the K=3, order 4; K=4, order 6; and K=5, order 7 cyclic methods and the K=5, order 6 Cowell method and some results of optimizing the 3 backpoint cyclic multistep methods for solving ordinary differential equations are presented. Cyclic methods have the advantage over traditional methods of having higher order for a given number of backpoints while at the same time having more free parameters. After considering several error sources the primary source for the cyclic methods has been isolated. The free parameters for three backpoint methods were used to minimize the effects of some of these error sources. They now yield more accuracy with the same computing time as Cowell's method on selected problems. This work is being extended to the five backpoint methods. The analysis and optimization are more difficult here since the matrices are larger and the dimension of the optimizing space is larger. Indications are that the primary error source can be reduced. This will still leave several parameters free to minimize other sources.

Pierce, S.↗

Reduction of truncation errors in modal analysis

A condensation method and computer program are described for large discrete parameter vibration analysis of complex structures that greatly reduces truncation errors and provides accurate definition of modes in a selected frequency range. A dynamic transformation is obtained from the partitioned equations of motion that relates modes not explicitly in the condensed solution to the retained modes at a selected system frequency. The generalized mass and stiffness matrices, obtained with existing modal synthesis methods, are reduced using this transformation and solved. Revised solutions are then obtained using new transformations at the calculated eigenvalues and are also used to assess the accuracy of the results. Computations are made tractable by simplified forms of the transformation that result with various modal synthesis methods. Three examples using the dynamic transformation in conjunction with a General Electric stiffness coupling method and the method of Craig and Bampton indicate large reductions in truncation errors and demonstrate the method for sequential groups of modes.

Kuhar, E. J.↗

Round-off errors in cutting plane algorithms based on the revised simplex procedure

This report statistically analyzes computational round-off errors associated with the cutting plane approach to solving linear integer programming problems. Cutting plane methods require that the inverse of a sequence of matrices be computed. The problem basically reduces to one of minimizing round-off errors in the sequence of inverses. Two procedures for minimizing this problem are presented, and their influence on error accumulation is statistically analyzed. One procedure employs a very small tolerance factor to round computed values to zero. The other procedure is a numerical analysis technique for reinverting or improving the approximate inverse of a matrix. The results indicated that round-off accumulation can be effectively minimized by employing a tolerance factor which reflects the number of significant digits carried for each calculation and by applying the reinversion procedure once to each computed inverse. If 18 significant digits plus an exponent are carried for each variable during computations, then a tolerance value of 0.1 x 10 to the minus 12th power is reasonable.

Moore, J. E.↗

On propagation of long waves in curved ducts.

A two-dimensional detailed study of the behavior of long waves in curved ducts and in junctions between straight and curved ducts will be given. The mathematical treatment of the problem utilizes the method of separation variables. Solutions and expressions for principal mode of the wave are obtained by using the linearized equation of motion solved for its characteristic values. The unavoidable approximations in the numerical solutions of the cylindrical functions are due to use of series expansion of Bessel functions and from restrictions necessary to solve infinite matrices.

Rostafinski, W.↗

Further results on the stagnation point boundary layer with hydrogen injection.

The results of an earlier paper on the behavior of the boundary layer at an axisymmetric stagnation with hydrogen injection into a hot external airstream are extended to span the entire range from essentially frozen to essentially equilibrium flow. This extension is made possible by the employment of finite difference methods; the accurate treatment of the boundary conditions at 'infinity,' the differencing technique employed and the formulation resulting in block tri-diagonal matrices are slight variants in the present work.

Wu, P.↗

Matrix operator theory of radiative transfer. I - Rayleigh scattering.

An entirely rigorous method for the solution of the equations for radiative transfer based on the matrix operator theory is reviewed. The advantages of the present method are: (1) all orders of the reflection and transmission matrices are calculated at once; (2) layers of any thickness may be combined, so that a realistic model of the atmosphere can be developed from any arbitrary number of layers, each with different properties and thicknesses; (3) calculations can readily be made for large optical depths and with highly anisotropic phase functions; (4) results are obtained for any desired value of the surface albedo including the value unity and for a large number of polar and azimuthal angles; (5) all fundamental equations can be interpreted immediately in terms of the physical interactions appropriate to the problem; and (6) both upward and downward radiance can be calculated at interior points from relatively simple expressions.

Plass, G. N.↗

Solution of quadratic matrix equations for free vibration analysis of structures.

An efficient digital computer procedure and the related numerical algorithm are presented herein for the solution of quadratic matrix equations associated with free vibration analysis of structures. Such a procedure enables accurate and economical analysis of natural frequencies and associated modes of discretized structures. The numerically stable algorithm is based on the Sturm sequence method, which fully exploits the banded form of associated stiffness and mass matrices. The related computer program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be substantially more accurate and economical than other existing procedures of such analysis. Numerical examples are presented for two structures - a cantilever beam and a semicircular arch.

Gupta, K. K.↗

Equivalence of quadratic performance criteria.

Necessary and sufficient conditions are derived in terms of system parameters and quadratic weighting matrices for two quadratic cost functionals that are defined to be equivalent if they generate the same optimal control law. The derived conditions lie between the conditions of Tanaka and Asai (1971) and those of Kreindler and Hedrick (1970). Sufficient conditions for a vector valued function to attain an infimum are stated.

Martin, C.↗

A dynamic transformation method for modal synthesis.

This paper presents a condensation method for large discrete parameter vibration analysis of complex structures that greatly reduces truncation errors and provides accurate definition of modes in a selected frequency range. A dynamic transformation is obtained from the partitioned equations of motion that relates modes not explicity in the condensed solution to the retained modes at a selected system frequency. The generalized mass and stiffness matrices, obtained with existing modal synthesis methods, are reduced using this transformation and solved. Revised solutions are then obtained using new transformations at the calculated eigenvalues and are also used to assess the accuracy of the results. If all the modes of interest have not been obtained, the results are used to select a new set of retained coordinates and a new transformation frequency, and the procedure is repeated for another group of modes.

Kuhar, E. J.↗

Electromagnetic fields due to dipole antennas over stratified anisotropic media.

Solutions to the problem of radiation of dipole antennas in the presence of a stratified anisotropic media are facilitated by decomposing a general wave field into transverse magnetic (TM) and transverse electric (TE) modes. Employing the propagation matrices, wave amplitudes in any region are related to those in any other regions. The reflection coefficients, which embed all the information about the geometrical configuration and the physical constituents of the medium, are obtained in closed form. In view of the general formulation, various special cases are discussed.

Kong, J. A.↗

A geometric theory for the QR, LU and power iterations.

Consideration of the task of computing the invariant subspaces of a given matrix. For this purpose the LU, QR, treppen and bi-iterations have been presented, used, and studied more or less independently of the old-fashioned power method. Each of these methods generates implicitly a sequence of subspaces which determines the convergence properties of the method. The iterations differ in the way in which a basis is constructed to represent each subspace. This aspect largely determines the usefulness of the method. It is shown that the first four iterations produce exactly the same sequence of subspaces as do direct and inverse iteration started from appropriate subspaces. Their convergence properties are therefore the same, and a complete geometric convergence theory is presented in terms of the power method. It is shown that Hessenberg matrices are associated with ideal starting spaces.

Parlett, B. N.↗

Development of polyphenylquinoxaline graphite composites.

The potential of polyphenylquinoxaline (PPQ)/graphite composites to serve as structural material at 316 C (600 F) has been demonstrated using a block copolymer, BICo(1:3), PPQ derivative. Initially, 13 polyphenylquinoxalines were evaluated. From this work, four candidate polymers were selected for preliminary evaluation as matrices for HMS graphite fiber reinforced composites. The preliminary composite evaluation enabled selection of one of the four polymers for advanced composite preparation and testing. Using an experimentally established cure schedule for each of the four polymers, preliminary laminates of 50% resin volume content, prepared without postcure, were tested for flexure strength and modulus, interlaminar shear strength (short beam), tensile strength, and modulus of ambient temperature. The potential of PPQ/graphite laminates to serve as short term structural materials at temperatures up to 371 C (700 F) was demonstrated through weight loss experiments.

Shdo, J. G.↗