/* * Copyright (C) 2009-2013 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 . */ /////////////////////////////////////////////////////////// // LogLikelihoodSubSample.h // Implementation of the Class LogLikelihoodSubSample // Created on: 14-Jan-2010 22:39:14 /////////////////////////////////////////////////////////// #if !defined(DF8B7AF5_8169_4587_9037_2CD2C82E2DDF__INCLUDED_) #define DF8B7AF5_8169_4587_9037_2CD2C82E2DDF__INCLUDED_ #include #include "EstimatedParametersDescription.hh" #include "KalmanFilter.hh" #include "VDVEigDecomposition.hh" #include "LapackBindings.hh" class LogLikelihoodSubSample { public: LogLikelihoodSubSample(const std::string &basename, EstimatedParametersDescription &estiParDesc, size_t n_endo, size_t n_exo, const std::vector &zeta_fwrd_arg, const std::vector &zeta_back_arg, const std::vector &zeta_mixed_arg, const std::vector &zeta_static_arg, const double qz_criterium, const std::vector &varobs_arg, double riccati_tol_in, double lyapunov_tol, bool noconstant_arg); template double compute(VEC1 &steadyState, const MatrixConstView &dataView, VEC2 &estParams, VectorView &deepParams, MatrixView &Q, Matrix &H, VectorView &vll, MatrixView &detrendedDataView, size_t start, size_t period) { updateParams(estParams, deepParams, Q, H, period); return kalmanFilter.compute(dataView, steadyState, Q, H, deepParams, vll, detrendedDataView, start, period); } virtual ~LogLikelihoodSubSample(); class UpdateParamsException { public: double penalty; UpdateParamsException(double penalty_arg) : penalty(penalty_arg) { } }; private: EstimatedParametersDescription &estiParDesc; KalmanFilter kalmanFilter; VDVEigDecomposition eigQ; VDVEigDecomposition eigH; // methods template void updateParams(VEC &estParams, VectorView &deepParams, MatrixView &Q, Matrix &H, size_t period) { size_t i, k, k1, k2; int test; bool found; std::vector::const_iterator it; for (i = 0; i < estParams.getSize(); ++i) { found = false; it = find(estiParDesc.estParams[i].subSampleIDs.begin(), estiParDesc.estParams[i].subSampleIDs.end(), period); if (it != estiParDesc.estParams[i].subSampleIDs.end()) found = true; if (found) { switch (estiParDesc.estParams[i].ptype) { case EstimatedParameter::shock_SD: k = estiParDesc.estParams[i].ID1; Q(k, k) = estParams(i)*estParams(i); break; case EstimatedParameter::measureErr_SD: k = estiParDesc.estParams[i].ID1; H(k, k) = estParams(i)*estParams(i); break; case EstimatedParameter::shock_Corr: k1 = estiParDesc.estParams[i].ID1; k2 = estiParDesc.estParams[i].ID2; Q(k1, k2) = estParams(i)*sqrt(Q(k1, k1)*Q(k2, k2)); Q(k2, k1) = Q(k1, k2); // [CholQ,testQ] = chol(Q); test = lapack::choleskyDecomp(Q, "L"); assert(test >= 0); if (test > 0) { // The variance-covariance matrix of the structural innovations is not definite positive. // We have to compute the eigenvalues of this matrix in order to build the penalty. double delta = 0; eigQ.calculate(Q); // get eigenvalues //k = find(a < 0); if (eigQ.hasConverged()) { const Vector &evQ = eigQ.getD(); for (i = 0; i < evQ.getSize(); ++i) if (evQ(i) < 0) delta -= evQ(i); } throw UpdateParamsException(delta); } // if break; case EstimatedParameter::measureErr_Corr: k1 = estiParDesc.estParams[i].ID1; k2 = estiParDesc.estParams[i].ID2; // H(k1,k2) = xparam1(i)*sqrt(H(k1,k1)*H(k2,k2)); // H(k2,k1) = H(k1,k2); H(k1, k2) = estParams(i)*sqrt(H(k1, k1)*H(k2, k2)); H(k2, k1) = H(k1, k2); //[CholH,testH] = chol(H); test = lapack::choleskyDecomp(H, "L"); assert(test >= 0); if (test > 0) { // The variance-covariance matrix of the measurement errors is not definite positive. // We have to compute the eigenvalues of this matrix in order to build the penalty. //a = diag(eig(H)); double delta = 0; eigH.calculate(H); // get eigenvalues //k = find(a < 0); if (eigH.hasConverged()) { const Vector &evH = eigH.getD(); for (i = 0; i < evH.getSize(); ++i) if (evH(i) < 0) delta -= evH(i); } throw UpdateParamsException(delta); } // end if break; //if estim_params_.np > 0 // i.e. num of deep parameters >0 case EstimatedParameter::deepPar: k = estiParDesc.estParams[i].ID1; deepParams(k) = estParams(i); break; default: assert(false); } // end switch } // end found } //end for }; }; #endif // !defined(DF8B7AF5_8169_4587_9037_2CD2C82E2DDF__INCLUDED_)