Projections Parameterized Expectations Algorithms (Gauss)
These programs use the techniques described in Ken Judd's 1992 "Journal of Economic Theory" article to solve the standard growth model using parameterized expectations. Another good reference for the solution methods used in these programs is the working paper "Algorithms for Solving Dynamic Models with Occasionally Binding Constraints" by Larry Christiano and Jonas Fisher. All algorithms have the following properties. 1. They use the tensor method to approximate the conditional expectation with orthogonal Chebyshev polynomials. 2. The coefficients of the approximating function are such that they minimize the distance between the approximating function and the numerically calculated conditional expectation at a set of grid points. 3. The grid points are Chebyshev nodes. 4. The numerical integration procedure used to calculate the conditional expectation is Hermite Gaussian Quadrature. In my experience it is easier to obtain an accurate solution fast with quadrature methods than with Monte Carlo methods. 5. The "iterative" programs iterate on a projection procedure to find the coefficients of the approximating function. 6. The "equation-solver" programs use a nonlinear equation solver to find the value of the coefficients at which the approximating function equal the numerically calculated conditional expectation. The included files are: "Iterative" PEA program (peaproi1.prg), "Equation-Solver" PEA program (peapro1.prg), Procedures to run GAUSS programs (pealib.src).
|Date of creation:||Nov 1998|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://dge.repec.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:dge:qmrbcd:68. 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: (Christian Zimmermann)
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.