On the convergence of the power series algorithm

Performance Evaluation

Volumn 42, Issue 1, 2000, Pages 21-39

  Hooghiemstra, Gerard ^a,c   Koole, Ger ^b,d,e  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^d CWI   (Netherlands)

^e INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBABILITY;

COATES GRAPH; POWER SERIES ALGORITHM;

MARKOV PROCESSES;

EID: 0034259413     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-5316(99)00081-4     Document Type: Article

References (13)

1. I.J.B.F. Adan, G. Hooghiemstra, The M/M/c queue with critical jobs, Math. Oper. Res. 47 (3) (1998) 341-353.
2. H. Bavinck, G. Hooghiemstra, E. de Waard, An application of Gegenbauer polynomials in queueing theory, J. Comput. Appl. Math. 49 (1993) 1-10.
3. P. Billingsley, Convergence of Probability Measures, Wiley, New York, 1968.
4. J.P.C. Blanc, Performance analysis and optimization with the power-series algorithm, in: L. Donatiello, R. Nelson (Eds.), Performance Evaluation of Computers and Communication Systems, Springer, Berlin, 1993, pp. 53-80.
5. J.P.C. Blanc, A numerical study of a coupled processor model, in: G. Iazeolla, P.J. Courtois, O.J. Boxma (Eds.), Computer Performance and Reliability, North-Holland, Amsterdam, 1998, pp. 289-303.
6. W.-K. Chen, Applied Graph Theory, North-Holland, Amsterdam, 1971.
7. J.W. Cohen, The Single Server Queue, North-Holland, Amsterdam, 1982.
8. M.I. Freidlin, A.D. Wentzell, Random Peturbations of Dynamical Systems, Springer, New York, 1984.
9. G. Hooghiemstra, M.S. Keane, S. van der Ree, Power series for stationary distributions of coupled processor models, SIAM J. Appl. Math. 48 (1988) 1159-1166.
10. W.B. van den Hout, The power series algorithm, a numerical approach to Markov processes, Ph.D. Thesis, Tilburg University, 1996.
11. G.J. van Houtum, W.H.M. Zijm, I.J.B.F. Adan, J. Wessels, Bounds for performance characteristics: a systematic approach via cost structures, Stochast. Models 14 (1998) 205-224.
12. G.M. Koole, On the use of the power series algorithm for general Markov processes, with an application to a Petri net, INFORMS J. Comput. 9 (1997) 51-56.
13. P. Wynn, On the convergence and stability of the epsilon algorithm, SIAM J. Num. Anal. 3 (1996) 91-122.