Skip to product information
1 of 1
Sold Out

Introduction to the Numerical Solution of Markov Chains

Introduction to the Numerical Solution of Markov Chains

Hardback

Regular price £156.06
Regular price Sale price £156.06

Join our rewards scheme and earn 468 reward points on this purchase!

Earn 468 points on this!

Sign in or Sign up!
View full details
  • Release Date: 04/12/1994
  • Barcode: 9780691036991
  • Genre: Science Nature & Math
  • Sub-Genre: Computing & Internet
  • Imprint: Princeton University Press
  • Publisher: Princeton University Press
Introduction to the Numerical Solution of Markov Chains

Introduction to the Numerical Solution of Markov Chains

Collapsible content

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.
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.

DELIVERY & RETURNS

UK Delivery:

  • Free delivery on all orders of £10 or more.
  • £1.49 delivery fee on orders below £10.
  • UK orders are shipped via Royal Mail 2nd Class.

International Delivery:

  • Flat rate delivery charges vary by country.

Dispatch and Delivery Times:

  • All orders are shipped from our warehouse in Northampton, UK within 48 hours of receipt during working hours.
  • UK mainland orders typically arrive within 3-5 working days via Royal Mail 2nd Class.
  • International estimated delivery times:
  • Europe & Channel Islands: 7 to 10 working days
  • USA: 7 to 15 working days
  • Rest of the World: 9 to 21 working days

View our full delivery infomation here.

  • OVER

    2 MILLION PRODUCTS

  • 60 MILLION CUSTOMERS

    ACROSS 190 COUNTRIES