Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/14726
Title: Computationally efficient methods for solving SURE models
Authors: Kontoghiorghes, Erricos John 
Foschi, Paolo 
metadata.dc.contributor.other: Κοντογιώργης, Ερρίκος
Major Field of Science: Social Sciences
Field Category: Economics and Business
Keywords: Computational efficiency;Numerical analysis;Iterative methods;Generalized least squares estimators
Issue Date: 2001
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Volume 1988, 2001, Pages 490-498 2nd International Conference on Numerical Analysis and Its Applications, NAA 2000; Rousse; Bulgaria; 11 June 2000 through 15 June 2000; Code 126839
Conference: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 
Abstract: Computationally efficient and numerically stable methods for solving Seemingly Unrelated Regression Equations (SURE) models are proposed. The iterative feasible generalized least squares estimator of SURE models where the regression equations have common exogenous variables is derived. At each iteration an estimator of the SURE model is obtained from the solution of a generalized linear least squares problem. The proposed methods, which have as a basic tool the generalized QR decomposition, are also found to be efficient in the general case where the number of linear independent regressors is smaller than the number of observations.
URI: https://hdl.handle.net/20.500.14279/14726
ISSN: 03029743
Rights: © Springer Nature 2001
Type: Conference Papers
Affiliation : Université de Neuchâtel 
Publication Type: Peer Reviewed
Appears in Collections:Δημοσιεύσεις σε συνέδρια /Conference papers or poster or presentation

CORE Recommender
Show full item record

Page view(s)

306
Last Week
0
Last month
3
checked on Dec 3, 2024

Google ScholarTM

Check


Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.