Advanced Search

This article presents a simple method for bounding a solution of a system of linear equations $Ax=b$ with an M-matrix and positive right-hand side [1]. Given a suitable approximation to an exact solution, the bounds are constructed by one step in a basic iterative method.

Sensitivity analysis of irreducible Markov chains considers an original Markov chain with transition probability matrix $P$ and modified Markov chain with transition probability matrix $P$. For their respective stationary probability vectors $\pi ,\tilde{\pi }$, some of the following charactristics are usually studied: $\parallel \pi -\tilde{\pi }{\parallel }_p$ for asymptotical stability [3], $|{\pi }_i-{\tilde{\pi }}_i|,\frac{|{\pi }_i-{\tilde{\pi }}_i|}{{\pi }_i}$ for componentwise stability or sensitivity [1]. For functional transition probabilities, $P=P\left(t\right)$ and stationary probability vector $\pi \left(t\right)$, derivatives are also used for studying...