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

DOI10.1016/j.cam.2013.06.013zbMath1296.65056OpenAlexW2042518602MaRDI QIDQ2252733

Antonio M. Vidal, Domingo Giménez, Jose J. López-Espín

Publication date: 23 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.06.013

zbMATH Keywords

convergence accelerationgenetic algorithmsSteiner treesimultaneous equations modelseconometricsQR-decomposition

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Two-stage least squares and indirect least squares algorithms for simultaneous equations models
• Algorithms for computing the QR decomposition of a set of matrices with common columns
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristics and metaheuristics for accelerating the computation of simultaneous equations models through a Steiner tree