Abstract
In this paper we give a general representation for a projection in terms of its range and the range of its adjoint projection. By combining this representation with recent results of the author on the structure of the algebraic eigenspace of a nonnegative matrix corresponding to its spectral radius, we develop a computational method to find the cigenprojection of a nonnegative matrix at its spectral radius. The results are illustrated by giving a closed formula for computing the limiting matrix of a stochastic matrix.
Parts of the research reported in this paper are based on the author’s Ph.D. dissertation submitted to the Department of Operations Research at Stanford University. Research at Stanford University was supported by NSF Grant GK-18339 and ONR Contract N00014-67-A-0112-0050. Further research at the Courant Institute was supported by NSF Grant GP-37069.
My deepest thanks are given to my teacher and advisor, Professor Arthur F. Veinott, Jr., for his guidance and advice, for his insight and perspective, during the preparation of my Ph.D. dissertation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Debreu, and I. N. Herstein, “Nonnegative square matrices”, Econometrica 21 (1953) 597–607.
N. Dunford and J. T. Schwartz, Linear operators, Part I (Interscience, New York, 1958).
D. Gale, The theory of linear economic models (McGraw-Hill, New York, 1960).
F. A. Graybill, Introduction to matrices with applications to statistics (Wadsworth Publishing Company, Inc., Belmont, Calif., 1969).
S. Karlin, Mathematical methods and theory of games, programming, and economics, Vol. I (Addison-Wesley, Reading, Mass, 1959).
T. Kato, Perturbation theory for linear operators (Springer, New York, 1966).
J. Kemeny and J. Snell, Finite Markov chains (Van Nostrand, Princeton, N. J., 1960).
H. Nikaido, Convex structure and economic theory (Academic Press, New York, 1968).
M. C. Pease, Methods of matrix algebra (AcademicPress, New York, 1965).
U. G. Rothblum, “Multiplicative Markov decision chains”, Ph. D. Dissertation, Department of Operations Research, Stanford University, Stanford, Calif. (1974).
U. G. Rothblum, “Algebraic eigenspaces of nonnegative matrices”, Linear Algebra and its Applications 12 (1975) 281–292.
U. G. Rothblum, “Expansions of sums of matrix powers and resolvents”, to appear.
U. G. Rothblum and A. F. Veinott, Jr., “Average-overtaking cumulative optimality for polynomially bounded Markov decision chains”, to appear.
R. S. Varga, Matrix iterative analysis (Prentice-Hall, Englewood Cliffs, N. J., 1962).
A. F. Veinott, Jr., “Discrete dynamic programming with sensitive discount optimality criteria”, Annals of Mathematical Statistics 40 (1969) 1635–1660.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 The Mathematical Programming Society
About this chapter
Cite this chapter
Rothblum, G. (1976). Computation of the eigenprojection of a nonnegative matrix at its spectral radius. In: Wets, R.J.B. (eds) Stochastic Systems: Modeling, Identification and Optimization, II. Mathematical Programming Studies, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120751
Download citation
DOI: https://doi.org/10.1007/BFb0120751
Received:
Revised:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00785-9
Online ISBN: 978-3-642-00786-6
eBook Packages: Springer Book Archive