| Description |
1 online resource (xix, 539 p.) |
| Contents |
Markov chains -- Direct methods -- Iterative methods -- Projection methods -- Block Hessenberg matrices and solution by recursion -- Decompositional methods -- P-cyclic markov chains -- Transient solutions -- Stochastic automata networks -- Software |
| Summary |
Markov Chains -- Direct Methods -- Iterative Methods -- Projection Methods -- Block Hessenberg Matrices -- Decompositional Methods -- LI-Cyclic Markov -- Chains -- Transient Solutions -- Stochastic Automata Networks -- Software |
|
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 |
| Bibliography |
Includes bibliographical references (p. 513-527) and index |
| Notes |
Description based on print version record and CIP data provided by publisher; resource not viewed |
| Subject |
Markov processes -- Numerical solutions.
|
|
MATHEMATICS -- Probability & Statistics -- Stochastic Processes.
|
|
Markov processes -- Numerical solutions
|
|
Markov-processen.
|
|
Markov, Processus de.
|
| Form |
Electronic book
|
| LC no. |
2021694890 |
| ISBN |
9780691223384 |
|
0691223386 |
|
