Heuristics and metaheuristics for accelerating the computation of simultaneous equations models through a Steiner tree

Simultaneous equations models can be solved with a variety of algorithms. Some methods use the QR-decomposition of several matrices associated to the equations in the system. To accelerate the computation of those QR-decompositions and consequently the solution of simultaneous equations models, the QR-decomposition of a matrix associated to an equation can be obtained from that of another matrix associated to another equation which contains the variables of the first equation. A Steiner tree can be used, with nodes representing the equations in the model and with edges whose associated weight is the cost of computing the QR-decomposition of an equation from that of another equation. The Steiner tree of the graph associated to the simultaneous equations model gives the order of computation of the QR-decompositions of lowest computational cost. But the number of nodes in the graph is very large, and exact methods to obtain the Steiner tree are not applicable. In this paper, the application of heuristics and metaheuristics to approach the Steiner tree of the graph associated to a simultaneous equations model is considered. A heuristic and a genetic algorithm are presented and analyzed. The quality of the tree obtained and its usability in an algorithm to solve simultaneous equations models efficiently is experimentally studied.

[1]  R. Prim Shortest connection networks and some generalizations , 1957 .

[2]  Ani Matei,et al.  Simultaneous Equations Models Used in the Study of Some Issues Related to the Corruption and Performance of Services in the Public Health System , 2009 .

[3]  F. Wolff,et al.  Do private and public transfers received affect life satisfaction? Evidence from Romania , 2011 .

[4]  Domingo Giménez,et al.  Two-stage least squares and indirect least squares algorithms for simultaneous equations models , 2012, J. Comput. Appl. Math..

[5]  A. Ivanov,et al.  Minimal Networks: The Steiner Problem and Its Generalizations , 1994 .

[6]  C. Girardone,et al.  Financial Frictions, Bank Efficiency and Risk: Evidence from the Eurozone , 2011 .

[7]  Rand W. Ressler,et al.  Female earnings and the divorce rate: a simultaneous equations model , 2000 .

[8]  M. Hansen,et al.  Operational Consequences of Alternative Airport Demand Management Policies: Case of LaGuardia Airport, New York , 2005 .

[9]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[10]  Erricos John Kontoghiorghes,et al.  Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns , 2003, Algorithmica.

[11]  Attila Szolnoki,et al.  Coevolutionary Games - A Mini Review , 2009, Biosyst..

[12]  Damodar Gujarati,et al.  Basic econometrics / Damodar N. Gujarati , 1995 .

[13]  J. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[14]  W. Greene,et al.  计量经济分析 = Econometric analysis , 2009 .

[15]  Gene H. Golub,et al.  Matrix computations , 1983 .