This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Block Parallel Algorithms For Solving The General Linear Model

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Erricos J. Kontoghiorghes (Universite de Neuchatel)
Berc Rustem (Imperial College)

Additional information is available for the following registered author(s):

Abstract

The General Linear Model (GLM) is the parent model of econometrics. Simultaneous equations and seemingly unrelated regression equation (SURE) models, to name but a few, can be formulated as a GLM. The estimation of the GLM can be viewed as a Generalized Linear Least-Squares problem (GLLSP). The solution of the GLLSP has been considered extensively. Serial algorithms have been proposed and numerical libraries such as LAPACK and ScALAPACK provide routines for solving the GLLSP using the generalized QR decomposition. These routines are efficient only when the matrices in the GLLSP are fully dense. However, in most cases one of the matrices corresponds to the triangular Cholesky factor of the disturbance's variance-covariance matrix.Indeed, the efficient serial algorithm, which is based on Givens rotations, exploits the triangular structure of the matrix. A parallel version of the serial Givens algorithm has shown that only in a few, extreme cases can it outperform the straightforward Householder algorithm, which ignores the structure of the matrices.In this paper, we propose block-updating algorithms for solving the GLLSP when one of the matrices has a triangular structure. The algorithms use Householder transformations, which are found to be efficient with contemporary parallel computers. The theoretical computational complexity of the algorithms, which is useful in evaluating the performance of parallel implementations, is derived. Extensions of the algorithms to SURE models are discussed.

Download Info
To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Publisher Info
Paper provided by Society for Computational Economics in its series Computing in Economics and Finance 2000 with number 143.

Download reference. The following formats are available: HTML, plain text, BibTeX, RIS (EndNote), ReDIF
Length:
Date of creation: 05 Jul 2000
Date of revision:
Handle: RePEc:sce:scecf0:143

Contact details of provider:
Postal: CEF 2000, Departament d'Economia i Empresa, Universitat Pompeu Fabra, Ramon Trias Fargas, 25,27, 08005, Barcelona, Spain
Fax: +34 93 542 17 46
Email:
Web page: http://enginy.upf.es/SCE/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).

Related research
Keywords:

Statistics
Access and download statistics

Did you know? IDEAS is not the only service displaying RePEc data. Choose on RePEc which service fits your needs best.

This page was last updated on 2008-9-13.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.