Skip to content
Snippets Groups Projects
  1. May 16, 2024
    • Sébastien Villemot's avatar
      Refactor output for complementarity conditions · dc1ec15f
      Sébastien Villemot authored
      The vector of lower and upper bounds is now provided by
      {static,dynamic}_complementarity_conditions.m (which accepts parameters as an
      argument, in preparation for the possibility of having parameters in
      complementarity conditions).
      
      The index that denotes the reordering of equation residuals (so that the
      residual of an equation appears at the index of the endogenous appearing in the
      complementarity condition) is now in “M_.{static,dynamic}_mcp_equations_reordering”.
      
      Constraints declared through the ramsey_constraints block are also incorporated
      in this new interface (and therefore “M_.ramsey_model_constraints” has been
      removed).
      Verified
      dc1ec15f
  2. Feb 06, 2024
  3. Jan 31, 2024
  4. Dec 14, 2023
  5. Dec 13, 2023
  6. Nov 30, 2023
  7. Nov 03, 2023
  8. Oct 16, 2023
  9. Sep 27, 2023
  10. Sep 19, 2023
  11. May 12, 2023
    • Sébastien Villemot's avatar
      :bug: Bytecode + block decomposition: temporary terms were not correctly output · 150547b5
      Sébastien Villemot authored
      Temporary terms computed in previous blocks were not used in the bytecode
      output of a given block. This was inefficient (because this means that
      expressions already computed and store in the temporary terms vector would be
      recomputed), and incidentally it would break the external functions
      output (because it would trigger a lookup in the “TEF terms”, which would thus
      fail).
      
      Closes: #115
      Verified
      150547b5
  12. Apr 18, 2023
  13. Apr 11, 2023
  14. Apr 07, 2023
  15. Apr 05, 2023
  16. Mar 28, 2023
  17. Mar 23, 2023
  18. Mar 20, 2023
  19. Mar 02, 2023
    • Sébastien Villemot's avatar
      Performance improvement of chain rule derivation · 7acf2783
      Sébastien Villemot authored
      Commit 23b0c12d introduced caching in chain
      rule derivation (used by block decomposition), which increased speed for mfs >
      0, but actually decreased it for mfs=0.
      
      This patch introduces the pre-computation of derivatives which are known to be
      zero using symbolic a priori (similarly to what is done in the non-chain rule
      context). The algorithms are now identical between the two contexts (both
      symbolic a priori + caching), the difference being that in the chain rule
      context, the symbolic a priori and the cache are not stored within the ExprNode
      class, since they depend on the list of recursive variables.
      
      This patch brings a significant performant improvement for all values of the
      “mfs” option (the improvement is greater for small values of “mfs”).
      Verified
      7acf2783
  20. Jan 19, 2023
  21. Jan 17, 2023
  22. Jan 16, 2023
  23. Jan 13, 2023
  24. Jan 09, 2023
  25. Jan 05, 2023
  26. Dec 12, 2022
Loading