Sequential least-squares prediction based on spectral analysis
- 1 January 1972
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 3 (1) , 257-270
- https://doi.org/10.1080/00207167208803066
Abstract
A spectral representation for time series analysis is formulated on the basis of classical least-squares theory, and is extended for application to the prediction of a random sequence with a sequential updating of model coefficients based on pre-computed eigenvector components and current online data. The solution for updating the time series coefficients is shown to be directly analogous to the form of piecewise solution of the steady-state electrical network problem based on Kron's method of tearing and interconnection. The sensitivity of the spectral prediction algorithm based on the eigenvalue properties of the defining covariance data matrix is also developed.Keywords
This publication has 10 references indexed in Scilit:
- Eigenvalue and eigenvector sensitivities in linear systems theory†International Journal of Control, 1969
- Feature extraction in pattern recognitionPattern Recognition, 1968
- Sensitivity of an eigenvector of a multivariable control systemElectronics Letters, 1967
- Computational procedure for the sensitivity of an eigenvalueElectronics Letters, 1966
- The sequential estimation and detection of signals in normal noise. IInformation and Control, 1964
- Sensitivity in Dynamical System Analysis†Journal of Electronics and Control, 1964
- Self-Organizing Systems-A Review and CommentaryProceedings of the IRE, 1961
- Statistical Methods in Prediction, Filtering, and Detection ProblemsJournal of the Society for Industrial and Applied Mathematics, 1960
- Mean Square Truncation Error in Series Expansions of Random FunctionsJournal of the Society for Industrial and Applied Mathematics, 1960
- An Introduction to the Theory of Random Signals and NoisePhysics Today, 1958