Econometric estimation of panel data models by feasible generalized least squares (FGLS) provides an example of how conceptually simple problems may run into computational bottlenecks. I address the main computational tasks of FGLS within the R system for statistical computing, comparing different tools from the point of view of computational efficiency. I concentrate on estimating two models: the popular “random effects” with two error components and the less restrictive “general GLS” specification, which does not fit into the standard computational framework usually employed for the former. I compare the standard solution (partial time demeaning) with two alternative strategies, based respectively on algebraic properties and on object-oriented programming. I show how, while naive implementations become infeasible with large datasets, both list operators and object-oriented matrix routines available in the R environment make the problem tractable for most practically relevant sample sizes on any machine. I conclude by briefly discussing the parallelization of critical tasks.
Some Computational Aspects of Feasible GLS Estimation of Large Panels in R / Millo, G.. - In: MATHEMATICS. - ISSN 2227-7390. - ELETTRONICO. - 14:12(2026), pp. 1-17. [10.3390/math14122163]
Some Computational Aspects of Feasible GLS Estimation of Large Panels in R
Giovanni Millo
Primo
2026-01-01
Abstract
Econometric estimation of panel data models by feasible generalized least squares (FGLS) provides an example of how conceptually simple problems may run into computational bottlenecks. I address the main computational tasks of FGLS within the R system for statistical computing, comparing different tools from the point of view of computational efficiency. I concentrate on estimating two models: the popular “random effects” with two error components and the less restrictive “general GLS” specification, which does not fit into the standard computational framework usually employed for the former. I compare the standard solution (partial time demeaning) with two alternative strategies, based respectively on algebraic properties and on object-oriented programming. I show how, while naive implementations become infeasible with large datasets, both list operators and object-oriented matrix routines available in the R environment make the problem tractable for most practically relevant sample sizes on any machine. I conclude by briefly discussing the parallelization of critical tasks.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


