Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
From MaRDI portal
Publication:3783425
DOI10.1137/1030046zbMath0642.65033WikidataQ111593343 ScholiaQ111593343MaRDI QIDQ3783425
Publication date: 1988
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1030046
queueing; inventory; minimal nonnegative solutions; stochastic models; applied probability; nonlinear matrix equations; communications; error analyses; dam theories
65H10: Numerical computation of solutions to systems of equations
60K25: Queueing theory (aspects of probability theory)
65C99: Probabilistic methods, stochastic differential equations
Related Items
AMAP/G/1 Queue with an Underlying Birth–Death Process, ON LATOUCHE–RAMASWAMI'S LOGARITHMIC REDUCTION ALGORITHM FOR QUASI-BIRTH-AND-DEATH PROCESSES, Queues with Correlated Service and Inter-Arrival Times and Their Application to Optical Buffers, Solving matrix polynomial equations arising in queueing problems, A matrix-geometric solution of the jockeying problem, A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain, Ladder heights and the Markov-modulated M/G/1 queue, An integrated production and inventory model to dampen upstream demand variability in the supply chain, From the matrix-geometric to the matrix-exponential, The waiting-time distribution and its moments of the PH/PH/1 queue, Exploiting the Toeplitz structure in certain queueing problems, Computational methods in risk theory: a matrix-algorithmic approach, Relaxed functional iteration techniques for the numerical solution of \(M/G/1\) type Markov chains, On the numerical solution of a nonlinear matrix equation in Markov chains, A class of iteration methods based on the Moser formula for nonlinear equations in Markov chains, A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations
