Computation of the eigenprojection of a nonnegative matrix at its spectral radius

  • G. Rothblum
Part of the Mathematical Programming Studies book series (MATHPROGRAMM, volume 6)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. Debreu, and I. N. Herstein, “Nonnegative square matrices”, Econometrica 21 (1953) 597–607.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    N. Dunford and J. T. Schwartz, Linear operators, Part I (Interscience, New York, 1958).MATHGoogle Scholar
  3. [3]
    D. Gale, The theory of linear economic models (McGraw-Hill, New York, 1960).Google Scholar
  4. [4]
    F. A. Graybill, Introduction to matrices with applications to statistics (Wadsworth Publishing Company, Inc., Belmont, Calif., 1969).Google Scholar
  5. [5]
    S. Karlin, Mathematical methods and theory of games, programming, and economics, Vol. I (Addison-Wesley, Reading, Mass, 1959).Google Scholar
  6. [6]
    T. Kato, Perturbation theory for linear operators (Springer, New York, 1966).MATHGoogle Scholar
  7. [7]
    J. Kemeny and J. Snell, Finite Markov chains (Van Nostrand, Princeton, N. J., 1960).MATHGoogle Scholar
  8. [8]
    H. Nikaido, Convex structure and economic theory (Academic Press, New York, 1968).Google Scholar
  9. [9]
    M. C. Pease, Methods of matrix algebra (AcademicPress, New York, 1965).MATHGoogle Scholar
  10. [10]
    U. G. Rothblum, “Multiplicative Markov decision chains”, Ph. D. Dissertation, Department of Operations Research, Stanford University, Stanford, Calif. (1974).Google Scholar
  11. [11]
    U. G. Rothblum, “Algebraic eigenspaces of nonnegative matrices”, Linear Algebra and its Applications 12 (1975) 281–292.MATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    U. G. Rothblum, “Expansions of sums of matrix powers and resolvents”, to appear.Google Scholar
  13. [13]
    U. G. Rothblum and A. F. Veinott, Jr., “Average-overtaking cumulative optimality for polynomially bounded Markov decision chains”, to appear.Google Scholar
  14. [14]
    R. S. Varga, Matrix iterative analysis (Prentice-Hall, Englewood Cliffs, N. J., 1962).Google Scholar
  15. [15]
    A. F. Veinott, Jr., “Discrete dynamic programming with sensitive discount optimality criteria”, Annals of Mathematical Statistics 40 (1969) 1635–1660.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© The Mathematical Programming Society 1976

Authors and Affiliations

  • G. Rothblum
    • 1
  1. 1.Yale UniversityNew HavenUSA

Personalised recommendations