A solution method for consumption decisions in a dynamic stochastic general equilibrium model
In this paper we describe a numerical solution of the consumer's life-cycle problem based on value function iteration. The advantage of our approach is that it retains the versatility of the value function iteration approach and also achieves a high degree of accuracy without resorting to the very computationally burdensome task of calculating a very fine grid. There are two innovations, the first is not to discretise the state space but effectively to allow the states to take any value on the real line by using two different third order interpolation algorithms: bicubic spline for extrapolation and interpolation on the edge of the grid and the faster cubic convolution interpolation for inside the grid. The second is to compute a pair of nested grids, one coarse and one fine. The fine grid is used to calculate the consumption paths of the majority of individuals, and the coarse grid to catch only the few with very high incomes. We shall discuss our approach in relation to those already in the literature. We shall argue that value function iteration approach is probably the most flexible and robust way to solve these problems. We shall show that our implementation achieves a high degree of accuracy, using a modified den Haan and Marcet simulation accuracy test, without comprising significantly on speed.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Oct 1997|
|Contact details of provider:|| Postal: 2 Dean Trench Street Smith Square London SW1P 3HE|
Web page: http://niesr.ac.uk
When requesting a correction, please mention this item's handle: RePEc:nsr:niesrd:215. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Library & Information Manager)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.