The computational efficiency of various algorithms for solving seemingly unrelated regressions (SUR) models is investigated. Some of the algorithms adapt known methods; others are new. The first transforms the SUR model to an ordinary linear model and uses the QR decomposition to solve it. Three others employ the generalized QR decomposition to solve the SUR model formulated as a generalized linear least-squares problem. Strategies to exploit the structure of the matrices involved are developed. The algorithms are reconsidered for solving the SUR model after it has been transformed to one of smaller dimensions.
展开▼
