Exploiting the Toeplitz structure in certain queueing problems
type: Item
instance of: scholarly article
title: Exploiting the Toeplitz structure in certain queueing problems
zbMATH Open document ID: 0904.65148
DOI: 10.1007/BF02576006
author: B. Meini
author: Dario A. Bini
published in: Calcolo
publication date: 1998-08-10T00:00:00Z
Mathematics Subject Classification ID: 65C99
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 1186676
zbMATH Keywords: Markov chains
zbMATH Keywords: Toeplitz matrices
zbMATH Keywords: queueing theory
zbMATH Keywords: displacement rank
zbMATH Keywords: Schur complement
zbMATH Keywords: fast Fourier transform
zbMATH Keywords: fast polynomial computations
zbMATH Keywords: algorithms
describes a project that uses: na12
MaRDI profile type: Publication
cites work: A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service
cites work: Spectral and computational properties of band symmetric Toeplitz matrices
cites work: Q5687202
cites work: On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
cites work: Improved cyclic reduction for solving queueing problems
cites work: Inverting block Toeplitz matrices in block Hessenberg form by means of displacement operators: Application to queueing problems
cites work: Improved parallel computations with Toeplitz-like and Hankel-like matrices
cites work: On Direct Methods for Solving Poisson’s Equations
cites work: Q3976668
cites work: LU decomposition of M-matrices by elimination without pivoting
cites work: A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems
cites work: Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains
cites work: Q3359644
cites work: Regenerative Analysis and Steady State Distributions for Markov Chains
cites work: Experimental results on matrix-analytical solution techniques–extensions and comparisons
cites work: Displacement ranks of a matrix
cites work: Displacement Structure: Theory and Applications
cites work: On a two-level multigrid solution method for finite Markov chains
cites work: Q4281306
cites work: Newton's iteration for non-linear equations in Markov chains
cites work: A logarithmic reduction algorithm for quasi-birth-death processes
cites work: Q5687232
cites work: Computer Performance Evaluation. Modelling Techniques and Tools
cites work: Some steady-state distributions for theMAP /SM /1 queue
cites work: An improved FFT-based version of Ramaswami's formula
cites work: New convergence results on functional iteration techniques for the numerical solution of M/G/1 type Markov chains
cites work: Q3923308
cites work: Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
cites work: A stable recursion for the steady state vector in markov chains of m/g/1 type
cites work: On the solution of block Hessenberg systems
full work available at URL: https://doi.org/10.1007/bf02576006
OpenAlex ID: W2095054526
Recommended article: Solving certain queueing problems modelled by Toeplitz matrices
Recommended article: An Approach to a Class of Queuing Problems
Recommended article: Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory
Recommended article: Q5687202
Recommended article: A queueing model and a set of orthogonal polynomials
Recommended article: Q4343713
Recommended article: Q5808656
Recommended article: Q4246892
Recommended article: An application of Gegenbauer polynomials in queueing theory
description: scientific article; zbMATH DE number 1186676