Algorithms for Solving Dynamic Models with Occasionally Binding Constraints / Lawrence J. Christiano, Jonas D.M. Fisher.
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
- Hardcopy version available to institutional subscribers
Item type | Home library | Collection | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|
Working Paper | Biblioteca Digital | Colección NBER | nber t0218 (Browse shelf(Opens below)) | Not For Loan |
October 1997.
We describe and compare several algorithms for approximating the solution to a model in" which inequality constraints occasionally bind. Their performance is evaluated and compared" using various parameterizations of the one sector growth model with irreversible investment. We" develop parameterized expectation algorithms which, on the basis of speed convenience of implementation, appear to dominate the other algorithms."
Hardcopy version available to institutional subscribers
System requirements: Adobe [Acrobat] Reader required for PDF files.
Mode of access: World Wide Web.
Print version record
There are no comments on this title.