Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Eigenvalues and eigenvectors”

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 37 records · Page 2

On the design derivatives of eigenvalues and eigenvectors for distributed parameter systems

In this paper, analytic expressions are obtained for the design derivatives of eigenvalues and eigenfunctions of self-adjoint linear distributed parameter systems. Explicit treatment of boundary conditions is avoided by casting the eigenvalue equation into integral form. Results are expressed in terms of the linear operators defining the eigenvalue problem, and are therefore quite general. Sufficiency conditions appropriate to structural optimization of eigenvalues are obtained.

Reiss, R.↗

A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

Shroff, Gautam↗

Vlasov equation eigenvalues and eigenvectors for Fourier-Hermite dispersion matrices of order greater than 1,000

The connection between the Van Kampen and Landau representations of the Vlasov equations has been extended to Fourier-Hermite expansions containing more than 1000 terms by taking advantage of the properties of tridiagonal matrices. These numerical results are regarded as conclusive indications of the nonuniformly convergent behavior of the approximation curve in the limit of an infinite number of terms and represent an extension of work begun by Grant (1967) and by Grant and Feix (1967).

Grant, F. C.↗

The algebraic theory of latent projectors in lambda matrices

Multivariable systems such as a finite-element model of vibrating structures, control systems, and large-scale systems are often formulated in terms of differential equations which give rise to lambda matrices. The present investigation is concerned with the formulation of the algebraic theory of lambda matrices and the relationship of latent roots, latent vectors, and latent projectors to the eigenvalues, eigenvectors, and eigenprojectors of the companion form. The chain rule for latent projectors and eigenprojectors for the repeated latent root or eigenvalues is given.

Denman, E. D.↗

REQUEST: A Recursive QUEST Algorithm for Sequential Attitude Determination

In order to find the attitude of a spacecraft with respect to a reference coordinate system, vector measurements are taken. The vectors are pairs of measurements of the same generalized vector, taken in the spacecraft body coordinates, as well as in the reference coordinate system. We are interested in finding the best estimate of the transformation between these coordinate system.s The algorithm called QUEST yields that estimate where attitude is expressed by a quarternion. Quest is an efficient algorithm which provides a least squares fit of the quaternion of rotation to the vector measurements. Quest however, is a single time point (single frame) batch algorithm, thus measurements that were taken at previous time points are discarded. The algorithm presented in this work provides a recursive routine which considers all past measurements. The algorithm is based on on the fact that the, so called, K matrix, one of whose eigenvectors is the sought quaternion, is linerly related to the measured pairs, and on the ability to propagate K. The extraction of the appropriate eigenvector is done according to the classical QUEST algorithm. This stage, however, can be eliminated, and the computation simplified, if a standard eigenvalue-eigenvector solver algorithm is used. The development of the recursive algorithm is presented and illustrated via a numerical example.

Bar-Itzhack, Itzhack Y.↗

Spectral factorization in periodically time-varying systems and application to navigation problems.

Spectral factorization has been used previously to derive the steady-state solution of Kalman filtering equations without iteration for constant coefficient systems. The present work extends the spectral factorization algorithm to time-varying systems having periodic coefficient matrices for cases of both discrete and continuous systems. Time-consuming, expensive iterations of sequential covariance equations are not required to reach the final solution since this is an algebraic algorithm employing existing eigenvalue, eigenvector subroutines. The computer program incorporating the algorithm is suitable for sensitivity studies in formulating navigation and guidance strategies of low-thrust interplanetary missions. The determination of an optimum tracking pattern from an earth station is examined as an example.

Nishimura, T.↗

Appendage modal coordinate truncation criteria in hybrid coordinate dynamic analysis

The paper examines the validity of the assumption that certain appendage-distributed (modal) coordinates can be truncated from a system model without unacceptable degradation of fidelity in hybrid coordinate dynamic analysis for attitude control of spacecraft with flexible appendages. Alternative truncation criteria are proposed and their interrelationships defined. Particular attention is given to truncation criteria based on eigenvalues, eigenvectors, and controllability and observability. No definitive resolution of the problem is advanced, and exhaustive study is required to obtain ultimate truncation criteria.

Likins, P.↗

The application of the Routh approximation method to turbofan engine models

The Routh approximation technique is applied in the frequency domain to a 16th order state variable turbofan engine model. The results obtained motivate the extension of the frequency domain formulation of the Routh method to the time domain to handle the state variable formulation directly. The time domain formulation is derived, and a characterization, which specifies all possible Routh similarity transformations, is given. The characterization is computed by the solution of two eigenvalue eigenvector problems. The application of the time domain Routh technique to the state variable engine model is described, and some results are given.

Merrill, W. C.↗

Applied Routh approximation

The Routh approximation technique for reducing the complexity of system models was applied in the frequency domain to a 16th order, state variable model of the F100 engine and to a 43d order, transfer function model of a launch vehicle boost pump pressure regulator. The results motivate extending the frequency domain formulation of the Routh method to the time domain in order to handle the state variable formulation directly. The time domain formulation was derived and a characterization that specifies all possible Routh similarity transformations was given. The characterization was computed by solving two eigenvalue-eigenvector problems. The application of the time domain Routh technique to the state variable engine model is described, and some results are given. Additional computational problems are discussed, including an optimization procedure that can improve the approximation accuracy by taking advantage of the transformation characterization.

Merrill, W. C.↗

The application of the Routh approximation method to turbofan engine models

The Routh approximation technique is applied in the frequency domain to a 16th order state variable turbofan engine model. The results obtained motivate the extension of the frequency domain formulation of the Routh method to the time domain to handle the state variable formulation directly. The time domain formulation is derived and a new characterization, which specifies all possible Routh similarity transformations, is given. This characterization is computed by the solution of two eigenvalue-eigenvector problems. The application of the time domain Routh technique to the state variable engine model is described and some results are given. Additional computational problems are discussed including an optimization procedure which can improve the approximation accuracy by taking advantage of the transformation characterization.

Merrill, W. C.↗

Coefficient matrices for implicit finite difference solution of the inviscid fluid conservation law equations

Although the Navier-Stokes equations describe most flows of interest in aerodynamics, the inviscid conservation law equations may be used for small regions with viscous forces. Thus, Euler equations and several time-accurate finite difference procedures, explicit and implicit, are discussed. Although implicit techniques require more computational work, they permit larger time steps to be taken without instability. It is noted that the Jacobian matrices for Euler equations in conservation-law form have certain eigenvalue-eigenvector properties which may be used to construct conservative-form coefficient matrices. This reduces the computation time of several implicit and semiimplicit schemes. Extensions of the basic approach to other areas are suggested.

Steger, J. L.↗

Research on the application of a decoupling algorithm for structure analysis

The mathematical theory for decoupling mth-order matrix differential equations is presented. It is shown that the decoupling precedure can be developed from the algebraic theory of matrix polynomials. The role of eigenprojectors and latent projectors in the decoupling process is discussed and the mathematical relationships between eigenvalues, eigenvectors, latent roots, and latent vectors are developed. It is shown that the eigenvectors of the companion form of a matrix contains the latent vectors as a subset. The spectral decomposition of a matrix and the application to differential equations is given.

Denman, E. D.↗

Multivariable identification using centralized fixed modes

A procedure to determine a state space model of a multivariable system (lambda inputs, m outputs) is presented. The model is suitable for control studies and uses single input, single output (SISO) system data in the identification procedure. The procedure can be defined in three distinct steps. First, the system's lambda x m SISO transfer functions are identified by using any standard or known identification technique for SISO systems. One objective of this step is to identify SISO transfer functions with as few distinct modes as possible between any two functions. Second, the time domain realization of each SISO transfer function is obtained in a straightforward manner and combined into a total multivariable realization. This total realization, in all probability, has more state variables than are required to define system response. In the third step, these excess or redundant states are removed by using minimal realization theory. The remaining states are related to system centralized fixed modes. Eigenvalue-eigenvector techniques were recently reported that yield a computationally feasible solution to the problem posed in step three. The procedure is applied to QCSEE data to demonstrate its feasibility.

Merrill, W. C.↗

AESOP: An interactive computer program for the design of linear quadratic regulators and Kalman filters

AESOP is a computer program for use in designing feedback controls and state estimators for linear multivariable systems. AESOP is meant to be used in an interactive manner. Each design task that the program performs is assigned a "function" number. The user accesses these functions either (1) by inputting a list of desired function numbers or (2) by inputting a single function number. In the latter case the choice of the function will in general depend on the results obtained by the previously executed function. The most important of the AESOP functions are those that design,linear quadratic regulators and Kalman filters. The user interacts with the program when using these design functions by inputting design weighting parameters and by viewing graphic displays of designed system responses. Supporting functions are provided that obtain system transient and frequency responses, transfer functions, and covariance matrices. The program can also compute open-loop system information such as stability (eigenvalues), eigenvectors, controllability, and observability. The program is written in ANSI-66 FORTRAN for use on an IBM 3033 using TSS 370. Descriptions of all subroutines and results of two test cases are included in the appendixes.

Lehtinen, B.↗