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.
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.
Find related papers by JEL classification: C13 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: General - - - Estimation C3 - Mathematical and Quantitative Methods - - Multiple or Simultaneous Equation Models; Multiple Variables C89 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - Other