Computation of LQ Approximations to Optimal Policy Problems in Different Information Settings under Zero Lower Bound Constraints
This paper describes a series of algorithms that are used to compute optimal policy under full and imperfect information. Firstly we describe how to obtain linear quadratic (LQ) approximations to a nonlinear optimal policy problem. We develop novel algorithms that are required as a result of having agents with forward-looking expectations, that go beyond the scope of those that are used when all equations are backward-looking; these are utilised to generate impulse response functions and second moments for the case of imperfect information. We describe algorithms for reducing a system to minimal form that are based on conventional approaches, and that are necessary to ensure that a solution for fully optimal policy can be computed. Finally we outline a computational algorithm that is used to generate solutions when there is a zero lower bound constraint for the nominal interest rate.
|Date of creation:||Nov 2011|
|Contact details of provider:|| Postal: 48 boulevard Jourdan - 75014 PARIS|
Phone: +33(0) 1 43 13 62 30
Fax: +33(0) 1 43 13 62 32
Web page: http://www.cepremap.fr/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:cpm:dynare:010. 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: (Stéphane Adjemian)
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.