Solving certain queueing problems modelled by Toeplitz matrices
From MaRDI portal
Publication:1346993
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
Cites work
- A modified Newton method for polynomials
- A Variant of the Gohberg–Semencul Formula Involving Circulant Matrices
- Approximating the stationary distribution of an infinite stochastic matrix
- Computing the stationary distribution for infinite Markov chains
- Fast algorithms for rational Hermite approximation and solution of Toeplitz systems
- scientific article; zbMATH DE number 4051496 (Why is no real title available?)
- scientific article; zbMATH DE number 3775748 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- scientific article; zbMATH DE number 3795285 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3248210 (Why is no real title available?)
- scientific article; zbMATH DE number 4186996 (Why is no real title available?)
- Improved parallel computations with Toeplitz-like and Hankel-like matrices
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Markov chains with quasitoeplitz transition matrix
- Matrix Methods for Queuing Problems
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
- On the Stability of Transform-Based Circular Deconvolution
- Polynomial division and its computational complexity
- Queues Solvable without Rouché's Theorem
- Stability of Methods for Solving Toeplitz Systems of Equations
- Superfast Solution of Real Positive Definite Toeplitz Systems
- The Durand-Kerner method for trigonometric and exponential polynomials
- The Inverses of Block Hankel and Block Toeplitz Matrices
Cited in
(12)- A queueing model and a set of orthogonal polynomials
- Exploiting the Toeplitz structure in certain queueing problems
- Relaxed functional iteration techniques for the numerical solution of \(M/G/1\) type Markov chains
- Every matrix is a product of Toeplitz matrices
- On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
- A Note on Bounds and Error Bounds for Nonexponential Batch Arrival Systems
- scientific article; zbMATH DE number 956796 (Why is no real title available?)
- Solving matrix polynomial equations arising in queueing problems
- A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain
- The generalized Toeplitz determinants for a class of holomorphic mappings in several complex variables
- Some refinements of the Fekete and Szegö inequalities and Toeplitz determinants in one and higher dimensions
- Coefficient inequalities for holomorphic mappings with lacunary series on bounded starlike circular domains in \(\mathbb{C}^n\)
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)
