{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T10:26:38Z","timestamp":1776767198836,"version":"3.51.2"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Algorithms"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1023\/a:1019206402431","type":"journal-article","created":{"date-parts":[[2003,2,20]],"date-time":"2003-02-20T00:09:50Z","timestamp":1045699790000},"page":"57-74","source":"Crossref","is-referenced-by-count":51,"title":["Improved cyclic reduction for solving queueing problems"],"prefix":"10.1007","volume":"15","author":[{"given":"Dario Andrea","family":"Bini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beatrice","family":"Meini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"330638_CR1","unstructured":"G. Anastasi, L. Lenzini and B. Meini, Performanceevaluation of a worst case model of the Metaring MAC Protocol with global fairness, Performance Evaluation, to appear."},{"key":"330638_CR2","doi-asserted-by":"crossref","unstructured":"D. Bini and B. Meini, On cyclicreduction 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\u201338.","DOI":"10.1007\/978-1-4615-2241-6_2"},{"key":"330638_CR3","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/S0895479895284804","volume":"17","author":"D. Bini","year":"1996","unstructured":"D. Bini and B. Meini, On the solution of anonlinear matrix equation arising in queueing problems, SIAM J. Matrix Anal. Appl. 17 (1996) 906\u2013926.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"330638_CR4","volume-title":"Fundamental Algorithms","author":"D. Bini","year":"1994","unstructured":"D. Bini and V. Pan, Matrix andPolynomial Computations, Vol. 1: Fundamental Algorithms (Birkh\u00e4user, Boston, 1994)."},{"key":"330638_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0885-064X(86)90001-4","volume":"6","author":"D. Bini","year":"1986","unstructured":"D. Bini and V. Pan,Polynomial division and its computational complexity, J. Complexity 6 (1986) 179\u2013203.","journal-title":"J. Complexity"},{"key":"330638_CR6","volume-title":"The Fast Fourier Transform","author":"E.O. Brighman","year":"1974","unstructured":"E.O. Brighman, The Fast Fourier Transform(Prentice-Hall, Englewood Cliffs, NJ, 1974)."},{"key":"330638_CR7","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/0707049","volume":"7","author":"B.L. Buzbee","year":"1970","unstructured":"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\u2013656.","journal-title":"SIAM J. Numer. Anal."},{"key":"330638_CR8","volume-title":"Introduction to Stochastic Processes","author":"E. \u00c7inlar","year":"1975","unstructured":"E. \u00c7inlar,Introduction to Stochastic Processes (Prentice-Hall, Englewood Cliffs, NJ, 1975)."},{"key":"330638_CR9","volume-title":"Fast Transform Algorithms,Analyses, Applications","author":"D.F. Elliott","year":"1982","unstructured":"D.F. Elliott and K.R. Rao, Fast Transform Algorithms,Analyses, Applications (Academic Press, New York, 1982)."},{"key":"330638_CR10","unstructured":"G. Latouche, Algorithms for evaluating the matrix G in Markov chains of PH\/G\/1 type, Bellcore technical report (1992)."},{"key":"330638_CR11","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1093\/imanum\/14.4.583","volume":"14","author":"G. Latouche","year":"1994","unstructured":"G. Latouche, Newton's iteration fornon-linear equations in Markov chains, IMA J. Numer. Anal. 14 (1994) 583\u2013598.","journal-title":"IMA J. Numer. Anal."},{"key":"330638_CR12","doi-asserted-by":"publisher","first-page":"650","DOI":"10.2307\/3214773","volume":"30","author":"G. Latouche","year":"1993","unstructured":"G. Latouche and V. Ramaswami, A logarithmic reductionalgorithm for quasi-birth-death processes, J. Appl. Probab. 30 (1993) 650\u2013674.","journal-title":"J. Appl. Probab."},{"key":"330638_CR13","doi-asserted-by":"crossref","unstructured":"G. Latouche and G.W. Stewart, Numerical methods forM\/G\/1 type queues, in: Computations with Markov Chains, ed. W.J. Stewart (Kluwer Academic, 1996) pp. 571\u2013581.","DOI":"10.1007\/978-1-4615-2241-6_30"},{"key":"330638_CR14","doi-asserted-by":"crossref","unstructured":"B. Meini, An improvedFFT-based version of the Ramaswami formula, Comm. Statist. Stochastic Models 13 (1997), to appear.","DOI":"10.1080\/15326349708807423"},{"key":"330638_CR15","unstructured":"B. Meini, New convergence results onfunctional iteration techniques for the numerical solution of M\/G\/1 type Markov chains, Numer. Math., to appear."},{"key":"330638_CR16","volume-title":"Structured Stochastic Matrices ofM\/G\/1 Type and Their Applications","author":"M.F. Neuts","year":"1989","unstructured":"M.F. Neuts, Structured Stochastic Matrices ofM\/G\/1 Type and Their Applications (Dekker, New York, 1989)."},{"key":"330638_CR17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1080\/15326348808807077","volume":"4","author":"V. Ramaswami","year":"1988","unstructured":"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\u2013188.","journal-title":"Comm. Statist. Stochastic Models"},{"key":"330638_CR18","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/1030046","volume":"30","author":"V. Ramaswami","year":"1988","unstructured":"V. Ramaswami, Nonlinear matrix equations in applied probability\u2014 Solution techniques and open problems, SIAM Review 30 (1988) 256\u2013263.","journal-title":"SIAM Review"},{"key":"330638_CR19","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1109\/TASSP.1986.1164804","volume":"34","author":"M. Sorensen","year":"1986","unstructured":"M. Sorensen, M. Heideman and C. Burrus,On computing the split-radix FFT, IEEE Trans. Acoust. Signal Processing 34 (1986) 152\u2013156.","journal-title":"IEEE Trans. Acoust. Signal Processing"},{"key":"330638_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/nla.1680020309","volume":"2","author":"G.W. Stewart","year":"1995","unstructured":"G.W. Stewart, On the solution of blockHessenberg systems, Numer. Linear Algebra Appl. 2 (1995) 287\u2013296.","journal-title":"Numer. Linear Algebra Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019206402431.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019206402431\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019206402431.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T06:38:26Z","timestamp":1751870306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019206402431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["330638"],"URL":"https:\/\/doi.org\/10.1023\/a:1019206402431","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}