Solving nonlinear matrix equations arising in tree-like stochastic processes.
DOI10.1016/S0024-3795(02)00593-1zbMATH Open1044.65034MaRDI QIDQ1874657FDOQ1874657
Authors: Dario A. Bini, Guy Latouche, B. Meini 
Publication date: 25 May 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
- On the numerical solution of a nonlinear matrix equation in Markov chains
- Nonlinear matrix equations and structured linear algebra
- Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
- Newton's iteration for non-linear equations in Markov chains
- Equilibrium analysis of skip free markov chains: nonlinear matrix equations
algorithmsfixed point iterationNewton's iterationmatrix equationcyclic reductiondiscrete-time bivariate Markov processestree-like stochastic processes
Discrete-time Markov processes on general state spaces (60J05) Matrix equations and identities (15A24)
Cites Work
- Improved cyclic reduction for solving queueing problems
- Title not available (Why is that?)
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Title not available (Why is that?)
- On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
- Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
- Title not available (Why is that?)
- A logarithmic reduction algorithm for quasi-birth-death processes
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- The \(MMAP[K]/PH[K]/1\) queues with a last-come-first-served preemptive service discipline
- A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
- Newton's iteration for non-linear equations in Markov chains
- New convergence results on functional iteration techniques for the numerical solution of M/G/1 type Markov chains
- The quasi-birth-death type markov chain with a tree structure
- Matrix product-form solutions for Markov chains with a tree structure
- Title not available (Why is that?)
- STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN
Cited In (20)
- Nonlinear matrix equations and structured linear algebra
- Fitting correlated arrival and service times and related queueing performance
- Quadratic vector equations
- Analyzing priority queues with 3 classes using tree-like processes
- Solving nonlinear matrix equation in credit risk by using iterative methods
- Convergence analysis of some iterative methods for a nonlinear matrix equation
- Richardson method and totally nonnegative linear systems
- The \(M/G/1\)-type Markov chain with restricted transitions and its application to queues with batch arrivals
- On the Hermitian positive definite solution of the nonlinear matrix equation
- On preemptive-repeat LIFO queues
- On the link between Markovian trees and tree-structured Markov chains
- A polynomial time algorithm for computing extinction probabilities of multitype branching processes
- Matrix structures in queuing models
- Throughput and delay analysis of an opportunistic tree algorithm
- Solving two generalized nonlinear matrix equations
- Some iterative methods for the largest positive definite solution to a class of nonlinear matrix equation
- On the Hermitian positive defnite solution of the nonlinear matrix equation \(X + A^*X ^{-1} A + B^*X ^{-1} B = I\)
- QBD Markov chains on binomial-like trees and its application to multilevel feedback queues
- Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
- Tree Structured QBD Markov Chains and Tree‐Like QBD Processes
Uses Software
This page was built for publication: Solving nonlinear matrix equations arising in tree-like stochastic processes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874657)
