CDS 110b: Kalman Filtering

From Murray Wiki
Revision as of 17:25, 3 February 2006 by Murray (talk | contribs) (→‎Lecture Materials)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search
WARNING: This page is for a previous year.
See current course homepage to find most recent page available.
Course Home L7-2: Sensitivity L8-1: Robust Stability L9-1: Robust Perf Schedule

In this lecture we introduce the optimal estimation problem and describe its solution, the Kalman (Bucy) filter.

Lecture Outline

  1. State Space Computation for Stochastic Response
  2. Optimal Estimation
  3. Kalman Filter

Lecture Materials

References and Further Reading

Frequently Asked Questions

Q: How do you determine the covariance and how does it relate to random processes

The covariance of two random variables and is given by

For the case when , the covariance is called the variance, .

For a random process, , with zero mean, we define the covariance as

If is a vector of length , then the covariance matrix is an matrix with entries

where is the joint distribution desity function between and .

Intuitively, the covariance of a vector random process describes how elements of the process vary together. If the covariance is zero, then the two elements are independent.

Q: you asked what the estimator for the ducted fan would show (compared to eigenvalue placement). What should we be looking at and how would we be making those guesses?

This was not such a great question because you didn't have enough information to really make an informed guess. The main feature that is surprising about the result is that the convergence rate is much slower than eigenvalue placement.