Solving certain queueing problems modelled by Toeplitz matrices

DOI10.1007/BF02575885zbMATH Open0813.60094OpenAlexW2024421349MaRDI QIDQ1346993FDOQ1346993

Authors: Dario A. Bini, B. 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

Recommendations

• Exploiting the Toeplitz structure in certain queueing problems
• scientific article; zbMATH DE number 956796
• Toeplitz-Circulant Preconditioners for Toeplitz Systems and their Applications to Queueing Networks with Batch Arrivals
• Solving m/g/l type markov chains: recent advances and applications
• Inverting block Toeplitz matrices in block Hessenberg form by means of displacement operators: Application to queueing problems

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
• Relaxed functional iteration techniques for the numerical solution of \(M/G/1\) type Markov chains
• Solving matrix polynomial equations arising in queueing problems
• The generalized Toeplitz determinants for a class of holomorphic mappings in several complex variables
• Every matrix is a product of Toeplitz matrices
• A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain
• Exploiting the Toeplitz structure in certain queueing problems
• A queueing model and a set of orthogonal polynomials
• A Note on Bounds and Error Bounds for Nonexponential Batch Arrival Systems

This page was built for publication: Solving certain queueing problems modelled by Toeplitz matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346993)