DocumentCode :
3020253
Title :
Square-root algorithms for the continuous-time linear least squares estimation problem
Author :
Morf, M. ; Levy, Bernard ; Kailath, T.
Author_Institution :
Stanford University, Stanford, CA
fYear :
1977
fDate :
7-9 Dec. 1977
Firstpage :
944
Lastpage :
947
Abstract :
A simple differential equation for the triangular square-root of the error covariance of the linear state estimator is derived. Previous algorithms involved an antisymmetric matrix in the square-root differential equation. In the constant model case, Chandrasekhar-type equations are shown to constitute a set of fast square-root algorithms for the derivative of the error variance. Square-root algorithms for the smoothing problem are presented and as in the discrete case, an array method for handling continuous squareroots is developed. This method also yields very naturally the usual normalizations of stochastic calculus, suggesting extensions to more general stochastic equations, even to estimators for nonlinear models.
Keywords :
Laboratories; Least squares approximation; Nonlinear equations; Riccati equations; Stability; White noise;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications, 1977 IEEE Conference on
Conference_Location :
New Orleans, LA, USA
Type :
conf
DOI :
10.1109/CDC.1977.271704
Filename :
4045974
Link To Document :
بازگشت