Pages that link to "Item:Q4828880"
From MaRDI portal
The following pages link to A divide and conquer approach to computing the mean first passage matrix for Markov chains via Perron complement reductions (Q4828880):
Displaying 7 items.
- An iterative algorithm for computing mean first passage times of Markov chains (Q902846) (← links)
- Improved bounds for a condition number for Markov chains (Q1434425) (← links)
- Localization of Perron roots (Q1887498) (← links)
- Properties for the Perron complement of three known subclasses of \(H\)-matrices (Q2260607) (← links)
- Development of computational algorithm for multiserver queue with renewal input and synchronous vacation (Q2290004) (← links)
- Stationary distributions and mean first passage times of perturbed Markov chains (Q2575710) (← links)
- Robust power series algorithm for epistemic uncertainty propagation in Markov chain models (Q5106728) (← links)
