Sequence Space Jacobian

Julia-based implementation of the Auclert et. al. (2020) method for solving HANK models in the sequence space

Output for a basic Krussell-Smith Model: IRFs, the Jacobian, and the Fake News Matrix.

The purpose of this project is to create a series of teaching materials for solving HANK models in Julia using the Sequence Space Jacobian method (Auclert, Bardoczy, Rognlie and Straub). The easy part was writing the code in Julia to solve HANK models using the SSJ method. Writing the learning material, on the other hand, is taking forever. Too many projects competing for my time, sadly.

To be clear, I think the paper is very well written and easy to follow. Plus, the Shade-Econ team has done very well to put out Python-based training materials on using their package. I intend my materials to be for students who are relatively new to the literature and are not fully familiar with the prerequisites for using the SSJ method. For example, the SSJ method assumes the availability of a transition matrix \(\Lambda\) that represents the law of motion for the wealth ditribution of the household sector. But where does this come from? How does one actually implement the Young (2010) lottery method to obtain this matrix? Or how does one implement the Carroll (2006) endogenous gridpoint method to obtain the policy functions? These are the questions that I find students ask most often, and which I hope to answer in detail in these materials.

When I finally get to it, that is.

In the meantime, the link to the code in Julia itself is available here.