A recursive algorithm for solving SUR models

Erricos J. Kontoghiorghes and Paolo Foschi
Authors registered in the RePEc Author Service: Paolo Foschi and Erricos John Kontoghiorghes

No 143, Computing in Economics and Finance 2001 from Society for Computational Economics

Abstract: The main computational tool for solving SUR or simultaneous equations models is the generalized QR decomposition (GQRD) of an exogenous matrix A and the Cholesky factorization of a dispersion matrix C. Initially the GQRD computes the QRD of A and then the RQD of QC, where Q is an orthogonal matrix. Sequential and parallel strategies have been proposed for computing the GQRD by exploiting the block-diagonal and Kronecker structures of A and C, respectively. The RQD of QC is the most expensive of these operations. An algorithm is presented here that avoids the explicit computation of the RQD of QC. It is based on the strategies for solving augmented systems and updated SUR models. A modification to handle SUR models with unequal observation sizes is discussed.

Keywords: SUR models; Least-Squares; Matrix Factorizations. (search for similar items in EconPapers)
JEL-codes: C13 C3 C89 (search for similar items in EconPapers)
Date: 2001-04-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sce:scecf1:143

Access Statistics for this paper

More papers in Computing in Economics and Finance 2001 from Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F. Baum ().