ShopSpell

Numerical Methods for Structured Markov Chains [Hardcover]

$206.99       (Free Shipping)
100 available
  • Category: Books (Mathematics)
  • Author:  Bini, Dario A., Latouche, Guy, Meini, Beatrice
  • Author:  Bini, Dario A., Latouche, Guy, Meini, Beatrice
  • ISBN-10:  0198527683
  • ISBN-10:  0198527683
  • ISBN-13:  9780198527688
  • ISBN-13:  9780198527688
  • Publisher:  Oxford University Press
  • Publisher:  Oxford University Press
  • Pages:  336
  • Pages:  336
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-Jul-2005
  • Pub Date:  01-Jul-2005
  • SKU:  0198527683-11-MPOD
  • SKU:  0198527683-11-MPOD
  • Item ID: 100845732
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 01 to Jul 03
  • Notes: Brand New Book. Order Now.
Intersecting two large research areas--numerical analysis and applied probability/quering theory--this book is a self -contained introduction to the numerical solution of structured Markov chains, which have a wide applicability in queueing theory and stochastic modeling. Aimed at graduates and researchers in numerical analysis, applied mathematics, probability, engineering and computer science it provides a thorough overview of the current literature. The book, consisting of nine chapters, is presented in three parts. Part 1 covers a basic description of the fundamental concepts related to Markov chains, a systematic treatment of the structure matrix tools, including finite Toeplitz matrices, displacement operators, FFT, and the infinite block Toeplitz matrices, their relationship with matrix power series and the fundamental problems of solving matrix equations can computing canonical factorizations. Part 2 deals with the description and analysis of structure Markov chains and includes M/G/1, quasi-birth0death processes, non-skip-free queries and tree-like processes. Part 3 covers solution algorithms where new convergence and applicability results are proved. Each chapter ends with bibliographic notes for further reading, and the book ends with an appendix collecting the main general concepts and results used in the book, a list of the main annotations and algorithms used in the book, and an extensive index.

TOOLS
Introduction to Markov chains
Structured matrix analysis
Matrix equations and canonical factorization
STRUCTURED MARKOV CHAINS
M/G/1-type Markov chains
Phase-type queues
ALGORITHMS
Functional iterations
Logarithmic reduction and cyclic reduction
Alternative approaches
Specialized structures
Appendix
Notations
List of Algorithms
Bibliography

Excellent book which will be of great value to researchers interested in computational aspects of queuls$
Add Review