function disp_dr_sparse(dr,order,var_list) % Display the decision rules in sparse mode % This file is a modified version of disp_dr.m: the common parts should be factorized! % % INPUTS % dr [struct]: decision rules % order [int]: order of approximation % var_list [char array]: list of endogenous variables for which the % decision rules should be printed % Copyright (C) 2001-2009 Dynare Team % % 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 % along with Dynare. If not, see . global M_ nx = 0; nu = 0; k = []; klag = []; k1 = []; nspred = 0; for i=1:length(M_.block_structure.block) nspred = nspred + M_.block_structure.block(i).dr.nspred; end; ghu = zeros(M_.endo_nbr, M_.exo_nbr*(M_.maximum_exo_lag+M_.maximum_exo_lead+1)); ghx = zeros(M_.endo_nbr, nspred); for i=1:length(M_.block_structure.block) nx = nx + size(M_.block_structure.block(i).dr.ghx,2); % M_.block_structure.block(i).dr.ghx % M_.block_structure.block(i).equation % M_.block_structure.block(i).variable ghx(M_.block_structure.block(i).equation, M_.block_structure.block(i).variable(find(M_.block_structure.block(i).lead_lag_incidence(1: M_.block_structure.block(i).maximum_endo_lag,:))) ) = M_.block_structure.block(i).dr.ghx; if(M_.block_structure.block(i).exo_nbr) nu = nu + size(M_.block_structure.block(i).dr.ghu,2); ghu(M_.block_structure.block(i).equation, M_.block_structure.block(i).exogenous) = M_.block_structure.block(i).dr.ghu; end k_tmp = find(M_.block_structure.block(i).dr.kstate(:,2) <= M_.block_structure.block(i).maximum_lag+1); k = [k ; k_tmp]; klag = [klag ; M_.block_structure.block(i).dr.kstate(k_tmp,[1 2])]; k1 = [k1 ; M_.block_structure.block(i).variable(M_.block_structure.block(i).dr.order_var)']; end if size(var_list,1) == 0 var_list = M_.endo_names(1:M_.orig_endo_nbr, :); end nvar = size(var_list,1); ivar=zeros(nvar,1); for i=1:nvar i_tmp = strmatch(var_list(i,:),M_.endo_names(k1,:),'exact'); if isempty(i_tmp) disp(var_list(i,:)); error (['One of the variable specified does not exist']) ; else ivar(i) = i_tmp; end end disp('POLICY AND TRANSITION FUNCTIONS') % variable names str = ' '; for i=1:nvar str = [str sprintf('%16s',M_.endo_names(k1(ivar(i)),:))]; end disp(str); % % constant % str = 'Constant '; flag = 0; for i=1:nvar x = dr.ys(k1(ivar(i))); if order > 1 x = x + dr.ghs2(ivar(i))/2; end if abs(x) > 1e-6 flag = 1; str = [str sprintf('%16.6f',x)]; else str = [str ' 0']; end end if flag disp(str) end if order > 1 str = '(correction) '; flag = 0; for i=1:nvar x = dr.ghs2(ivar(i))/2; if abs(x) > 1e-6 flag = 1; str = [str sprintf('%16.6f',x)]; else str = [str ' 0']; end end if flag disp(str) end end % % ghx % for k=1:nx flag = 0; str1 = subst_auxvar(k1(klag(k,1)),klag(k,2)-M_.maximum_lag-2); str = sprintf('%-20s',str1); for i=1:nvar x = ghx(ivar(i),k); if abs(x) > 1e-6 flag = 1; str = [str sprintf('%16.6f',x)]; else str = [str ' 0']; end end if flag disp(str) end end % % ghu % for k=1:nu flag = 0; str = sprintf('%-20s',M_.exo_names(k,:)); for i=1:nvar x = ghu(ivar(i),k); if abs(x) > 1e-6 flag = 1; str = [str sprintf('%16.6f',x)]; else str = [str ' 0']; end end if flag disp(str) end end if order > 1 % ghxx for k = 1:nx for j = 1:k flag = 0; str1 = sprintf('%s,%s',subst_auxvar(k1(klag(k,1)),klag(k,2)-M_.maximum_lag-2), ... subst_auxvar(k1(klag(j,1)),klag(j,2)-M_.maximum_lag-2)); str = sprintf('%-20s',str1); for i=1:nvar if k == j x = dr.ghxx(ivar(i),(k-1)*nx+j)/2; else x = dr.ghxx(ivar(i),(k-1)*nx+j); end if abs(x) > 1e-6 flag = 1; str = [str sprintf('%16.6f',x)]; else str = [str ' 0']; end end if flag disp(str) end end end % % ghuu % for k = 1:nu for j = 1:k flag = 0; str = sprintf('%-20s',[M_.exo_names(k,:) ',' M_.exo_names(j,:)] ); for i=1:nvar if k == j x = dr.ghuu(ivar(i),(k-1)*nu+j)/2; else x = dr.ghuu(ivar(i),(k-1)*nu+j); end if abs(x) > 1e-6 flag = 1; str = [str sprintf('%16.6f',x)]; else str = [str ' 0']; end end if flag disp(str) end end end % % ghxu % for k = 1:nx for j = 1:nu flag = 0; str1 = sprintf('%s,%s',subst_auxvar(k1(klag(k,1)),klag(k,2)-M_.maximum_lag-2), ... M_.exo_names(j,:)); str = sprintf('%-20s',str1); for i=1:nvar x = dr.ghxu(ivar(i),(k-1)*nu+j); if abs(x) > 1e-6 flag = 1; str = [str sprintf('%16.6f',x)]; else str = [str ' 0']; end end if flag disp(str) end end end end end % Given the index of an endogenous (possibly an auxiliary var), and a % lead/lag, creates a string of the form "x(lag)". % In the case of auxiliary vars for lags, replace by the original variable % name, and compute the lead/lag accordingly. function str = subst_auxvar(aux_index, aux_lead_lag) global M_ if aux_index <= M_.orig_endo_nbr str = sprintf('%s(%d)', deblank(M_.endo_names(aux_index,:)), aux_lead_lag); return end for i = 1:length(M_.aux_vars) if M_.aux_vars(i).endo_index == aux_index switch M_.aux_vars(i).type case 1 orig_name = deblank(M_.endo_names(M_.aux_vars(i).orig_index, :)); case 3 orig_name = deblank(M_.exo_names(M_.aux_vars(i).orig_index, :)); otherwise error(sprintf('Invalid auxiliary type: %s', M_.endo_names(aux_index, :))) end str = sprintf('%s(%d)', orig_name, M_.aux_vars(i).orig_lead_lag+aux_lead_lag); return end end error(sprintf('Could not find aux var: %s', M_.endo_names(aux_index, :))) end