You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Sure. I add Bellman equation in the notebook. We can access my updated notebook by above link.
In addition, I recognize some difference between this package and algorithm in Judd(1998), however, this may not be related with this problem.
In this package, we check the convergence of polynomial coefficients to stop iteration.
On the other hand, Judd proposed we need to check the convergence of approximated value function to stop iteration.
You can check the difference between the computed V and the value of the Bellman operator for V.
I played a bit with your notebook. It seems that the choice of the lower and upper bounds for the state variable, in particular for z, affects the outcome significantly.
I don't know how much we can expect with the collocation method + quadrature method for a choice of the number of grid points, so I can't determine whether the difference between the analytical and the computed solutions is too large.
I'm testing this package by computing optimal growth model with productivity shocks.
However, the result by using
ContinuousDPs.jl
is different from true solution, if I correctly use this package.Model settings and my implimentation is here. In this example, I use PFI but VFI also fails to obtain true solution.
This package may have some bugs in
solve
method.The text was updated successfully, but these errors were encountered: