Solving certain queueing problems modelled by Toeplitz matrices

DOI10.1007/BF02575885zbMath0813.60094OpenAlexW2024421349MaRDI QIDQ1346993

Dario Andrea Bini, Beatrice Meini

Publication date: 28 May 1995

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02575885

zbMATH Keywords

Markov chainsstochastic matricesqueueing problemsstochastic semi- infinite Toeplitz-like matricestriangular Toeplitz system

Mathematics Subject Classification ID

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

Related Items

Every matrix is a product of Toeplitz matrices, A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain, Relaxed functional iteration techniques for the numerical solution of \(M/G/1\) type Markov chains, A Note on Bounds and Error Bounds for Nonexponential Batch Arrival Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
• Polynomial division and its computational complexity
• The Durand-Kerner method for trigonometric and exponential polynomials
• Computing the stationary distribution for infinite Markov chains
• Improved parallel computations with Toeplitz-like and Hankel-like matrices
• The Inverses of Block Hankel and Block Toeplitz Matrices
• Fast algorithms for rational Hermite approximation and solution of Toeplitz systems
• Matrix Methods for Queuing Problems
• Stability of Methods for Solving Toeplitz Systems of Equations
• Superfast Solution of Real Positive Definite Toeplitz Systems
• Markov chains with quasitoeplitz transition matrix
• Queues Solvable without Rouché's Theorem
• A Variant of the Gohberg–Semencul Formula Involving Circulant Matrices
• On the Stability of Transform-Based Circular Deconvolution
• Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• A modified Newton method for polynomials
• Approximating the stationary distribution of an infinite stochastic matrix