×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

Computations with Markov Chains: Proceedings of the 2nd International Workshop on the Numerical Solution of Markov Chains / Edition 1
     

Computations with Markov Chains: Proceedings of the 2nd International Workshop on the Numerical Solution of Markov Chains / Edition 1

by William J. Stewart
 

ISBN-10: 0792395506

ISBN-13: 9780792395508

Pub. Date: 02/28/1995

Publisher: Springer US

Computations with Markov Chains presents the edited and reviewed proceedings of the Second International Workshop on the Numerical Solution of Markov Chains, held January 16—18, 1995, in Raleigh, North Carolina. New developments of particular interest include recent work on stability and conditioning, Krylov subspace-based methods for transient solutions,

Overview

Computations with Markov Chains presents the edited and reviewed proceedings of the Second International Workshop on the Numerical Solution of Markov Chains, held January 16—18, 1995, in Raleigh, North Carolina. New developments of particular interest include recent work on stability and conditioning, Krylov subspace-based methods for transient solutions, quadratic convergent procedures for matrix geometric problems, further analysis of the GTH algorithm, the arrival of shastic automata networks at the forefront of modelling stratagems, and more.
An authoritative overview of the field for applied probabilists, numerical analysts and systems modelers, including computer scientists and engineers.

Product Details

ISBN-13:
9780792395508
Publisher:
Springer US
Publication date:
02/28/1995
Edition description:
1995
Pages:
600
Product dimensions:
6.10(w) x 9.25(h) x 0.05(d)

Related Subjects

Table of Contents

Preface. 1. Detecting Block GI/M/1 and Block M/G/1 Matrices from Model Specifications; S. Berson, R. Muntz. 2. On Cyclic Reduction Applied to a Class of Toeplitz-like Matrices Arising in Queueing Problems; D. Bini, B. Meini. 3. A Markov Modulated, Nearly Completely Decomposable M/M/1 Queue; G. Latouche, P.J. Schweitzer. 4. Preconditioned Krylov Subspace Methods for the Numerical Solution of Markov Chains; Y. Saad. 5. A Parallel Block Projection Method of the Cimmino Type for Finite Markov Chains; M. Benzi, F. Sgallari, G. Spaletta. 6. Iterative Methods for Queueing Models with Batch Arrivals; R.H. Chan, W-K. Ching. 7. Transient Solutions of Markov Processes by Krylov Subspaces; R.B. Sidje, B. Philippe. 8. Exact Methods for the Transient Analysis of Nonhomogeneous Continuous Time Markov Chains; A. Rindos, S. Woolet, I. Viniotis, K. Trivedi. 9. Time-Dependent Behavior of Redundant Systems with Deterministic Repair; D. Logothetis, K. Trivedi. 10. What is Fundamental for Markov Chains: First Passage Times, Fundamental Matrices, and Group Generalized Inverses; D.P. Heyman, D.P. O'Leary. 11. Immediate Events in Markov Chains; W.K. Grassmann, Yuru Wang. 12. Compositional Markovian Modelling Using a Process Algebra; J. Hillston. 13. Equivalence Relations for Shastic Automata Networks; P. Buchholz. 14. Graphs and Shastic Automata Networks; J.-M. Fourneau, F. Quessette. 15. Analyzing Sample Path Data from Markov Chain Sampling Experiments; G. Fishman. 16. Resource Sharing Models with State-Dependent Arrivals of Batches; G.L. Choudhury, K.K. Leung, W. Whitt. 17. Implementable Policies: Discounted Cost Case; V.G. Kulkarni, Y. Serin. 18. Two Bounding Schemes for the Steady-State Solution of Markov Chains; P. Semal. 19. The Power-Series Algorithm for Markovian Queueing Networks; W.B. van den Hout, J.P.C. Blanc. 20. Discrete-Time Markovian Shastic Petri Nets; G. Ciardo. 21. Concurrent Generalized Petri Nets; V. Catania, A. Puliafito, M. Scarpa, L. Vita. 22. Exploiting Isomorphisms and Special Structures in the Analysis of Markov Regenerative Shastic Petri Nets; C. Lindemann. 23. Numerical Solution of Large Finite Markov Chains by Algebraic Multigrid Techniques; U.R. Krieger. 24. On the Utility of the Multi-Level Algorithm for the Solution of Nearly Completely Decomposable Markov Chains; S.T. Leutenegger, G. Horton. 25. A Computationally Efficient Algorithm for Characterizing the Superposition of Multiple Heterogeneous Interrupted Bernoulli Processes; K.M. Elsayed, H.G. Perros. 26. Generalized Folding Algorithm for Transient Analysis of Finite QBD Processes and its Queueing Applications; S-Q. Li, H-D. Sheng. 27. Efficient Solutions for a Class of Non-Markovian Models; E. de Souza e Silva, H.R. Gail, R.R. Muntz. 28. Markovian Arrival and Service Communication Systems: Spectral Expansions, Separability and Kronecker-Product Forms; A. Elwalid, D. Mitra. 29. Empirical Comparison of Uniformization Methods for Continuous-Time Markov Chains; J.D. Diener, W.H. Sanders. 30. Numerical Methods for M/G/1 Type Queues; G. Latouche, G.W. Stewart. 31. Closing the Gap between Classical and Tensor Based Iteration Techniques; P. Kemper. 32. Adaptive Relaxation for the Steady-State Analysis of Markov Chains; G. Horton. 33. State Space Decomposition for Large Markov Chains; P. Kemper. 34. Aggregation/Disaggregation Method on Parallel Computer; Y. Takahashi, K. Fujimoto. 35. Parallel Implementation of the GTH Algorithm for Markov Chains; D.M. Cohen, D.P. Heyman, A. Rabinovitch, D. Brown. 36. A Parallel Implementation of the Block-GTH Algorithm; Y-J.J. Wu. 37. Approximate Computation of Sojourn Time Distribution in Open Queueing Networks; V. Mainkar, K.S. Trivedi, A.J. Rindos.

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews