Improved cyclic reduction for solving queueing problems

Numerical Algorithms

Volumn 15, Issue 1, 1997, Pages 57-74

  Bini, Dario Andrea ^a   Meini, Beatrice ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Cyclic reduction; FFT; M G 1 type matrices; Queueing problems; Toeplitz matrices

Indexed keywords

EID: 21744455100     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019206402431     Document Type: Article

References (20)

1. G. Anastasi, L. Lenzini and B. Meini, Performance evaluation of a worst case model of the Metaring MAC Protocol with global fairness, Performance Evaluation, to appear.
2. D. Bini and B. Meini, On cyclic reduction applied to a class of Toeplitz-like matrices arising in queueing problems, in: Computations with Markov Chains, ed. W.J. Stewart (Kluwer Academic, 1996) pp. 21-38.
3. D. Bini and B. Meini, On the solution of a nonlinear matrix equation arising in queueing problems, SIAM J. Matrix Anal. Appl. 17 (1996) 906-926.
4. D. Bini and V. Pan, Matrix and Polynomial Computations, Vol. 1: Fundamental Algorithms (Birkhäuser, Boston, 1994).
5. D. Bini and V. Pan, Polynomial division and its computational complexity, J. Complexity 6 (1986) 179-203.
6. E.O. Brighman, The Fast Fourier Transform (Prentice-Hall, Englewood Cliffs, NJ, 1974).
7. B.L. Buzbee, G.H. Golub and C.W. Nielson, On direct methods for solving Poisson's equation, SIAM J. Numer. Anal. 7 (1970) 627-656.
8. E. Çinlar, Introduction to Stochastic Processes (Prentice-Hall, Englewood Cliffs, NJ, 1975).
9. D.F. Elliott and K.R. Rao, Fast Transform Algorithms, Analyses, Applications (Academic Press, New York, 1982).
10. G. Latouche, Algorithms for evaluating the matrix G in Markov chains of PH/G/1 type, Bellcore technical report (1992).
11. G. Latouche, Newton's iteration for non-linear equations in Markov chains, IMA J. Numer. Anal. 14 (1994) 583-598.
12. G. Latouche and V. Ramaswami, A logarithmic reduction algorithm for quasi-birth-death processes, J. Appl. Probab. 30 (1993) 650-674.
13. G. Latouche and G.W. Stewart, Numerical methods for M/G/1 type queues, in: Computations with Markov Chains, ed. W.J. Stewart (Kluwer Academic, 1996) pp. 571-581.
14. B. Meini, An improved FFT-based version of the Ramaswami formula, Comm. Statist. Stochastic Models 13 (1997), to appear.
15. B. Meini, New convergence results on functional iteration techniques for the numerical solution of M/G/1 type Markov chains, Numer. Math., to appear.
16. M.F. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Applications (Dekker, New York, 1989).
17. V. Ramaswami, A stable recursion for the steady state vector in Markov chains of M/G/1 type, Comm. Statist. Stochastic Models 4 (1988) 183-188.
18. V. Ramaswami, Nonlinear matrix equations in applied probability - Solution techniques and open problems, SIAM Review 30 (1988) 256-263.
19. M. Sorensen, M. Heideman and C. Burrus, On computing the split-radix FFT, IEEE Trans. Acoust. Signal Processing 34 (1986) 152-156.
20. G.W. Stewart, On the solution of block Hessenberg systems, Numer. Linear Algebra Appl. 2 (1995) 287-296.