Relaxations for the numerical solutions of some stochastic problems
From MaRDI portal
Recommendations
- On the convergence of jacobi and gauss-seidel iteration for steady-state probabilities of finite-state continuous-time markov chains
- Numerical Methods in Markov Chain Modeling
- The successive over relaxation method (SOR) and Markov chains
- scientific article; zbMATH DE number 440644
- Quicker Convergence for Iterative Numerical Solutions to Stochastic Problems: Probabilistic Interpretations, Ordering Heuristics, and Parallel Processing
Cited in
(8)- Block cyclic SOR for Markov chains with p-cyclic infinitesimal generator
- Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
- Iterative solution methods for obtaining the steady-state probability distributions of Markovian multi-echelon repairable item inventory systems
- On the optimal design of tandem queueing systems with finite buffers
- The effect of machine breakdowns and interstage storage on the performance of production line systems
- Quicker Convergence for Iterative Numerical Solutions to Stochastic Problems: Probabilistic Interpretations, Ordering Heuristics, and Parallel Processing
- State Space Orderings for Gauss--Seidel in Markov Chains Revisited
- On the convergence of jacobi and gauss-seidel iteration for steady-state probabilities of finite-state continuous-time markov chains
This page was built for publication: Relaxations for the numerical solutions of some stochastic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3814757)
