Search NASA⌕ Search

SEARCH · Search NASA

Results for “LINEAR SYSTEM”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1974

Sequential square root filtering and smoothing of discrete linear systems

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.

Bierman, G. J.↗
NASA NTRS1975

Constrained optimal controller for linear systems with state and control dependent disturbance

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.

Basuthakur, S.↗
NASA NTRS1975

Chandrasekhar-type algorithms for fast recursive estimation in linear systems with constant parameters

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.

Choudhury, A. K.↗
NASA NTRS1977

Stability analysis for linear systems with time delays

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.

Barker, L. K.↗
NASA NTRS1979

Robust stability of linear systems: Some computational considerations

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.

Laub, A. J.↗
NASA NTRS1979

Feedback invariants for linear systems defined over rings

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.

Byrnes, C. I.↗
NASA NTRS1980

Cost decomposition of linear systems with application to model reduction

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.

Skelton, R. E.↗
NASA NTRS1981

A nonparametric identification method for a class of non-linear systems

A relatively simple nonparametric method for the identification of a class of close-coupled nonlinear multi-degree-of-freedom systems has been developed. The identification of arbitrary memoryless nonlinearities is possible through knowledge of the accelerations, velocities, and displacements of the various masses. These quantities are used to obtain the surfaces of the restoring forces as functions of the intermass displacements and velocities. The method was demonstrated by application to a four-degree-of-freedom system to identify the restoring forces. It is found that the identification results are relatively insensitive to measurement noise.

Udwadia, F. E.↗
NASA NTRS1982

Response control for fatigue testing of non-linear systems

A signal conditioner which ensures that peak and low values during vibration testing are not lost during nonlinear or asymmetric vibration testing on small structures is described. The trapped signals may be for acceleration, velocity, or displacement. The test signal is sent through an analog circuit to a multiplexer, which resets to zero each time a zero-line is crossed by another incoming signal. Peak positive and negative amplitude and frequency are retained and nonsymmetric responses are thus detected, rather than averaged out.

Gowdey, J. C.↗
NASA NTRS1983

Symmetric linear systems

Employment as a means of transportation in the civilian construction trades represents one of the many applications of the helicopter. However, a major limitation to its use in heavy construction has been that the mass which can be effectively and safely transported is severely restricted. The construction of the so-called 'heavy lift' helicopter provided one solution to this problem. But it has been found that there are physical and economic limitations to the payload which can be transported. The proposal has been made to overcome these limitations by making use of multiple helicopters to move a single mass. A study of the feasibility of this proposal showed that automatic control would be needed to make the concept successful. The present investigation is concerned with some initial models in regard to the twinlift problem, taking into account the control theoretic problems.

Lewis, J.↗
NASA NTRS1986

Communications oriented programming of parallel iterative solutions of sparse linear systems

Parallel algorithms are developed for a class of scientific computational problems by partitioning the problems into smaller problems which may be solved concurrently. The effectiveness of the resulting parallel solutions is determined by the amount and frequency of communication and synchronization and the extent to which communication can be overlapped with computation. Three different parallel algorithms for solving the same class of problems are presented, and their effectiveness is analyzed from this point of view. The algorithms are programmed using a new programming environment. Run-time statistics and experience obtained from the execution of these programs assist in measuring the effectiveness of these algorithms.

Patrick, M. L.↗
NASA NTRS1989

Solving sparse triangular linear systems on parallel computers

This paper describes and compares three parallel algorithms for solving sparse triangular systems of equations. These methods involve some preprocessing overhead and are primarily of interest in solving many systems with the same coefficient matrix. The first approach is to use a fixed blocksize and form the inverse of the diagonal blocks. The second approach is to use a variable blocksize and reorder the unknowns so that the diagonal blocks are diagonal matrices. The latter technique is called level scheduling because of how it is represented in the adjacency graph, and both row-wise and jagged diagonal storage for the off-diagonal blocks are considered. These techniques are analyzed for general parallel computers and experiments are presented for the eight-processor Alliant FX/8.

Anderson, Edward↗