Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Numerical methods for structured Markov chains

Numerical methods for structured Markov chains
Catalogue Information
Field name Details
Dewey Class 519.233 (DDC 22)
Title Numerical methods for structured Markov chains ([Ebook]) / D.A. Bini, G. Latouche, B. Meini.
Author Bini, Dario Andrea
Added Personal Name Latouche, G. (Guy)
Meini, B. (Beatrice)
Other name(s) Oxford Scholarship Online
Publication Oxford, U.K. : Oxford University Press , 2007
Physical Details 1 online resource
Series Numerical mathematics and scientific computation
ISBN 9780191713286
Note Print publication date: 2005. - Published to Oxford Scholarship Online: September 2007
Summary Note The book deals with the numerical solution of structured Markov chains which include M/G/1 and G/M/1-type Markov chains, QBD processes, non-skip-free queues, and tree-like stochastic processes and has a wide applicability in queueing theory and stochastic modeling. It presents in a unified language the most up to date algorithms, which are so far scattered in diverse papers, written with different languages and notation. It contains a thorough treatment of numerical algorithms to solve these problems, from the simplest to the most advanced and most efficient. Nonlinear matrix equations are at the heart of the analysis of structured Markov chains, they are analysed both from the theoretical, from the probabilistic, and from the computational point of view. The set of methods for solution contains functional iterations, doubling methods, logarithmic reduction, cyclic reduction, and subspace iteration, all are described and analysed in detail. They are also adapted to interesting specific queueing models coming from applications. The book also offers a comprehensive and self-contained treatment of the structured matrix tools which are at the basis of the fastest algorithmic techniques for structured Markov chains. Results about Toeplitz matrices, displacement operators, and Wiener-Hopf factorizations are reported to the extent that they are useful for the numerical treatment of Markov chains. Every and all solution methods are reported in detailed algorithmic form so that they can be coded in a high-level language with minimum effort.:
Mode of acces to digital resource Digital reproduction. Oxford : Oxford University Press, 2007. - Mode of access: World Wide Web. System requirements: Internet Explorer 6.0 (or higher) or Firefox 2.0 (or higher)
System details note Online access is restricted to subscribing institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1093/acprof:oso/9780198527688.001.0001
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 26222 Beginning of record . Catalogue Information 26222 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating26222
Quick Search