Abstract
In this paper we introduce a general parallelizable computational method for solving a wide spectrum of constrained matrix problems. The constrained matrix problem is a core problem in numerous applications in economics. These include the estimation of input/output tables, trade tables, and social/national accounts, and the projection of migration flows over space and time. The constrained matrix problem, so named by Bacharach, is to compute the best possible estimate X of an unknown matrix, given some information to constrain the solution set, and requiring either that the matrix X be a minimum distance from a given matrix, or that X be a functional form of another matrix. In real-world applications, the matrix X is often very large (several hundred to several thousand rows and columns), with the resulting constrained matrix problem larger still (with the number of variables on the order of the square of the number of rows/columns; typically, in the hundreds of thousands to millions). In the class cal setting, the row and column totals are known and fixed, and the individual entries nonnegative. However, in certain applications, the row and column totals need not be known a priori, but must be estimated, as well. Furthermore, additional objective and subjective inputs are often incorporated within the model to better represent the application at hand. It is the solution of this broad class of large-scale constrained matrix problems in a timely fashion that we address in this paper.
The constrained matrix problem has become a standard modelling tool among researchers and practitioners in economics. Therefore, the need for a unifying, robust, and efficient computational procedure for solving constrained matrix problems is of importance. Here we introduce an algorithm, the splitting equilibration algorithm, for computing the entire class of constrained matrix problems. This algorithm is not only theoretically justified, but also fully exploits both the underlying structure of these large-scale problems and the advantages offered by state-of-the-art computer architectures, while simultaneously enhancing the modelling flexibility.
In particular, we utilize some recent results from variational inequality theory, to construct a splitting equilibration algorithm which splits the spectrum of constrained matrix problems into series of row/column equilibrium subproblems. Each such constructed subproblem, due to its special structure, can, in turn, be solved simultaneously via exact equilibration in closed form. Thus each subproblem can be allocated to a distinct processor.
We also present numerical results when the splitting equilibration algorithm is implemented in a serial, and then in a parallel environment. The algorithm is tested against another much-cited algorithm and applied to input/output tables, social accounting matrices, and migration tables. The computational results illustrate the efficacy of this approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bacharach, M. (1970), Biproportional scaling and input-output change, Cambridge University Press, Cambridge, UK.
Bachem, A. and Korte, B., (1978), ’Algorithm for quadratic optimization over transportation polytopes,Zeitschrifi fur Angewandte MaÃhematik und Mechanik, 58: T459–T461.’
Bertsekas, D. P. and Tsitsiklis, J. N., (1989), Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, New Jersey.
Byron, R. P., (1978), The estimation of large social accounts matrices,’ Journal of the Royal Statistical Society Series A, 141:359–369.
Cottle, R. W., Duvall, S. G., and Zikan, K., (1986), ’A lagrangean relaxation algorithm for the constrained matrix problem,’ Naval Research Logistics Quarterly, 33: 55–76.
Dafermos, S., (1982), ’The general multimodal network equilibrium problem with elastic demand,’ Networks 12:57–72.
Dafermos, S., (1983), ’An iterative scheme for variational inequalities,’ Mathematical Programming, 26: 40–47.
Dafermos, S. and Nagurney, A., (1989), ’Supply and demand equilibration algorithms for a class of market equilibrium problems,’ Transportation Science, 23: 118–124.
Deming, W. E. and Stephan, F. F., (1940),’On a least-squares adjustment of a sampled frequency table when the expected marginal totals are known,’ Annals of Mathematical Statistics, 11: 427–444.
Dervis, K., De Melo, J., and Robinson, S., (1982), General equilibrium models for development policy, Cambridge University Press, Cambridge, United Kingdom.
Enke, S., (1951), ’Equilibrium among spatially separated markets: solution by electric analogue,’ Econometrica 19, 40–48.
Eydeland, A. and Nagurney, A., (1989),’Progressive equilibration algorithms: the case of linear transaction costs,’ Computer Science in Economics and Management, 2: 197–219.
Friedlander, D., (1961), ’A technique for estimating a contingency table given the marginal total and some supplementary data,’ Journal of the Royal Statistical Society A, 124: 412–420.
Hanson, K. A. and Robinson, S., (1989), ’Data, linkages, and models: U.S. national income and product accounts in the framework of a social accounting matrix,’ Agriculture and Rural Economy Division, Economic Research Service, U. S. Department of Agriculture. Staff Report No. AGES 89-5.
Harrigan, F. and Buchanan, I., (1984), ’Quadratic programming approach to input-output estimation and simulation,’ Journal of Regional Science, 24, no. 3: 339–358.
Judge, G. G. and Yancey, T. A., (1986),Improved methods of inference in econometrics, North- Holland.
King, B. B., (1985), ’What is a SAM?’, in Social accounting matrices: a basis for planning, G. Pyatt and J. I. Round (eds.), The World Bank, Washington, DC.
Klincewicz, J., (1989), ’Implementing an exact Newton method for separable convex transportation problems,’ Networks, 19: 95–105.
Miller, R. E. and Blair, P. D., (1985) Jnputloutput analysis: foundations and extensions, Prentice-Hall, Englewood Cliffs, N.J.
Mohr, M., Crown, W. H., and Polenske, K. E., (1987), ’A linear programming approach to solving infeasible RAS problems,’ Journal of Regional Science,27, no. 4: 587–603.
Mosteller, F. and Tukey, J. W., (1977),Data analysis and regression, Addison-Wesley Publishing Co., Inc.
Nagurney, A., (1987),’Competitive equilibrium problems, variational inequalities, and regional science, ’Journal of Regional Science,27: 503–514.
Nagurney, A., (1989),’An algorithm for the solution of a quadratic programming problem with application to constrained matrix and spatial price equilibrium problems,’ Environment and Planning A, 21:99–114.
Nagurney, A., Kim, D. S., and Robinson, A. G., (1990), ’Serial and parallel equilibration of largescale constrained matrix problems with application to the social and economic sciences,’ The International Journal of Supercomputer Applications 4.1, Spring, 49–71.
Nagurney, A. and Robinson, A. G., (1989), ’Algorithms for quadratic constrained matrix problems,’ to appear in Mathematical and Computer Modelling.
Ohuchi, A. and Kaji, I., (1984),’Lagrangean dual coordinatewise maximization for network transportation problems with quadratic costs,’ Networks, 14: 525–530.
Polenske, K. E., (1980),U. S. multiregional input-output accounts and model, Lexington Books, Lexington, MA.
Pyatt, G. and Round, J. I., (1985),(eds.), Social accounting matrices: a basis for planning, The World Bank, Washington, DC.
Samuelson, P. A., (1952),’A spatial price equilibrium and linear programming,’ American Economic Review 42: 283–303.
Stone, R., (1951), ’Simple transaction models, information, and computing,’ The Review of Economic Studies XIX (2), 49: 67–84.
Stone, R., (1962), ’Multiple classifications if social accounting,’ Bulletin de l’Institut International de Statistique, 39:215–233.
Takayama, T. and Judge, G. G., (1971),Spatial and temporal price and allocation models; North- Holland, Amsterdam.
Van der Ploeg, F, (1982), ’Reliability and adjustment of sequences of large economic accounting matrices,’ Journal of the Royal Statistical Society A, 145: 169–184.
Van der Ploeg, F, (1988), ’Balancing large systems of national accounts,’ Computer Science in Economics and Management, 1: 31–39.
Van der Sluis, A., (1969), ’Condition numbers and equilibration of matrices,’ Numerische Mathematik, 14: 14–23.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Nagurney, A., Eydeland, A. (1992). A Splitting Equilibration Algorithm for the Computation of Large-Scale Constrained Matrix Problems: Theoretical Analysis and Applications. In: Amman, H.M., Belsley, D.A., Pau, L.F. (eds) Computational Economics and Econometrics. Advanced Studies in Theoretical and Applied Econometrics, vol 22. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3162-9_6
Download citation
DOI: https://doi.org/10.1007/978-94-011-3162-9_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5394-5
Online ISBN: 978-94-011-3162-9
eBook Packages: Springer Book Archive