APPLICATION OF MULTIPLE REGRESSION ANALYSIS TO IDENTIFICATION OF TIME-VARYING LINEAR DYNAMIC SYSTEMS
Determining the dynamic response characteristics of time-varying linear systems
SEARCH · Search NASA
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.
Determining the dynamic response characteristics of time-varying linear systems
We construct a discretization of the phase portrait of a 3-dimensional dynamical system of biochemical kinetics with piecewise linear right-hand sides. We describe geometry of the phase portrait and construct an invariant piecewise linear surface bounded by a stable cycle of this system composed of eight linear segments.
Multiparameter optimum damping for harmonically excited linear stable strictly dissipative n degrees of freedom system, locating multivariable saddle points
A method is derived for digital computer simulation of linear time-invariant systems when the insignificant eigenvalues involved in such systems are eliminated by an ALSAP root removal technique. The method is applied to a thirteenth-order dynamic system representing a passive RLC network.
Consider the situation in which the unknown parameters of a stationary linear system may be parametrized by a set of unknown parameters. The question thus arises of when such a set of parameters can be uniquely identified on the basis of observed data. This problem is considered here both in the case of input and output observations and in the case of output observations in the presence of a white noise input. Conditions for local identifiability are derived for both situations and a sufficient condition for global identifiability is given for the former situation, i.e., when simultaneous input and output observations are available.
A classical reduced order model for dynamical problems involves spatial reduction of the problem size. However, temporal reduction accompanied by the spatial reduction can further reduce the problem size without losing much accuracy, which results in a considerably more speed-up than the spatial reduction only. Recently, a novel space–time reduced order model for dynamical problems has been developed [17], where the space–time reduced order model shows an order of a hundred speed-up with a relative error of 10 –4 for small academic problems. However, in order for the method to be applicable to a large-scale problem, an efficient space–time reduced basis construction algorithm needs to be developed. Here we present the incremental space–time reduced basis construction algorithm. The incremental algorithm is fully parallel and scalable. Additionally, the block structure in the space–time reduced basis is exploited, which enables the avoidance of constructing the reduced space–time basis. These novel techniques are applied to a large-scale particle transport simulation with million and billion degrees of freedom. The numerical example shows that the algorithm is scalable and practical. Also, it achieves a tremendous speed-up, maintaining a good accuracy. Finally, error bounds for space-only and space–time reduced order models are derived.
Not Available
Prediction of ozone (O3) and PM10 is very important as both these air pollutants affect human health, human activities and more. Short-term forecasting of air quality is needed as preventive measures and effective action can be taken. Therefore, if it is detected that the ozone data is of a chaotic dynamical systems, a model using the nonlinear dynamic from chaos theory data can be made and thus forecasts for the short term would be more accurate. This study uses two methods, namely the 0-1 Test and Lyapunov Exponent. In addition, the effect of noise reduction on the analysis of time series data will be seen by using two smoothing methods: Rectangular methods and Triangle methods. At the end of the study, recommendations were made to get better results in the future.
Nonlinear dynamical systems research on systems stability, invariance principles, Liapunov functions, and Volterra and functional integral equations
Numerous models of physical systems contain parameters whose values are not known exactly. The physical and mathematical complexities arising in the prediction of the statistical behavior of such systems are discussed. Although the discussions are far from providing a satisfactory solution to such problems, they perhaps, by utilization of simple examples, will create a greater awareness of the statistical effect of random parameters.
Abstract Not Provided
Abstract not provided.
ABSTRACT: This article gives two graph-based algorithms for radioactive decay computation. The first algorithm identifies the connected components of the graph induced from the given radioactive decay dynamics to reduce the size of the problem. The solutions are derived over the precalculated connected components, respectively and independently. The second algorithm utilizes acyclic structure of radioactive decay dynamics. The algorithm evaluates the reachable vertices of the induced system graph from the initially activated vertices and finds the minimal set of starting vertices populating the entire reachable vertices. Then, the decay calculations are performed over the reachable vertices from the identified minimal starting vertices, respectively, with the partitioned initial value over the reachable vertices. A formal argument is given to show that the proposed graph inspired divide and conquer calculation methods perform the intended radioactive decay calculation. Empirical efforts comparing the proposed radioactive decay calculation algorithms are presented.
Linear dynamic systems state estimation, using empirical Bayes decision theory to develop filter set
Equilibria stability of linear discrete dynamic systems involving elastic, nonconservative, dissipative and gyroscopic forces, using Liapunov-type energy method
Smoothing equations for a linear continuous dynamic system with linear discrete measurements, derived from the discrete results of Rauch, Tung, and Striebel (1965), (R-T-S), are used to extend, through recursive updating, the previously published results of Bryson and Frazier (1963), (B-F), and yield a modified Bryson and Frazier, (M-B-F), algorithm. A comparison of the (M-B-F) and (R-T-S) algorithms leads to the conclusion that the former is to be preferred because it entails less computation, less storage, and less instability. It is felt that the presented (M-B-F) smoothing algorithm is a practical mechanization and should be of value in smoothing discretely observed dynamic linear systems.
A non-linear dynamic compensation subsystem is added in the feedback loop of a high precision optical mirror positioning control system to smoothly alter the control system response bandwidth from a relatively wide response bandwidth optimized for speed of control system response to a bandwidth sufficiently narrow to reduce position errors resulting from the quantization noise inherent in the inductosyn used to measure mirror position. The non-linear dynamic compensation system includes a limiter for limiting the error signal within preselected limits, a compensator for modifying the limiter output to achieve the reduced bandwidth response, and an adder for combining the modified error signal with the difference between the limited and unlimited error signals. The adder output is applied to control system motor so that the system response is optimized for accuracy when the error signal is within the preselected limits, optimized for speed of response when the error signal is substantially beyond the preselected limits and smoothly varied therebetween as the error signal approaches the preselected limits.