Solving matrix polynomial equations arising in queueing problems

DOI10.1016/S0024-3795(01)00426-8zbMath0994.65047MaRDI QIDQ5956252

Beatrice Meini, Guy Latouche, Dario Andrea Bini

Publication date: 10 October 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmsqueueingconvergenceMarkov chainsnumerical experimentsinvariant subspacesmatrix equationscyclic reductionChebyshev iterationGraeffe's iterationMöbius mapping

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Matrix equations and identities (15A24)

Related Items

Perron-Frobenius theorems for the numerical range of semi-monic matrix polynomials, PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS, An iterative method to compute the dominant zero of a quaternionic unilateral polynomial, Condition numbers and backward error of a matrix polynomial equation arising in stochastic models, Newton-Shamanskii Method for a Quadratic Matrix Equation Arising in Quasi-Birth-Death Problems, A primer of Perron--Frobenius theory for matrix polynomials, The morphing of fluid queues into Markov-modulated Brownian motion, Accuracy versus efficiency of hyper-exponential approximations of the response time distribution ofMMPP/M/1 queues, Risk processes analyzed as fluid queues, The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub, An explicit polynomial to globalize algorithms for solving matrix polynomial equations, Steady-State and Transient Analysis of a Single Channel Cognitive Radio Model with Impatience and Balking

Uses Software

• na12

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic complexity of computing polynomial zeros
• Sequential and parallel complexity of approximate evaluation of polynomial zeros
• Computations with infinite Toeplitz matrices and polynomials
• Improved cyclic reduction for solving queueing problems
• New convergence results on functional iteration techniques for the numerical solution of M/G/1 type Markov chains
• Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors
• Recherches sur la méthode de Graeffe et les zéros des polynômes et des séries de Laurent
• Regenerative Analysis and Steady State Distributions for Markov Chains
• Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
• A stable recursion for the steady state vector in markov chains of m/g/1 type
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• On functional iteration methods for solving nonlinear matrix equations arising in queueing problems
• A logarithmic reduction algorithm for quasi-birth-death processes
• Newton's iteration for non-linear equations in Markov chains
• An invariant subspace approach in m/g/l and g/m/l type markov chains
• Using the Matrix Sign Function to Compute Invariant Subspaces
• Numerical analysis of a quadratic matrix equation
• On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
• The matrix sign function
• Spectral analysis of M/G/1 and G/M/1 type Markov chains