國立高雄大學圖資館 |

登入

回首頁

Numerical methods for solving discrete event systemswith applications to queueing systems /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Numerical methods for solving discrete event systemsby Winfried Grassmann, Javad Tavakoli.
其他題名:	with applications to queueing systems /
作者:	Grassmann, Winfried K.
其他作者:	Tavakoli, Javad.
出版者:	Cham :Springer International Publishing :2022.
面頁冊數:	xiv, 362 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Discrete-time systemsMathematics.
電子資源:	https://doi.org/10.1007/978-3-031-10082-6
ISBN:	9783031100826$q(electronic bk.)

Numerical methods for solving discrete event systemswith applications to queueing systems /
Grassmann, Winfried K.

Numerical methods for solving discrete event systemswith applications to queueing systems /[electronic resource] :by Winfried Grassmann, Javad Tavakoli. - Cham :Springer International Publishing :2022. - xiv, 362 p. :ill., digital ;24 cm. - CMS/CAIMS books in mathematics,v. 52730-6518 ;. - CMS/CAIMS books in mathematics ;v. 3..

Basic Concepts and Definitions -- Systems with Events Generated by Poisson or by Binomial Processes -- Generating the Transition Matrix -- Systems with Events Created by Renewal Processes -- Systems with Events Created by Phase-type Processes -- Computational Complexity and Rounding and Truncation Errors -- Transient Solutions of Markov Chains -- Moving Toward the Statistical Equilibrium -- Equilibrium Solutions of Markov Chains and Related Topics -- Reducing the State Space Through Censoring and Embedding -- Systems with Independent or Almost Independent Components -- Infinite-State Markov Chains and Matrix Analytic Methods.

This graduate textbook provides an alternative to discrete event simulation. It describes how to formulate discrete event systems, how to convert them into Markov chains, and how to calculate their transient and equilibrium probabilities. The most appropriate methods for finding these probabilities are described in some detail, and templates for efficient algorithms are provided. These algorithms can be executed on any laptop, even in cases where the Markov chain has hundreds of thousands of states. This book features the probabilistic interpretation of Gaussian elimination, a concept that unifies many of the topics covered, such as embedded Markov chains and matrix analytic methods. The material provided should aid practitioners significantly to solve their problems. This book also provides an interesting approach to teaching courses of stochastic processes.

ISBN: 9783031100826$q(electronic bk.)

Standard No.: 10.1007/978-3-031-10082-6doiSubjects--Topical Terms:

939434
Discrete-time systems
--Mathematics.

LC Class. No.: QA402

Dewey Class. No.: 003.830151

Numerical methods for solving discrete event systemswith applications to queueing systems /
LDR:02604nmm a2200337 a 4500 001 633493
003 DE-He213
005 20221105005201.0
006 m d
007 cr nn 008maaau
008 230511s2022 sz s 0 eng d
020 $a 9783031100826$q(electronic bk.)
020 $a 9783031100819$q(paper)
024 7 $a 10.1007/978-3-031-10082-6 $2 doi
035 $a 978-3-031-10082-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402
072 7 $a PBKS $2 bicssc
072 7 $a MAT021000 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 003.830151 $2 23
090 $a QA402 $b .G769 2022
100 1 $a Grassmann, Winfried K. $3 199027
245 1 0 $a Numerical methods for solving discrete event systems $h [electronic resource] : $b with applications to queueing systems / $c by Winfried Grassmann, Javad Tavakoli.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xiv, 362 p. : $b ill., digital ; $c 24 cm.
490 1 $a CMS/CAIMS books in mathematics, $x 2730-6518 ; $v v. 5
505 0 $a Basic Concepts and Definitions -- Systems with Events Generated by Poisson or by Binomial Processes -- Generating the Transition Matrix -- Systems with Events Created by Renewal Processes -- Systems with Events Created by Phase-type Processes -- Computational Complexity and Rounding and Truncation Errors -- Transient Solutions of Markov Chains -- Moving Toward the Statistical Equilibrium -- Equilibrium Solutions of Markov Chains and Related Topics -- Reducing the State Space Through Censoring and Embedding -- Systems with Independent or Almost Independent Components -- Infinite-State Markov Chains and Matrix Analytic Methods.
520 $a This graduate textbook provides an alternative to discrete event simulation. It describes how to formulate discrete event systems, how to convert them into Markov chains, and how to calculate their transient and equilibrium probabilities. The most appropriate methods for finding these probabilities are described in some detail, and templates for efficient algorithms are provided. These algorithms can be executed on any laptop, even in cases where the Markov chain has hundreds of thousands of states. This book features the probabilistic interpretation of Gaussian elimination, a concept that unifies many of the topics covered, such as embedded Markov chains and matrix analytic methods. The material provided should aid practitioners significantly to solve their problems. This book also provides an interesting approach to teaching courses of stochastic processes.
650 0 $a Discrete-time systems $x Mathematics. $3 939434
700 1 $a Tavakoli, Javad. $3 939433
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a CMS/CAIMS books in mathematics ; $v v. 3. $3 933936
856 4 0 $u https://doi.org/10.1007/978-3-031-10082-6
950 $a Mathematics and Statistics (SpringerNature-11649)