2008-10-13 20:54:42 +02:00
|
|
|
function [K,iF,P] = steady_state_kalman_gain(T,R,Q,H,mf)
|
|
|
|
% Given the invariant state space representation of a model, this
|
|
|
|
% function computes the gain matrix and the covariance matrix of the
|
2017-05-16 15:10:20 +02:00
|
|
|
% state vector at the steady state of the kalman filter.
|
|
|
|
%
|
|
|
|
% INPUTS
|
|
|
|
% T [double] m*m transition matrix of the state vector.
|
2008-10-13 20:54:42 +02:00
|
|
|
% R [double] m*q matrix (q is the number of structural innovations).
|
|
|
|
% Q [double] q*q covariance matrix of the structural innovations.
|
|
|
|
% H [double] p*p covariance matrix of the measurement error.
|
|
|
|
% mf [integer] p*1 vector, indices for the observed variables
|
2017-05-16 15:10:20 +02:00
|
|
|
%
|
|
|
|
% OUTPUTS
|
2008-10-13 20:54:42 +02:00
|
|
|
% K [double] kalman gain matrix.
|
|
|
|
% P [double] covariance matrix of the state vector.
|
2017-05-16 15:10:20 +02:00
|
|
|
%
|
2008-10-13 20:54:42 +02:00
|
|
|
% SPECIAL REQUIREMENTS
|
|
|
|
% Needs a solver for Riccati equations (dare.m)
|
|
|
|
|
2022-04-13 13:15:19 +02:00
|
|
|
% Copyright © 2004-2017 Dynare Team
|
2008-10-13 20:54:42 +02:00
|
|
|
%
|
|
|
|
% This file is part of Dynare.
|
|
|
|
%
|
|
|
|
% Dynare is free software: you can redistribute it and/or modify
|
|
|
|
% it under the terms of the GNU General Public License as published by
|
|
|
|
% the Free Software Foundation, either version 3 of the License, or
|
|
|
|
% (at your option) any later version.
|
|
|
|
%
|
|
|
|
% Dynare is distributed in the hope that it will be useful,
|
|
|
|
% but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
% GNU General Public License for more details.
|
|
|
|
%
|
|
|
|
% You should have received a copy of the GNU General Public License
|
2021-06-09 17:33:48 +02:00
|
|
|
% along with Dynare. If not, see <https://www.gnu.org/licenses/>.
|
2009-12-16 18:17:34 +01:00
|
|
|
|
2008-10-13 20:54:42 +02:00
|
|
|
m = length(T);
|
|
|
|
p = length(mf);
|
|
|
|
Z = build_selection_matrix(mf,m,p);
|
|
|
|
|
|
|
|
if isempty(H)
|
|
|
|
H = zeros(p,p);
|
|
|
|
end
|
|
|
|
|
|
|
|
QQ = R*Q*transpose(R);
|
|
|
|
|
|
|
|
P = dare(T,transpose(Z),QQ,H);
|
|
|
|
|
|
|
|
iF = inv(Z*P*transpose(Z)+H);
|
|
|
|
K = T*P*transpose(Z)*iF;
|