IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4615-2241-6_2.html
   My bibliography  Save this book chapter

On Cyclic Reduction Applied to a Class of Toeplitz-Like Matrices Arising in Queueing Problems

In: Computations with Markov Chains

Author

Listed:
  • Dario Bini

    (Università di Pisa, Dipartimento di Matematica)

  • Beatrice Meini

    (Università di Pisa, Dipartimento di Matematica)

Abstract

We observe that the cyclic reduction algorithm leaves unchanged the structure of a block Toeplitz matrix in block Hessenberg form. Based on this fact, we devise a fast algorithm for computing the probability invariant vector of stochastic matrices of a wide class of Toeplitz-like matrices arising in queueing problems. We prove that for any block Toeplitz matrix H in block Hessenberg form it is possible to carry out the cyclic reduction algorithm with O(k 3 n + k 2 n log n) arithmetic operations, where k is the size of the blocks and n is the number of blocks in each row and column of H. The probability invariant vector is computed within the same cost. This substantially improves the O(k 3 n 2) arithmetic cost of the known methods based on Gaussian elimination. The algorithm, based on the FFT, is numerically weakly stable. In the case of semi-infinite matrices the cyclic reduction algorithm is rephrased in functional form by means of the concept of generating function and a convergence result is proved.

Suggested Citation

  • Dario Bini & Beatrice Meini, 1995. "On Cyclic Reduction Applied to a Class of Toeplitz-Like Matrices Arising in Queueing Problems," Springer Books, in: William J. Stewart (ed.), Computations with Markov Chains, chapter 2, pages 21-38, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4615-2241-6_2
    DOI: 10.1007/978-1-4615-2241-6_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4615-2241-6_2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.