## Nonnegative matrices in dynamic programming |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Introduction | 1 |

a structure analysis | 19 |

A A fundamental set of equations | 42 |

Copyright | |

10 other sections not shown

### Common terms and phrases

algebraic integers algebraic number field ALGOL 60 analogous aperiodic appendix assume assumption asymptotic behaviour basic class chapter choose constant continuous-time convergence parameter convergence result defined definition diophantine equations Doeblin condition dynamic programming recursions eigenvalue exists final class finite set follows immediately function Furthermore Hence holds i e D(0 i,j e implies inequality integers x,y integral coefficients irreducible nonnegative matrices ISBN 90 iteration Markov chains Markov decision processes Markov process Math max a(P methods ML-matrices non-zero nonnegative matrices Note number of solutions obtain optimal polynomial positive integers prime ideals principal partition product property proof of lemma proof of theorem prove R-invariant vectors R-recurrent respect set of reference sets of nonnegative SLADKY solutions of 2.6 spectral radius square nonnegative matrix stochastic matrix Suppose theorem 5.1 upper bound ZIJM