Permuting Markov chains to nearly completely decomposable form. Technical Re- port BU-CEIS-9808, Department of Computer Engineering and Information
- Tugrul Dayar
Experiments are performed which demonstrate that parallel implementations of block stationary iterative methods can solve singular systems of linear equations in substantially less time that the sequential counterparts. Furthermore, these experiments illustrate the behavior of diierent partitions of matrices representing Markov chains, when parallel iterative methods are used for their solution. Several versions of block iterative methods are tested.