//]]>
Normal View MARC View ISBD View

Analyzing Markov Chains using Kronecker Products

by Dayar, Tuğrul.
Authors: SpringerLink (Online service) Series: SpringerBriefs in Mathematics, 2191-8198 Physical details: IX, 86 p. 3 illus. online resource. ISBN: 1461441900 Subject(s): Mathematics. | Computer science. | Numerical analysis. | Distribution (Probability theory). | Mathematics. | Probability Theory and Stochastic Processes. | Numerical Analysis. | Probability and Statistics in Computer Science.
Tags from this library:
No tags from this library for this title.
Item type Location Call Number Status Date Due
E-Book E-Book AUM Main Library 519.2 (Browse Shelf) Not for loan

Introduction -- Background -- Kronecker representation -- Preprocessing -- Block iterative methods for Kronecker products -- Preconditioned projection methods -- Multilevel methods -- Decompositional methods -- Matrix analytic methods.

Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation behind using a Kronecker structured representation rather than a flat one is to alleviate the storage requirements associated with the MC. With this approach, systems that are an order of magnitude larger can be analyzed on the same platform. The developments in the solution of such MCs are reviewed from an algebraic point of view and possible areas for further research are indicated with an emphasis on preprocessing using reordering, grouping, and lumping and numerical analysis using block iterative, preconditioned projection, multilevel, decompositional, and matrix analytic methods. Case studies from closed queueing networks and stochastic chemical kinetics are provided to motivate decompositional and matrix analytic methods, respectively.

There are no comments for this item.

Log in to your account to post a comment.

Languages: 
English |
العربية