Transient vibration analysis of linear systems using transition matrices
Transient vibration analysis of liner systems using transition matrices
SEARCH · Engineering Papers
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.
Transient vibration analysis of liner systems using transition matrices
FORTRAN 4 program for analysis and design of dynamic systems
Computer control of nonlinear systems with varying performance specifications, using Popov stability and nonlinear programming
Lifting reentry vehicle two dimensional motion optimization with inequality constraints explicitly containing control by perturbation method
Abstract missing.
A full order adaptive observer is described for observing the states of a single-input single-output observable continuous differential system with unknown parameters. Convergence of the observer states to those of the system is accomplished by directly changing the parameters of the observer using an adaptive law based upon Liapunov stability theory. Observer eigenvalues may be freely chosen. Some restriction is placed upon the system input in that it must be sufficiently rich in frequencies in order to insure convergence.
A full order adaptive observer is described for observing the state of a single-input single-output observable continuous differential system with unknown parameters. Convergence of the observer states to those of the system is accomplished by directly changing the parameters of the observer using an adaptive law based upon Lyapunov stability theory. Observer eigenvalues may be freely chosen. Some restriction is placed upon the system input in that it must be sufficiently rich in frequencies in order to insure convergence.
A square root information filter/smoother is derived using recursive least-squares arguments. The combined filter/smoother algorithm has the following attributes: (1) it has a square root structure, which enhances numerical accuracy; (2) filter and smoother mechanizations are identical in form, facilitating implementation of the smoother; and (3) storage and computation requirements are modest compared with other smoothing algorithms. Partitioning the results to separate bias parameters provides further computational economies and reduction of storage requirements.
The problem is posed with the additional constraints that the dynamic controller uses only noise-corrupted outputs, and that its dimension is significantly lower than that of a Kalman filter. The unknown disturbance is viewed as an adversary which tries to maximize a performance criterion: a criterion that the controller gains attempt to minimize. The optimal controller gains are determined by solving a nonlinear matrix two-point boundary value problem.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
In this recursive method proposed, the gain matrix for the Kalman filter and the convariance of the state vector are computed not via the Riccati equation, but from certain other equations. These differential equations are of Chandrasekhar-type. The 'invariant imbedding' idea resulted in the reduction of the basic boundary value problem of transport theory to an equivalent initial value system, a significant computational advance. Initial value experience showed that there is some computational savings in the method and the loss of positive definiteness of the covariance matrix is less vulnerable.
Time delays in the mathematical description of a physical system occur whenever the system is affected not only by conditions at the present time, but also by conditions which have occurred in the past. The tau-decomposition method, as refined by Lee and Hsu, is a method for studying the effects of time delay on the stability of retarded dynamical systems. In this paper, the method is extended to examine the stability and relative stability of: (1) retarded systems with many time delays; and (2) a class of neutral systems with one delay. Applications are included which illustrate the power of the technique.
The cases of both additive and multiplicative perturbations were discussed and a number of relationships between the two cases were given. A number of computational aspects of the theory were also discussed, including a proposed new method for evaluating general transfer or frequency response matrices. The new method is numerically stable and efficient, requiring only operations to update for new values of the frequency parameter.
A coefficient-assignability theorem is presented for systems defined over a commutative ring with 1. The conditions examined include all the general results on coefficient-assignability available in the literature. It is concluded that the proposed techniques are not effective for the case of the weaker property of pole placement when it is assumed that the commutative ring is a PID. Morse's well-known theorem seems to be the best result available for this situation.
The computer program known as QR is described. Classical control systems analysis and synthesis (root locus, time response, and frequency response) can be performed using this program. Programming details of the QR program are presented.
The QR computer program is described as well as its use in classical control systems analysis and synthesis (root locus, time response, and frequency response).
A means is provided to assess the value or 'cst' of each component of a large scale system, when the total cost is a quadratic function. Such a 'cost decomposition' of the system has several important uses. When the components represent physical subsystems which can fail, the 'component cost' is useful in failure mode analysis. When the components represent mathematical equations which may be truncated, the 'component cost' becomes a criterion for model truncation. In this latter event component costs provide a mechanism by which the specific control objectives dictate which components should be retained in the model reduction process. This information can be valuable in model reduction and decentralized control problems.