López Espín, José JuanVidal Maciá, Antonio ManuelGiménez ., Domingo2014-07-152012-090377-0427https://riunet.upv.es/handle/10251/38822This paper analyzes the solution of simultaneous equations models. Efficient algorithms for the two-stage least squares method using QR-decomposition are developed and studied. The reduction of the execution time when the structure of the matrices in each equation is exploited is analyzed theoretically and experimentally. An efficient algorithm for the indirect least squares method is developed. Some techniques are used to accelerate the solution of the problem: parallel versions for multicore systems, and extensive use of the MKL library, thus obtaining efficient, portable versions of the algorithms. © 2011 Elsevier B.V. All rights reserved.9Reserva de todos los derechosEconometricsParallel computingQR-decompositionSimultaneous equations modelsExecution timeLeast SquareLeast squares algorithmLeast squares methodsMulti-core systemsParallel versionSimultaneous equations modelAlgorithmsParallel architecturesParallel processing systemsLeast squares approximationsCIENCIAS DE LA COMPUTACION E INTELIGENCIA ARTIFICIALArtículo10.1016/j.cam.2011.07.005Cerrado