An improved FFT-based version of Ramaswami's formula

DOI10.1080/15326349708807423zbMath0880.60092OpenAlexW1970488669WikidataQ56778638 ScholiaQ56778638MaRDI QIDQ4340650

Beatrice Meini

Publication date: 7 January 1998

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349708807423

zbMATH Keywords

fast Fourier transformToeplitz matricesinvariant vector of a stochastic matrixRamaswami's formula

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (8)

THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS ⋮ Computations with infinite Toeplitz matrices and polynomials ⋮ Neumann exterior wave propagation problems: computational aspects of 3D energetic Galerkin BEM ⋮ A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain ⋮ Exploiting the Toeplitz structure in certain queueing problems ⋮ Non-skip-free M/G/1-type Markov chains and Laurent matrix power series ⋮ AMAP/G/1 Queue with an Underlying Birth–Death Process ⋮ Markov Chains with Hybrid Repeating Rows - Upper-Hessenberg, Quasi-Toeplitz Structure of the Block Transition Probability Matrix

This page was built for publication: An improved FFT-based version of Ramaswami's formula