A Comparative Study of Algorithms for Matrix Balancing

Michael H. Schneider and Stavros Zenios
Additional contact information
Michael H. Schneider: Johns Hopkins University, Baltimore, Maryland

Operations Research, 1990, vol. 38, issue 3, 439-455

Abstract: The problem of adjusting the entries of a large matrix to satisfy prior consistency requirements occurs in economics, urban planning, statistics, demography, and stochastic modeling; these problems are called Matrix Balancing Problems . We describe five applications of matrix balancing and compare the algorithmic and computational performance of balancing procedures that represent the two primary approaches for matrix balancing—matrix scaling and nonlinear optimization. The algorithms we study are the RAS algorithm, a diagonal similarity scaling algorithm, and a truncated Newton algorithm for network optimization. We present results from computational experiments with large-scale problems based on producing consistent estimates of Social Accounting Matrices for developing countries.

Keywords: economics; input-output analysis: estimating social accounting matrices; networks/graphs; applications: network models in economics; statistics and urban planning; programming; nonlinear algorithms/applications; scaling and nonlinear optimization for matrix balancing (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (44)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.3.439 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:3:p:439-455

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().