The basic uniqueness and existence properties of biproportional matrix solutions are reviewed and a direct and constructive proof of the convergence of an iterative routine commonly adopted to adjust a given nonnegative matrix to produce a second matrix (biproportional to the first), whose row and column sums are given strictly positive numbers, is offered. Existing convergence proofs, most of which are limited to particular cases of the present form, are considered.
Get full access to this article
View all access options for this article.
References
1.
BacharachM, 1965“Estimating non-negative matrices from marginal data”International Economic Review6294–310
2.
BacharachM, 1970Biproportional Matrices and Input—Output Change (Cambridge University Press, London)
3.
BearD, 1973“Some theories of telephone traffic distribution: A critical survey”Proceedings, 7th International Teletraffic Congress 531/1-531/5, Stockholm, Sweden
4.
BeardwoodJ EKirbyH R, 1975“Zone definition and the gravity model: The separability, excludability and compressibility properties”Transportation Research9363–369
5.
BrualdiR AParterS VSchneiderH, 1966“The diagonal equivalence of a non-negative matrix to a stochastic matrix”Journal of Mathematical Analysis and Applications1631–50
6.
DantzigG B, 1974“Drews institutionalised divvy economy” (third revision) International Institute for Applied Systems Analysis, Laxenburg, Austria
7.
EvansA W, 1970“Some properties of trip distribution methods”Transportation Research719–36
8.
EvansS P, 1973“A relationship between the gravity model for trip distribution and the transportation problem in linear programming”Transportation Research739–62
9.
EvansS PKirbyH R, 1974“A three dimensional Furness procedure for calibrating gravity models”Transportation Research8105–122
10.
FienbergS E, 1970“An iterative procedure for estimation in contingency tables”The Annals of Mathematical Statistics41907–917
11.
GormanW M, 1963“Estimating trends in Leontief matrices” duplicated note, cited in Bacharach (1970)
12.
HadleyG, 1972Non-linear and Dynamic Programming (second printing) (Addison-Wesley, Reading, Mass)
13.
HerrmannD, 1973Some Results on Uniqueness and Existence of Constrained Matrix Problems Ph D Thesis, Faculty of Commerce, University of Birmingham, England
14.
IrelandC TKullbackS, 1968“Contingency tables with given marginals”Biometrika55179–188
15.
KruithofJ, 1937“Calculation of telephone traffic” (Telefoonsverkeersrekening) De Ingenieur, E. Electrotechniek3, 52 (8), E21–E25. Translation 2663, Post Office Research Department Library, London
16.
MelnickE LYechialiU, 1976“A mathematical programming formulation of estimation problems related to contingency tables”Management Science22701–703
17.
MenonM V, 1967“Reduction of a matrix with positive elements to a doubly stochastic matrix”Proceedings of the American Mathematical Society18244–247
18.
MenonM V, 1968“Matrix links, an extremisation problem, and the reduction of a non-negative matrix to one with prescribed row and column totals”Canadian Journal of Mathematics20225–232
19.
MurchlandJ D, 1966“Some remarks on the gravity model of traffic distribution and an equivalent maximisation formulation” mimeo TNT-38 London School of Economics, England
20.
RockafellerR T, 1967“Convex programming and systems of elementary relations”Journal of Mathematical Analysis and Applications19543–564
21.
SinkhornR, 1964“A relationship between arbitrary positive matrices and doubly stochastic matrices”Annals of Mathematical Statistics35876–879
22.
SinkhornR, 1967“Diagonal equivalence to matrices with prescribed row and column sums”American Mathematical Monthly74402–408
23.
SinkhornRKnoppP, 1967“Concerning non-negative matrices and doubly stochastic matrices”Pacific Journal of Mathematics21343–348
24.
WilsonA G, 1970Entropy in Urban and Regional Modelling (Pion, London)
25.
WolfeP, 1961“A duality theorem for non-linear programming”Quarterly of Applied Mathematics19239–244
