Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
From MaRDI portal
Recommendations
- Numerical Experiments with Iteration and Aggregation for Markov Chains
- Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
- scientific article; zbMATH DE number 663840
- An aggregation/disaggregation algorithm for computing the stationary distribution of a large markov chain
- Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
Cites work
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3770853 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 3493681 (Why is no real title available?)
- scientific article; zbMATH DE number 3574935 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3349178 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- scientific article; zbMATH DE number 3393631 (Why is no real title available?)
- scientific article; zbMATH DE number 3413714 (Why is no real title available?)
- A Combined Direct-Iterative Method for Certain M-Matrix Linear Systems
- A Queueing Model with Finite Waiting Room and Blocking
- A Simultaneous Iteration Algorithm for Real Matrices
- A comparison of numerical techniques in Markov modeling
- Aggregation of Variables in Dynamic Systems
- Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions
- Approximate Analysis of General Queuing Networks
- Approximation of eigencharacteristics in nearly-completely decomposable stochastic systems
- Comparison of Some Direct Methods for Computing Stationary Distributions of Markov Chains
- Error Analysis in Nearly-Completely Decomposable Stochastic Systems
- Finite Capacity Queuing Systems with Applications in Computer Modeling
- Methods of aggregation
- On Approximate Computer System Models
- Random Injection Control of Multiprogramming in Virtual Memory
- Solution of Homogeneous Systems of Linear Equations Arising from Compartmental Models
- The Mathematical Basis of the Interpretation of Tracer Experiments in Closed Steady-State Systems
Cited in
(32)- Two queues with weighted one-way overflow
- On the stability of the computation of the stationary probabilities of Markov chains using Perron complements
- Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
- Reduction of calcium release site models via fast/slow analysis and iterative aggregation/disaggregation
- The computation of stationary distributions of Markov chains through perturbations
- Iterative and Semi-Iterative Methods for Computing Stationary Probability Vectors of Markov Operators
- scientific article; zbMATH DE number 663840 (Why is no real title available?)
- Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
- Comparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitas
- Convergent Iterations for Computing Stationary Distributions of Markov Chains
- Models of perishable queueing-inventory systems with server vacations
- Finding the stationary states of Markov chains by iterative methods
- scientific article; zbMATH DE number 510831 (Why is no real title available?)
- Aggregation Methods for Computing Steady States in Statistical Physics
- An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Analysis
- scientific article; zbMATH DE number 1424145 (Why is no real title available?)
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques
- Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
- Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
- Perturbation results for nearly uncoupled Markov chains with applications to iterative methods
- Geometric bounds on iterative approximations for nearly completely decomposable Markov chains
- Numerical Experiments with Iteration and Aggregation for Markov Chains
- Aggregation/disaggregation iterative methods applied to Leontev systems and Markov chains.
- An iterative aggregation/disaggregation procedure for modelling the long-term behaviour of continuous-time evanescent random processes
- Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains
- Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method
- Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains. II: Fast convergence
- On a Rayleigh-Ritz refinement technique for nearly uncoupled stochastic matrices
- Fast multilevel methods for Markov chains.
- Iterative algorithms for large stochastic matrices
- Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices
- Block iterative algorithms for stochastic matrices
This page was built for publication: Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742447)
