Periodic Chandrasekhar recursions

Statistics – Methodology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This paper extends the Chandrasekhar-type recursions due to Morf, Sidhu, and Kailath "Some new algorithms for recursive estimation in constant, linear, discrete-time systems, IEEE Trans. Autom. Control 19 (1974) 315-323" to the case of periodic time-varying state-space models. We show that the S-lagged increments of the one-step prediction error covariance satisfy certain recursions from which we derive some algorithms for linear least squares estimation for periodic state-space models. The proposed recursions may have potential computational advantages over the Kalman Filter and, in particular, the periodic Riccati difference equation.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Periodic Chandrasekhar recursions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Periodic Chandrasekhar recursions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Periodic Chandrasekhar recursions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-563043

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.