Skip to content
Snippets Groups Projects
Select Git revision
  • 4aadc533a84e9270bc31dbaa2f447bcce3d2854e
  • master default protected
  • 6.x protected
  • madysson
  • 5.x protected
  • asm
  • time-varying-information-set
  • 4.6 protected
  • dynare_minreal
  • dragonfly
  • various_fixes
  • 4.5 protected
  • clang+openmp
  • exo_steady_state
  • declare_vars_in_model_block
  • julia
  • error_msg_undeclared_model_vars
  • static_aux_vars
  • slice
  • aux_func
  • penalty
  • 6.4 protected
  • 6.3 protected
  • 6.2 protected
  • 6.1 protected
  • 6.0 protected
  • 6-beta2 protected
  • 6-beta1 protected
  • 5.5 protected
  • 5.4 protected
  • 5.3 protected
  • 5.2 protected
  • 5.1 protected
  • 5.0 protected
  • 5.0-rc1 protected
  • 4.7-beta3 protected
  • 4.7-beta2 protected
  • 4.7-beta1 protected
  • 4.6.4 protected
  • 4.6.3 protected
  • 4.6.2 protected
41 results

extended_path_core.m

Blame
  • extended_path_core.m 4.40 KiB
    function [y1, info_convergence, endogenousvariablespaths, y, pfm, options_] = extended_path_core(positive_var_indx, ...
                                                                                                 exo_simul, ...
                                                                                                 initial_conditions ,...
                                                                                                 pfm, ...
                                                                                                 M_, ...
                                                                                                 options_, ...
                                                                                                 oo_, ...
                                                                                                 initialguess, ...
                                                                                                 y)
    
    % Copyright © 2016-2025 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 <https://www.gnu.org/licenses/>.
    
    ep = options_.ep;
    
    periods = ep.periods;
    endo_nbr = M_.endo_nbr;
    exo_nbr = M_.exo_nbr;
    init = options_.ep.use_first_order_solution_as_initial_guess;
    steady_state = oo_.steady_state;
    debug = options_.verbosity;
    order = options_.ep.stochastic.order;
    
    algo = ep.stochastic.algo;
    solve_algo = ep.solve_algo;
    stack_solve_algo = ep.stack_solve_algo;
    
    if init% Compute first order solution (Perturbation)...
        endo_simul = simult_(M_,options_,initial_conditions,oo_.dr,exo_simul(2:end,:),1);
    else
        if nargin>7 && ~isempty(initialguess)
            % Note that the first column of initialguess should be equal to initial_conditions.
            endo_simul = initialguess;
        else
            endo_simul = [initial_conditions repmat(steady_state,1,periods+1)];
        end
    end
    
    if nargin~=9
        y = [];
    end
    
    oo_.endo_simul = endo_simul;
    
    if debug
        save ep_test_1.mat endo_simul exo_simul
    end
    
    if options_.bytecode && order > 0
        error('Option order > 0 of extended_path command with order>0 is not compatible with bytecode option.')
    end
    if options_.block && order > 0
        error('Option order > 0 of extended_path command with order>0 is not compatible with block option.')
    end
    
    if order == 0
        % Extended Path
        options_.periods = periods;
        options_.block = pfm.block;
        oo_.endo_simul = endo_simul;
        oo_.exo_simul = exo_simul;
        oo_.steady_state = steady_state;
        options_.solve_algo = solve_algo;
        options_.stack_solve_algo = stack_solve_algo;
        [endogenousvariablespaths, info_convergence] = perfect_foresight_solver_core(oo_.endo_simul, oo_.exo_simul, oo_.steady_state, oo_.exo_steady_state, M_, options_);
    else
        % Stochastic Extended Path
        switch(algo)
          case 0
            % Full tree of future trajectories.
            if nargout>4
                [flag, endogenousvariablespaths, errorcode, y, pfm, options_] = solve_stochastic_perfect_foresight_model_0(endo_simul, exo_simul, y, options_, M_, pfm);
            else
                [flag, endogenousvariablespaths, errorcode, y] = solve_stochastic_perfect_foresight_model_0(endo_simul, exo_simul, y, options_, M_, pfm);
            end
          case 1
            % Sparse tree of future histories.
            if nargout>4
                [flag, endogenousvariablespaths, errorcode, y, pfm, options_] = solve_stochastic_perfect_foresight_model_1(endo_simul, exo_simul, y, options_, M_, pfm);
            else
                [flag, endogenousvariablespaths, errorcode, y] = solve_stochastic_perfect_foresight_model_1(endo_simul, exo_simul, y, options_, M_, pfm);
            end
        end
        info_convergence = ~flag;
    end
    
    if ~info_convergence && ~options_.no_homotopy
        [info_convergence, endogenousvariablespaths] = extended_path_homotopy(endo_simul, exo_simul, M_, options_, oo_, pfm, ep, order, algo, 2, debug);
    end
    
    if info_convergence
        y1 = endogenousvariablespaths(:,2);
    else
        y1 = NaN(size(endo_nbr,1));
    end