Abstract
In Markov chain theory, stochastic matrices are used to describe inter-state transitions. Powers of such transition matrices are computed to determine the behaviour within a Markov system. For this, diagonalizable matrices are preferred because of their useful properties. The non-diagonalizable matrices are therefore undesirable. The aim is to determine a nearby diagonalizable matrix A, starting from a non-diagonalizable matrix (A) over tilde. Previous studies tackled this problem, limited to 3 x 3 stochastic matrices. In this paper, these results are generalized for n x n stochastic matrices. Spectral properties of A are preserved in this process, such that A and (A) over tilde have coinciding semisimple eigenvalues and coinciding corresponding eigenvectors. This problem is examined and solved in this study and an algorithm is presented to find such a diagonalizable matrix (A) over tilde.
Original language | English |
---|---|
Pages (from-to) | 5115-5145 |
Number of pages | 31 |
Journal | Linear & Multilinear Algebra |
Volume | 70 |
Issue number | 20 |
DOIs | |
Publication status | Published - Oct 2022 |
Keywords
- Stochastic matrices
- non-diagonalizable matrices
- perturbation theory
- Markov chains
- EIGENVALUES