Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “MATRIX NOTATION”

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 19 records

A numerical method for determining the natural vibration characteristics of rotating nonuniform cantilever blades

A method is presented for determining the free vibration characteristics of a rotating blade having nonuniform spanwise properties and cantilever boundary conditions. The equations which govern the coupled flapwise, chordwise, and torsional motion of such a blade are solved using an integrating matrix method. By expressing the equations of motion and matrix notation, utilizing the integrating matrix as an operator, and applying the boundary conditions, the equations are formulated into an eigenvalue problem whose solutions may be determined by conventional methods. Computer results are compared with experimental data.

White, W. F., Jr.↗

Two-dimensional integrating matrices on rectangular grids

The use of integrating matrices in solving differential equations associated with rotating beam configurations is examined. In vibration problems, by expressing the equations of motion of the beam in matrix notation, utilizing the integrating matrix as an operator, and applying the boundary conditions, the spatial dependence is removed from the governing partial differential equations and the resulting ordinary differential equations can be cast into standard eigenvalue form. Integrating matrices are derived based on two dimensional rectangular grids with arbitrary grid spacings allowed in one direction. The derivation of higher dimensional integrating matrices is the initial step in the generalization of the integrating matrix methodology to vibration and stability problems involving plates and shells.

Lakin, W. D.↗

Integrating matrix formulations for vibrations of rotating beams including the effects of concentrated masses

By expressing partial differential equations of motion in matrix notation, utilizing the integrating matrix as a spatial operator, and applying the boundary conditions, the resulting ordinary differential equations can be cast into standard eigenvalue form upon assumption of the usual time dependence. As originally developed, the technique was limited to beams having continuous mass and stiffness properties along their lengths. Integrating matrix methods are extended to treat the differential equations governing the flap, lag, or axial vibrations of rotating beams having concentrated masses. Inclusion of concentrated masses is shown to lead to the same kind of standard eigenvalue problem as before, but with slightly modified matrices.

Lakin, W. D.↗

Diffraction image formation in optical systems with polarization aberrations. I - Formulation and example

This paper is the first in a series that will examine image formation in optical systems with polarization aberrations. The present paper derives the point-spread function (PSF) and the optical transfer function for optical systems with polarization aberration and explores how image formation depends on the coherence and polarization state of the source. It is shown that the scalar PSF of Fourier optics can be generalized in the presence of polarization aberration to a 4 x 4 point-spread matrix (PSM) in Mueller matrix notation. A similar 4 x 4 optical transfer matrix (OTM) is shown to be an appropriate generalization of the optical transfer function. The PSM and the OTM are associated with the optical system and are independent of the incident polarization state but dependent on the coherence of the illumination. Since an optical system with polarization aberrations will have a different PSF and optical transfer function for different incident polarization states, the PSM and the OTM act as filters with regard to the incident polarization state. Example calculations are performed for a circularly retarding lens.

Mcguire, James P., Jr.↗

Population Control of Self-Replicating Systems: Option C

From the conception and development of the theory of self-replicating automata by John von Neumann, others have expanded on his theories. In 1980, Georg von Tiesenhausen and Wesley A. Darbro developed a report which is a "first' in presenting the theories in a conceptualized engineering setting. In that report several options involving self-replicating systems are presented. One of the options allows each primary to generate n replicas, one in each sequential time frame after its own generation. Each replica is limited to a maximum of m ancestors. This study involves determining the state vector of the replicas in an efficient manner. The problem is cast in matrix notation, where F = fij is a non-diagonalizable matrix. Any element fij represents the number of elements of type j = (c,d) in time frame k+1 generated from type i = (a,b) in time frame k. It is then shown that the state vector is: bar F(k)=bar F (non-zero) X F sub K = bar F (non-zero) xmx J sub kx m sub-1 where J is a matrix in Jordan form having the same eigenvalues as F. M is a matrix composed of the eigenvectors and the generalized eigenvectors of F.

Mccord, R. L.↗

A Chess-Like Game for Teaching Engineering Students to Solve Large System of Simultaneous Linear Equations

Solving large (and sparse) system of simultaneous linear equations has been (and continues to be) a major challenging problem for many real-world engineering/science applications [1-2]. For many practical/large-scale problems, the sparse, Symmetrical and Positive Definite (SPD) system of linear equations can be conveniently represented in matrix notation as [A] {x} = {b} , where the square coefficient matrix [A] and the Right-Hand-Side (RHS) vector {b} are known. The unknown solution vector {x} can be efficiently solved by the following step-by-step procedures [1-2]: Reordering phase, Matrix Factorization phase, Forward solution phase, and Backward solution phase. In this research work, a Game-Based Learning (GBL) approach has been developed to help engineering students to understand crucial details about matrix reordering and factorization phases. A "chess-like" game has been developed and can be played by either a single player, or two players. Through this "chess-like" open-ended game, the players/learners will not only understand the key concepts involved in reordering algorithms (based on existing algorithms), but also have the opportunities to "discover new algorithms" which are better than existing algorithms. Implementing the proposed "chess-like" game for matrix reordering and factorization phases can be enhanced by FLASH [3] computer environments, where computer simulation with animated human voice, sound effects, visual/graphical/colorful displays of matrix tables, score (or monetary) awards for the best game players, etc. can all be exploited. Preliminary demonstrations of the developed GBL approach can be viewed by anyone who has access to the internet web-site [4]!

Nguyen, Duc T.↗

Transfer-matrices for series-type microwave antenna circuits

Transfer matrices are developed which permit analysis and computer evaluation of certain series type microwave antenna circuits associated with an L-Band microwave radiometer (LBMR) under investigation at Goddard Space Flight Center. This radiometer is one of several diverse instrument designs to be used for the determination of soil moisture, sea state, salinity, and temperature data. Four port matrix notation is used throughout for the evaluation of LBMR circuits with mismatched couplers and lossy transmission lines. Matrix parameters in examples are predicted on an impedance analysis and an assumption of an array aperture distribution. The notation presented is easily adapted to longer and more varied chains of matrices, and to matrices of larger dimension.

Schmidt, R. F.↗

Monograph On Tensor Notations

Eight-page report describes systems of notation used most commonly to represent tensors of various ranks, with emphasis on tensors in Cartesian coordinate systems. Serves as introductory or refresher text for scientists, engineers, and others familiar with basic concepts of coordinate systems, vectors, and partial derivatives. Indicial tensor, vector, dyadic, and matrix notations, and relationships among them described.

Sirlin, Samuel W.↗

The matrix approach to cosmic-ray propagation including ionization energy loss

It is shown that the matrix notation is the natural one for describing cosmic ray propagation in the interstellar medium. This remains true even if energy dependent cross sections and energy loss by ionization is included. The solutions in this notation are in a form that leads directly to computational algorithms.

Jones, F. C.↗

An efficient method for computation of the manipulator inertia matrix

An efficient method of computation of the manipulator inertia matrix is presented. Using spatial notations, the method leads to the definition of the composite rigid-body spatial inertia, which is a spatial representation of the notion of augmented body. The previously proposed methods, the physical interpretations leading to their derivation, and their redundancies are analyzed. The proposed method achieves a greater efficiency by eliminating the redundancy in the intrinsic equations as well as by a better choice of coordinate frame for their projection. In this case, removing the redundancy leads to greater efficiency of the computation in both serial and parallel senses.

Fijany, Amir↗

Optical systolic array processor using residue arithmetic

The use of residue arithmetic to increase the accuracy and reduce the dynamic range requirements of optical matrix-vector processors is evaluated. It is determined that matrix-vector operations and iterative algorithms can be performed totally in residue notation. A new parallel residue quantizer circuit is developed which significantly improves the performance of the systolic array feedback processor. Results are presented of a computer simulation of this system used to solve a set of three simultaneous equations.

Jackson, J.↗

Review of LFTs, LMIs, and mu

The authors present a tutorial overview of linear fractional transformations (LFTs) and the role of the structured singular value, mu, and linear matrix inequalities (LMIs) in solving LFT problems. The authors first introduce the notation for LFTs and briefly discuss some of their properties. They then describe mu and its connections with LFTs. They focus on two standard notions of robust stability and performance, mu stability and performance and Q stability and performance, and their relationship is discussed. Comparisons with the L1 theory of robust performance with structured uncertainty are considered.

Doyle, John↗

Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models

We present a systematic discussion of algorithms to multiply a vector by a matrix expressed as the Kronecker product of sparse matrices, extending previous work in a unified notational framework. Then, we use our results to define new algorithms for the solution of large structured Markov models. In addition to a comprehensive overview of existing approaches, we give new results with respect to: (1) managing certain types of state-dependent behavior without incurring extra cost; (2) supporting both Jacobi-style and Gauss-Seidel-style methods by appropriate multiplication algorithms; (3) speeding up algorithms that consider probability vectors of size equal to the "actual" state space instead of the "potential" state space.

Buchholz, Peter↗