Constructive Computation in Stochastic Models with Applications

The RG-Factorization

  • Quan-Lin Li

Table of contents

  1. Front Matter
    Pages i-xiv
  2. Quan-Lin Li
    Pages 1-71
  3. Quan-Lin Li
    Pages 72-130
  4. Quan-Lin Li
    Pages 131-175
  5. Quan-Lin Li
    Pages 176-215
  6. Quan-Lin Li
    Pages 216-287
  7. Quan-Lin Li
    Pages 288-330
  8. Quan-Lin Li
    Pages 331-388
  9. Quan-Lin Li
    Pages 389-431
  10. Quan-Lin Li
    Pages 432-525
  11. Quan-Lin Li
    Pages 526-573
  12. Back Matter
    Pages 652-672

About this book

Introduction

"Constructive Computation in Stochastic Models with Applications: The RG-Factorizations" provides a unified, constructive and algorithmic framework for numerical computation of many practical stochastic systems. It summarizes recent important advances in computational study of stochastic models from several crucial directions, such as stationary computation, transient solution, asymptotic analysis, reward processes, decision processes, sensitivity analysis as well as game theory. Graduate students, researchers and practicing engineers in the field of operations research, management sciences, applied probability, computer networks, manufacturing systems, transportation systems, insurance and finance, risk management and biological sciences will find this book valuable.

Dr. Quan-Lin Li is an Associate Professor at the Department of Industrial Engineering of Tsinghua University, China.

Keywords

Analysis Markov Markov Chain Markov Chains Markov decision process Markov renewal process Sage Stochastic model Stochastic models algorithm game theory operations research optimization

Authors and affiliations

  • Quan-Lin Li
    • 1
  1. 1.Department of Industrial EngineeringTsinghua UniversityBeijingP. R. China

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-11492-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 2010
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-642-11491-5
  • Online ISBN 978-3-642-11492-2
  • About this book