Introduction to the Numerical Solution of Markov Chains
Seiten
1994
Princeton University Press (Verlag)
978-0-691-03699-1 (ISBN)
Princeton University Press (Verlag)
978-0-691-03699-1 (ISBN)
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.
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.
William J. Stewart is Professor of Computer Science at North Carolina State University.
* Markov Chains * Direct Methods * Iterative Methods * Projection Methods * Block Hessenberg Matrices * Decompositional Methods * LI-Cyclic Markov Chains * Transient Solutions * Stochastic Automata Networks * Software
| Erscheint lt. Verlag | 4.12.1994 |
|---|---|
| Zusatzinfo | 41 line drawings 74 tables |
| Verlagsort | New Jersey |
| Sprache | englisch |
| Maße | 191 x 254 mm |
| Gewicht | 1162 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| ISBN-10 | 0-691-03699-3 / 0691036993 |
| ISBN-13 | 978-0-691-03699-1 / 9780691036991 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Teil 2 der gestreckten Abschlussprüfung Fachinformatiker/-in …
Buch | Softcover (2025)
Europa-Lehrmittel (Verlag)
CHF 37,90
Wenn Computer mit plus und mal an ihre Grenzen stoßen
Buch | Softcover (2025)
Springer (Verlag)
CHF 32,15
