(188h) Strategies for Minimum Variance ALS Estimation of Noise Covariance Matrices
AIChE Annual Meeting
2017
2017 Annual Meeting
Computing and Systems Technology Division
CAST Rapid Fire Session II
Monday, October 30, 2017 - 5:00pm to 5:05pm
The variances are generally not known a priori, so they must be estimated from plant data. The autocovariance least squares (ALS) algorithm casts the estimation as a linear regression problem (Odelson et al., 2006; Rajamani and Rawlings, 2009). To get the minimum variance ALS estimates of Q and R, the appropriate weighting matrix W* is required. However, W* is itself a function of the unknown Q and R. We will discuss the following strategies for obtaining minimum variance ALS estimates:
1. Pick an initial Q0 and R0 , calculate W*(Q0, R0), and solve the ALS problem with this weight to obtain Q1 and R1. Repeat until convergence.
2. Estimate W* itself directly from the plant data.
Strategy 1 was originally suggested by Rajamani and Rawlings (2009), but has not been widely adopted because calculation of W* from Q and R was thought to be intractable in most practical cases. We will present a new method of calculation that reduces the computational burden to more manageable levels.
Strategy 2 was originally suggested by Zagrobelny and Rawlings (2015). We will present improvements and new insights related to this strategy.
B. J. Odelson, M. R. Rajamani, and J. B. Rawlings. A new autocovariance least-squares method for estimating noise covariances. Automatica, 42(2):303â308, February 2006.
M. R. Rajamani and J. B. Rawlings. Estimation of the disturbance structure from data using semidefinite programming and optimal weighting. Automatica, 45(1):142â148, 2009.
M. A. Zagrobelny and J. B. Rawlings. Practical improvements to autocovariance least-squares. AIChE J., 61:1840â1855, 2015.