Abstract
A square matrix is called line-sum-symmetric if the sum of elements in each of its rows equals the sum of elements in the corresponding column. Let A be an n×n nonnegative matrix and let X and Y be n×n diagonal matrices having positive diagonal elements. Then the matrices XA, XAX−1 and XAY are called a row-scaling, a similarity-scaling and an equivalence-scaling of A. The purpose of this paper is to study the different forms of line-sum-symmetric scalings of square nonnegative matrices. In particular, we characterize matrices for which such scalings exist and show uniqueness of similarity-scalings and uniqueness of row-scalings, up to a scalar multiple of the blocks corresponding to the classes of the given matrix.
This research was partially supported by National Science Foundation Grants MCS-81-21838, ECS-83-10213, MCS-80-26132 and DMS-8320189.
Preview
Unable to display preview. Download preview PDF.
References
A. Berman and R.J. Plemmons, Nonnegative matrices in the mathematical sciences (Academic Press, New York, 1979).
R.A. Brualdi, S.V. Parter and H. Schneider, “The diagonal equivalence of a nonnegative matrix to a stochastic matrix”, Journal of Mathematical Analysis and Applications 16 (1979) 31–50.
G.B. Dantzig, B.C. Eaves and U.G. Rothblum, “A decomposition and scaling-inequality for line-sum-symmetric nonnegative matrices”, SIAM Journal of Algebraic and Discrete Methods 6 (1985) 237–241.
B.C. Eaves, “Finite solution of pure trade markets with Cobb-Douglas utilities”, unpublished manuscript (1984).
G.M. Engel and H. Schneider, “Diagonal similarity and equivalence for matrices over groups with 0”, Czechoslovak Mathematical Journal 25 (1975) 389–403.
G.M. Engel and H. Schneider, “Cyclic and diagonal products on a matrix”, Linear Algebra and Its Applications 7 (1973) 301–335.
M. Fiedler, C.R. Johnson, T.L. Markham and M. Neumann, “A trace inequality for M-matrices and the symmetrizability of a real matrix by a positive diagonal matrix”, Linear Algebra and its Applications (1985), to appear.
M.v. Golitschek, U.G. Rothblum and H. Schneider, “A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds”, Mathematical Programming 27 (1983) 291–306.
D.J. Hartfiel, “Concerning diagonal similarity of irreducible matrices”, Proceedings of the American Mathematical Society 30 (1971) 413–425.
B.B. King, “What is SAM? A layman’s guide to social accounting matrices”, World Bank Working Paper No. 463 (1981).
A.W. Marshall and I. Olkin, “Scaling of matrices to achieve specified row and column sums”, Numerische Mathematik 12 (1968) 83–90.
M.V. Menon, “Reduction of a matrix with positive elements to a doubly stochastic matrix”, Proceedings of the American Mathematical Society 18 (1967) 244–247.
G. Pyatt and E. Thorbecke, Planning techniques for a better future (I.L.O., Geneva, 1976).
B.D. Saunders and H. Schneider, “Flows on graphs and applied to diagonal similarity and diagonal equivalence for matrices”, Discrete Mathematics 24 (1978) 205–220.
B.D. Saunders and H. Schneider, “Applications of the Gordan-Stiemke Theorem in combinatorial matrix theory”, SIAM Review 21 (1979) 528–541.
R. Sinkhorn, “On best doubly stochastic estimates”, Notices of American Society 294 (1962) 592–634.
R. Sinkhorn, “A relationship between arbitrary positive matrices and stochastic matrices”, Annals of Mathematical Statistics 35 (1964) 876–879.
R. Sinkhorn and P. Knopp, “Concerning nonnegative matrices and doubly stochastic matrices”, Pacific Journal of Mathematics 21 (1967) 343–348.
Author information
Authors and Affiliations
Editor information
Additional information
Dedicated to G.B. Dantzig on the occasion of his seventieth birthday.
Rights and permissions
Copyright information
© 1985 The Mathematical Programming Society, Inc.
About this chapter
Cite this chapter
Eaves, B.C., Hoffman, A.J., Rothblum, U.G., Schneider, H. (1985). Line-sum-symmetric scalings of square nonnegative matrices. In: Cottle, R.W. (eds) Mathematical Programming Essays in Honor of George B. Dantzig Part II. Mathematical Programming Studies, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0121080
Download citation
DOI: https://doi.org/10.1007/BFb0121080
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00920-4
Online ISBN: 978-3-642-00921-1
eBook Packages: Springer Book Archive