2013
DOI: 10.2139/ssrn.2353010
|View full text |Cite
|
Sign up to set email alerts
|

Solving Second and Third-Order Approximations to DSGE Models: A Recursive Sylvester Equation Solution

Abstract: In this paper I derive the matrix chain rules for solving a second and a third-order approximation to a DSGE model that allow the use of a recursive Sylvester equation solution method. In particular I use the solution algorithms of Kamenik ( 2005) and Martin & Van Loan ( 2006) to solve the generalised Sylvester equations. Because I use matrix algebra instead of tensor notation to find the system of equations, I am able to provide standalone Matlab routines that make it feasible to solve a medium scale DSGE mod… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 15 publications
0
6
0
Order By: Relevance
“…This three-step procedure is formally described in Appendix A.15 and constitutes a new numerical contribution to the literature. Our three-step procedure allows us to compute a third-order solution to our model in just 3.7 seconds, whereas it takes 6.2 seconds when using the standard one-step perturbation algorithm of Binning (2013). This 40% improvement in speed greatly facilitates the estimation, as the perturbation approximation must be computed for many different parameter values.…”
Section: An Efficient Perturbation Approximationmentioning
confidence: 99%
“…This three-step procedure is formally described in Appendix A.15 and constitutes a new numerical contribution to the literature. Our three-step procedure allows us to compute a third-order solution to our model in just 3.7 seconds, whereas it takes 6.2 seconds when using the standard one-step perturbation algorithm of Binning (2013). This 40% improvement in speed greatly facilitates the estimation, as the perturbation approximation must be computed for many different parameter values.…”
Section: An Efficient Perturbation Approximationmentioning
confidence: 99%
“…The conditions in (12) to (15) are therefore easy to implement from existing results and computer packages on the standard perturbation method. In our case, we modify the highly e¢ cient Matlab codes of Binning (2013). estimated versions of the New Keynesian model presented below in Table 4 are considered for this exercise, where the states are simulated using a standard third-order perturbation approximation, i.e., by a Taylor approximation around the deterministic steady state.…”
Section: Accuracy and Execution Timementioning
confidence: 99%
“…Linear systems featuring such shifted Kronecker products have been discussed in [19]. The more general case (1.5) arises from approximations of discrete time DSGE models [3], which play a central role in macroeconomics. Recent work on the solution of linear tensor equations (1.3) has focused on the development of highly efficient approximate and iterative solvers that assume and exploit low-rank tensor structure in the right-hand side and the solution; see [9,10] for overviews.…”
Section: Introductionmentioning
confidence: 99%
“…The more general case (1.5) arises from approximations of discrete time DSGE models [3], which play a central role in macroeconomics.…”
Section: Introductionmentioning
confidence: 99%