Matrix Methods for Queuing Problems
From MaRDI portal
Publication:3343392
Recommendations
- Algorithms for finding steady state probabilities for some special classes of finite state Markov chains
- scientific article; zbMATH DE number 1424147
- An algorithmic approach for a special class of Markov chains
- Solving certain queueing problems by means of regular splittings
- A method for obtaining the unsteady state probabilities in Markovian queueing networks
Cited in
(43)- The use of eigenvalues for finding equilibrium probabilities of certain Markovian two-dimensional queueing problems
- Two queues with weighted one-way overflow
- On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
- Finite precision behavior of stationary iteration for solving singular systems
- Multigrid methods combined with low-rank approximation for tensor-structured Markov chains
- Theorems on M-splittings of a singular M-Matrix which depend on graph structure
- Multipreconditioned GMRES for simulating stochastic automata networks
- Conjugate gradient method approach to queue theory
- THE ARITHMETIC MEAN METHOD FOR FINDING THE STATIONARY VECTOR OF MARKOV CHAINS
- Quasi-orthogonalization for alternating non-negative tensor factorization
- Iterative methods for overflow queueing models. I
- Iterative methods for overflow queuing models. II
- Convergent Iterations for Computing Stationary Distributions of Markov Chains
- Multigrid algorithm from cyclic reduction for Markovian queueing networks
- Applications of matrix-geometric solutions for queueing performance evaluation of a hybrid switching system
- Numerical investigation of a multiserver retrial model
- Multigrid methods for tensor structured Markov chains with low rank approximation
- Solving matrix polynomial equations arising in queueing problems
- On the Smallest Positive Singular Value of a Singular M-Matrix with Applications to Ergodic Markov Chains
- scientific article; zbMATH DE number 3947971 (Why is no real title available?)
- Updating $LU$ Factorizations for Computing Stationary Distributions
- Scientific applications of iterative Toeplitz solvers
- Triangular and skew-symmetric splitting method for numerical solutions of Markov chains
- The conjugate gradient method for queueing networks
- A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems
- Using program package NSPCG to analyze the trunk reservation service protection method
- A class of hierarchical queueing networks and their analysis
- Iterative solution methods for obtaining the steady-state probability distributions of Markovian multi-echelon repairable item inventory systems
- Solving certain queueing problems modelled by Toeplitz matrices
- Weak-convergence theory of quasi-nonnegative splittings for singular matrices.
- Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains
- On the design of a finite-capacity queue with phase-type service times and hysteretic control
- Comparison theorems for the convergence factor of iterative methods for singular matrices
- Boundary value methods for solving transient solutions of Markovian queueing networks
- Sensitivity of the stationary distribution vector for an ergodic Markov chain
- Block cutpoint decomposition for markovian queueing systems
- Using the QR Factorization and Group Inversion to Compute, Differentiate, and Estimate the Sensitivity of Stationary Probabilities for Markov Chains
- Iterative algorithms for large stochastic matrices
- Analytical perturbations in Markov chains
- Model of joint servicing of real-time service traffic and data traffic. I
- Block iterative algorithms for stochastic matrices
- Algebraic multigrid method for queueing networks
- The linear algebra of block quasi-Newton algorithms
This page was built for publication: Matrix Methods for Queuing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343392)
