We propose the relaxation algorithm as a simple and powerful method for simulating the transition process in growth models. This method has a number of important advantages: (1) It can easily deal with a wide range of dynamic systems including multi-dimensional systems with stable eigenvalues that di.er drastically in magnitude. (2) The application of the procedure is fairly user friendly. The only input required consists of the dynamic system. (3) The variant of the relaxation algorithm we propose exploits in a natural manner the in.nite time horizon, which usually underlies optimal control problems in economics. Overall, it seems that the relaxation procedure can easily cope with a large number of problems which arise frequently in the context of macroeconomic dynamic models. As an illustrative application, we simulate the transition process of the well-known Jones (1995) model.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by CER-ETH - Center of Economic Research (CER-ETH) at ETH Zurich in its series Economics working paper series with number
04/35.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.) This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.