Algorithms for solving nonlinear dynamic decision models

In this paper we discuss two Newton-type algorithms for solving economic models. The models are preprocessed by reordering the equations in order to minimize the dimension of the simultaneous block. The solution algorithms are then applied to this block. The algorithms evaluate numerically, as required, selected columns of the Jacobian of the simultaneous part. Provisions also exist for similar systems to be solved, if possible, without actually reinitialising the Jacobian. One of the algorithms also uses the Broyden update to improve the Jacobian. Global convergence is maintained by an Armijo-type stepsize strategy.The global and local convergence of the quasi-Newton algorithm is discussed. A novel result is established for convergence under relaxed descent directions and relating the achievement of unit stepsizes to the accuracy of the Jacobian approximation. Furthermore, a simple derivation of the Dennis-Moré characterisation of the Q-superlinear convergence rate is given.The model equation reordering algorithm is also described. The model is reordered to define heart and loop variables. This is also applied recursively to the subgraph formed by the loop variables to reduce the total number of above diagonal elements in the Jacobian of the complete system. The extension of the solution algorithms to consistent expectations are discussed. The algorithms are compared with Gauss-Seidel SOR algorithms using the USA and Spanish models of the OECD Interlink system.

[1]  S. Venit,et al.  Numerical Analysis: A Second Course. , 1974 .

[2]  J. J. Moré,et al.  On the Global Convergence of Broyden''s Method , 1974 .

[3]  Pierre Nepomiastehy,et al.  Adapted Methods for Solving and Optimizing Quasi-Triangular Econometric Models , 1977 .

[4]  John K. Reid,et al.  An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix , 1978, TOMS.

[5]  A. J. Hughes Hallett.  Multiparameter extrapolation and deflation methods for solving equation systems , 1984 .

[6]  Guangye Li,et al.  Successive column correction algorithms for solving sparse nonlinear systems of equations , 1989, Math. Program..

[7]  J. J. Moré,et al.  A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods , 1973 .

[8]  Iain S. Duff,et al.  On Algorithms for Obtaining a Maximum Transversal , 1981, TOMS.

[9]  Hanoch Levy,et al.  A Contraction Algorithm for Finding Small Cycle Cutsets , 1988, J. Algorithms.

[10]  Leon S. Lasdon,et al.  A comparison of methods for solving and optimizing a large non-linear econometric model , 1983 .

[11]  Giampiero M. Gallo,et al.  Solving large sparse systems of equations in econometric models , 1987 .

[12]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[13]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[14]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..