Read and Download eBook Full
Author: William J. Stewart
Publisher: Princeton University Press
Published: 1994-12-04
Total Pages: 561
ISBN-13: 0691036993
DOWNLOAD EBOOKMarkov Chains -- Direct Methods -- Iterative Methods -- Projection Methods -- Block Hessenberg Matrices -- Decompositional Methods -- LI-Cyclic Markov -- Chains -- Transient Solutions -- Stochastic Automata Networks -- Software.
Author: William J. Stewart
Publisher: Princeton University Press
Published: 2021-01-12
Total Pages: 561
ISBN-13: 0691223386
DOWNLOAD EBOOKA 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.
Author: Dario A. Bini
Publisher: OUP Oxford
Published: 2005-02-03
Total Pages: 340
ISBN-13: 9780198527688
DOWNLOAD EBOOKIntersecting two large research areas - numerical analysis and applied probability/queuing theory - this book is a self-contained introduction to the numerical solution of structured Markov chains, which have a wide applicability in queuing theory and stochastic modeling and include M/G/1 and GI/M/1-type Markov chain, quasi-birth-death processes, non-skip free queues and tree-like stochastic processes. Written for applied probabilists and numerical analysts, but accessible toengineers and scientists working on telecommunications and evaluation of computer systems performances, it provides a systematic treatment of the theory and algorithms for important families of structured Markov chains and 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 and computing canonical factorizations. Part 2 deals with the description andanalysis of structure Markov chains and includes M/G/1, quasi-birth-death processes, non-skip-free queues 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 bookends 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.
Author: Harold Kushner
Publisher: Springer Science & Business Media
Published: 2013-11-27
Total Pages: 480
ISBN-13: 146130007X
DOWNLOAD EBOOKStochastic control is a very active area of research. This monograph, written by two leading authorities in the field, has been updated to reflect the latest developments. It covers effective numerical methods for stochastic control problems in continuous time on two levels, that of practice and that of mathematical development. It is broadly accessible for graduate students and researchers.
Author: William J. Stewart
Publisher: CRC Press
Published: 2021-07-01
Total Pages: 0
ISBN-13: 1000447367
DOWNLOAD EBOOKPapers presented at a workshop held January 1990 (location unspecified) cover just about all aspects of solving Markov models numerically. There are papers on matrix generation techniques and generalized stochastic Petri nets; the computation of stationary distributions, including aggregation/disaggregation.
Author: Peter E. Kloeden
Publisher: Springer Science & Business Media
Published: 2013-04-17
Total Pages: 666
ISBN-13: 3662126168
DOWNLOAD EBOOKThe numerical analysis of stochastic differential equations (SDEs) differs significantly from that of ordinary differential equations. This book provides an easily accessible introduction to SDEs, their applications and the numerical methods to solve such equations. From the reviews: "The authors draw upon their own research and experiences in obviously many disciplines... considerable time has obviously been spent writing this in the simplest language possible." --ZAMP
Author: Henk C. Tijms
Publisher: John Wiley & Sons
Published: 2003-04-18
Total Pages: 494
ISBN-13: 9780471498803
DOWNLOAD EBOOKThe field of applied probability has changed profoundly in the past twenty years. The development of computational methods has greatly contributed to a better understanding of the theory. A First Course in Stochastic Models provides a self-contained introduction to the theory and applications of stochastic models. Emphasis is placed on establishing the theoretical foundations of the subject, thereby providing a framework in which the applications can be understood. Without this solid basis in theory no applications can be solved. Provides an introduction to the use of stochastic models through an integrated presentation of theory, algorithms and applications. Incorporates recent developments in computational probability. Includes a wide range of examples that illustrate the models and make the methods of solution clear. Features an abundance of motivating exercises that help the student learn how to apply the theory. Accessible to anyone with a basic knowledge of probability. A First Course in Stochastic Models is suitable for senior undergraduate and graduate students from computer science, engineering, statistics, operations resear ch, and any other discipline where stochastic modelling takes place. It stands out amongst other textbooks on the subject because of its integrated presentation of theory, algorithms and applications.
Author: William J. Stewart
Publisher: Princeton University Press
Published: 2009-07-06
Total Pages: 777
ISBN-13: 1400832810
DOWNLOAD EBOOKProbability, Markov Chains, Queues, and Simulation provides a modern and authoritative treatment of the mathematical processes that underlie performance modeling. The detailed explanations of mathematical derivations and numerous illustrative examples make this textbook readily accessible to graduate and advanced undergraduate students taking courses in which stochastic processes play a fundamental role. The textbook is relevant to a wide variety of fields, including computer science, engineering, operations research, statistics, and mathematics. The textbook looks at the fundamentals of probability theory, from the basic concepts of set-based probability, through probability distributions, to bounds, limit theorems, and the laws of large numbers. Discrete and continuous-time Markov chains are analyzed from a theoretical and computational point of view. Topics include the Chapman-Kolmogorov equations; irreducibility; the potential, fundamental, and reachability matrices; random walk problems; reversibility; renewal processes; and the numerical computation of stationary and transient distributions. The M/M/1 queue and its extensions to more general birth-death processes are analyzed in detail, as are queues with phase-type arrival and service processes. The M/G/1 and G/M/1 queues are solved using embedded Markov chains; the busy period, residual service time, and priority scheduling are treated. Open and closed queueing networks are analyzed. The final part of the book addresses the mathematical basis of simulation. Each chapter of the textbook concludes with an extensive set of exercises. An instructor's solution manual, in which all exercises are completely worked out, is also available (to professors only). Numerous examples illuminate the mathematical theories Carefully detailed explanations of mathematical derivations guarantee a valuable pedagogical approach Each chapter concludes with an extensive set of exercises
Author: Winfried K. Grassmann
Publisher: Springer Science & Business Media
Published: 2000
Total Pages: 514
ISBN-13: 9780792386179
DOWNLOAD EBOOKGreat advances have been made in recent years in the field of computational probability. In particular, the state of the art - as it relates to queuing systems, stochastic Petri-nets and systems dealing with reliability - has benefited significantly from these advances. The objective of this book is to make these topics accessible to researchers, graduate students, and practitioners. Great care was taken to make the exposition as clear as possible. Every line in the book has been evaluated, and changes have been made whenever it was felt that the initial exposition was not clear enough for the intended readership. The work of major research scholars in this field comprises the individual chapters of Computational Probability. The first chapter describes, in nonmathematical terms, the challenges in computational probability. Chapter 2 describes the methodologies available for obtaining the transition matrices for Markov chains, with particular emphasis on stochastic Petri-nets. Chapter 3 discusses how to find transient probabilities and transient rewards for these Markov chains. The next two chapters indicate how to find steady-state probabilities for Markov chains with a finite number of states. Both direct and iterative methods are described in Chapter 4. Details of these methods are given in Chapter 5. Chapters 6 and 7 deal with infinite-state Markov chains, which occur frequently in queueing, because there are times one does not want to set a bound for all queues. Chapter 8 deals with transforms, in particular Laplace transforms. The work of Ward Whitt and his collaborators, who have recently developed a number of numerical methods for Laplace transform inversions, is emphasized in this chapter. Finally, if one wants to optimize a system, one way to do the optimization is through Markov decision making, described in Chapter 9. Markov modeling has found applications in many areas, three of which are described in detail: Chapter 10 analyzes discrete-time queues, Chapter 11 describes networks of queues, and Chapter 12 deals with reliability theory.
Author: William J. Stewart
Publisher: CRC Press
Published: 1991-05-23
Total Pages: 738
ISBN-13: 9780824784058
DOWNLOAD EBOOKPapers presented at a workshop held January 1990 (location unspecified) cover just about all aspects of solving Markov models numerically. There are papers on matrix generation techniques and generalized stochastic Petri nets; the computation of stationary distributions, including aggregation/disagg
