 |
|
|
Item Details
| Title:
|
INTRODUCTION TO THE NUMERICAL SOLUTION OF MARKOV CHAINS
|
| By: |
William J. Stewart |
| Format: |
Hardback |
| List price:
|
£138.00 |
| Our price: |
£110.40 |
| Discount: |
|
| You save:
|
£27.60 |
|
|
|
|
|
| ISBN 10: |
0691036993 |
| ISBN 13: |
9780691036991 |
| Availability: |
Usually dispatched within 1-3 weeks.
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
PRINCETON UNIVERSITY PRESS |
| Pub. date: |
14 November, 1994 |
| Pages: |
568 |
| Description: |
Offers a systematic and detailed treatment of the numerical solution of Markov chains. This book explores various aspects of numerically computing solutions of Markov chains, especially when the state is huge. It examines many different numerical computing methods - direct, single-and multi-vector iterative, and projection methods. |
| Synopsis: |
A cornerstone of applied probability, Markov chains can be used to help model how plants grow, chemicals react, and atoms diffuse--and applications are increasingly being found in such areas as engineering, computer science, economics, and education. To apply the techniques to real problems, however, it is necessary to understand how Markov chains can be solved numerically. In this book, the first to offer a systematic and detailed treatment of the numerical solution of Markov chains, William Stewart provides scientists on many levels with the power to put this theory to use in the actual world, where it has applications in areas as diverse as engineering, economics, and education. His efforts make for essential reading in a rapidly growing field. Here Stewart explores all aspects of numerically computing solutions of Markov chains, especially when the state is huge. He provides extensive background to both discrete-time and continuous-time Markov chains and examines many different numerical computing methods--direct, single-and multi-vector iterative, and projection methods.More specifically, he considers recursive methods often used when the structure of the Markov chain is upper Hessenberg, iterative aggregation/disaggregation methods that are particularly appropriate when it is NCD (nearly completely decomposable), and reduced schemes for cases in which the chain is periodic. There are chapters on methods for computing transient solutions, on stochastic automata networks, and, finally, on currently available software. Throughout Stewart draws on numerous examples and comparisons among the methods he so thoroughly explains. |
| Illustrations: |
41 line drawings 74 tables |
| Publication: |
US |
| Imprint: |
Princeton University Press |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
No Cheese, Please!
A fun picture book for children with food allergies - full of friendship and super-cute characters!Little Mo the mouse is having a birthday party.
|
My Brother Is a Superhero
Luke is massively annoyed about this, but when Zack is kidnapped by his arch-nemesis, Luke and his friends have only five days to find him and save the world...
|
|
|
|
|