Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14279/2132
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dinenis, Elias | - |
dc.contributor.author | Kontoghiorghes, Erricos John | - |
dc.contributor.other | Κοντογιώργης, Έρρικος Γιάννης | - |
dc.date.accessioned | 2013-02-01T14:14:57Z | en |
dc.date.accessioned | 2013-05-16T08:21:54Z | - |
dc.date.accessioned | 2015-12-02T09:26:36Z | - |
dc.date.available | 2013-02-01T14:14:57Z | en |
dc.date.available | 2013-05-16T08:21:54Z | - |
dc.date.available | 2015-12-02T09:26:36Z | - |
dc.date.issued | 1997-08 | - |
dc.identifier.citation | Computational Economics, 1997, vol. 10, no. 3, pp. 231-250 | en_US |
dc.identifier.issn | 15729974 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.14279/2132 | - |
dc.description.abstract | Algorithms for computing the three-stage least squares (3SLS) estimator usually require the disturbance covariance matrix to be non-singular. However, the solution of a reformulated simultaneous equation model (SEM) results into the redundancy of this condition. Having as a basic tool the QR decomposition, the 3SLS estimator, its dispersion matrix and methods for estimating the singular disturbance covariance matrix are derived. Expressions revealing linear combinations between the observations which become redundant have also been presented. Algorithms for computing the 3SLS estimator after the SEM has been modified by deleting or adding new observations or variables are found not to be very efficient, due to the necessity of removing the endogeneity of the new data or by re-estimating the disturbance covariance matrix. Three methods have been described for solving SEMs subject to separable linear equalities constraints. The first method considers the constraints as additional precise observations while the other two methods reparameterized the constraints to solve reduced unconstrained SEMs. Methods for computing the main matrix factorizations illustrate the basic principles to be adopted for solving SEMs on serial or parallel computers. | en_US |
dc.format | en_US | |
dc.language.iso | en | en_US |
dc.relation.ispartof | Computational Economics | en_US |
dc.rights | © Kluwer Academic | en_US |
dc.subject | Parallel algorithms | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Least squares | en_US |
dc.subject | Analysis of covariance | en_US |
dc.title | Computing 3sls solutions of simultaneous equation models with a possible singular variance-covariance matrix | en_US |
dc.type | Article | en_US |
dc.affiliation | Institut d'Informatique, Université de Neuchâtel, Switzerland | en |
dc.collaboration | Université de Neuchâtel | en_US |
dc.collaboration | City, University of London | en_US |
dc.journals | Subscription | en_US |
dc.country | Switzerland | en_US |
dc.country | United Kingdom | en_US |
dc.subject.field | Social Sciences | en_US |
dc.identifier.doi | 10.1023/A:1008617207791 | en_US |
dc.dept.handle | 123456789/54 | en |
dc.relation.issue | 3 | en_US |
dc.relation.volume | 10 | en_US |
cut.common.academicyear | 2020-2021 | en_US |
dc.identifier.spage | 231 | en_US |
dc.identifier.epage | 250 | en_US |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.openairetype | article | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.languageiso639-1 | en | - |
item.fulltext | No Fulltext | - |
crisitem.journal.journalissn | 1572-9974 | - |
crisitem.journal.publisher | Springer Nature | - |
crisitem.author.dept | Department of Finance, Accounting and Management Science | - |
crisitem.author.faculty | Faculty of Tourism Management, Hospitality and Entrepreneurship | - |
crisitem.author.orcid | 0000-0001-9704-9510 | - |
crisitem.author.parentorg | Faculty of Management and Economics | - |
Appears in Collections: | Άρθρα/Articles |
CORE Recommender
SCOPUSTM
Citations
17
checked on Nov 9, 2023
Page view(s)
472
Last Week
1
1
Last month
1
1
checked on Nov 23, 2024
Google ScholarTM
Check
Altmetric
Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.