Computations with Markov Chains

Edited by William J. Stewart

in Springer Books from Springer

Date: 1995
ISBN: 978-1-4615-2241-6
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Chapters in this book:

Ch 1 Detecting Block GI/M/1 and Block M/G/1 Matrices from Model Specifications

Steven Bersonl and Richard Muntz

Ch 2 On Cyclic Reduction Applied to a Class of Toeplitz-Like Matrices Arising in Queueing Problems

Dario Bini and Beatrice Meini

Ch 3 A Markov Modulated, Nearly Completely Decomposable M/M/1 Queue

Guy Latouche and Paul J. Schweitzer

Ch 4 Preconditioned Krylov Subspace Methods for the Numerical Solution of Markov Chains

Yousef Saad

Ch 5 A Parallel Block Projection Method of the Cimmino Type for Finite Markov Chains

M. Benzi, F. Sgallari and G. Spaletta

Ch 6 Iterative Methods for Queueing Models with Batch Arrivals

Raymond H. Chan and Wai-ki Ching

Ch 7 Transient Solutions of Markov Processes by Krylov Subspaces

Bernard Philippe and Roger B. Sidje

Ch 8 Exact Methods for the Transient Analysis of Nonhomogeneous Continuous Time Markov Chains

A. Rindos, S. Woolet, I. Viniotis and K. Trivedi

Ch 9 Time-Dependent Behavior of Redundant Systems with Deterministic Repair

Dimitris Logothetis and Kishor Trivedi

Ch 10 What is Fundamental for Markov Chains: First Passage Times, Fundamental Matrices, and Group Generalized Inverses

Daniel P. Heyman and Dianne P. O’Leary

Ch 11 Immediate Events in Markov Chains

Winfried K. Grassmann and Yuru Wang

Ch 12 Compositional Markovian Modelling Using a Process Algebra

Jane Hillston

Ch 13 Equivalence Relations for Stochastic Automata Networks

Peter Buchholz

Ch 14 Graphs and Stochastic Automata Networks

Jean-Michel Fourneau and Franck Quessette

Ch 15 Analyzing Sample Path Data from Markov Chain Sampling Experiments

George S. Fishman

Ch 16 Resource-Sharing Models with State-Dependent Arrivals of Batches

Gagan L. Choudhury, Kin K. Leung and Ward Whitt

Ch 17 Implementable Policies: Discounted Cost Case

Yasemin Serin and Vidyadhar G. Kulkarni

Ch 18 Two Bounding Schemes for the Steady-State Solution of Markov Chains

Pierre Semal

Ch 19 The Power-Series Algorithm for Markovian Queueing Networks

W. B. van den Hout and Hans Blanc

Ch 20 Discrete-Time Markovian Stochastic Petri Nets

Gianfranco Ciardo

Ch 21 Concurrent Generalized Petri Nets

V. Catania, A. Puliafito, M. Scarpa and L. Vita

Ch 22 Exploiting Isomorphisms and Special Structures in the Analysis of Markov Regenerative Stochastic Petri Nets

Christoph Lindemann

Ch 23 Numerical Solution of Large Finite Markov Chains by Algebraic Multigrid Techniques

Udo R. Krieger

Ch 24 On the Utility of the Multi-Level Algorithm for the Solution of Nearly Completely Decomposable Markov Chains

Scott T. Leutenegger and Graham Horton

Ch 25 A Computationally Efficient Algorithm for Characterizing the Superposition of Multiple Heterogeneous interrupted Bernoulli Processes

Khaled M. Elsayed and Harry G. Perros

Ch 26 Generalized Folding Algorithm for Transient Analysis of Finite QBD Processes and Its Queueing Applications

San-qi Li and Hong-Dah Sheng

Ch 27 Efficient Solutions for a Class of Non-Markovian Models

Edmundo de Souza e Silva, H. Richard Gail and Richard R. Muntz

Ch 28 Markovian Arrival and Service Communication Systems: Spectral Expansions, Separability and Kronecker-Product Forms

Anwar Elwalid and Debasis Mitra

Ch 29 Empirical Comparison of Uniformization Methods for Continuous-Time Markov Chains

John D. Diener and William H. Sanders

Ch 30 Numerical Methods For M/G/1 Type Queues

Guy Latouche and G. W. Stewart

Ch 31 Closing the Gap Between Classical and Tensor Based Iteration Techniques

Peter Kemper

Ch 32 Adaptive Relaxation for the Steady-State Analysis of Markov Chains

Graham Horton

Ch 33 State Space Decomposition for Large Markov Chains

Maria Rieders

Ch 34 Aggregation/Disaggregation Method on Parallel Computer

Yukio Takahashi and Kou Fujimoto

Ch 35 Parallel Implementation of the GTH Algorithm for Markov Chains

David M. Cohen, Daniel P. Heyman, Asya Rabinovitch and Danit Brown

Ch 36 A Parallel Implementation of the Block-GTH Algorithm

Yuan-Jye Jason Wu

Ch 37 Approximate Computation of Sojourn Time Distribution in Open Queueing Networks

Varsha Mainkar, Kishor S. Trivedi and Andrew J. Rindos

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprbok:978-1-4615-2241-6

Ordering information: This item can be ordered from
http://www.springer.com/9781461522416

DOI: 10.1007/978-1-4615-2241-6

Access Statistics for this book

More books in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().