Least Squares Matrix Algorithm for State-Space Modelling of Dynamic Systems

HTML  Download Download as PDF (Size: 427KB)  PP. 287-291  
DOI: 10.4236/jsip.2011.24041    5,092 Downloads   9,152 Views  Citations

Affiliation(s)

.

ABSTRACT

This work presents a novel least squares matrix algorithm (LSM) for the analysis of rapidly changing systems using state-space modelling. The LSM algorithm is based on the Hankel structured data matrix representation. The state transition matrix is updated without the use of any forgetting function. This yields a robust estimation of model parameters in the presence of noise. The computational complexity of the LSM algorithm is comparable to the speed of the conventional recursive least squares (RLS) algorithm. The knowledge of the state transition matrix enables feasible numerical operators such as interpolation, fractional differentiation and integration. The usefulness of the LSM algorithm was proved in the analysis of the neuroelectric signal waveforms.

Share and Cite:

J. Olkkonen and H. Olkkonen, "Least Squares Matrix Algorithm for State-Space Modelling of Dynamic Systems," Journal of Signal and Information Processing, Vol. 2 No. 4, 2011, pp. 287-291. doi: 10.4236/jsip.2011.24041.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.