Exact algorithms for singular tridiagonal systems with applications to Markov chains

Lin Zhang Lu*, Wai Ki Ching, Michael K. Ng

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

4 Citations (Scopus)

Abstract

In this paper, we propose two exact algorithms to solve the steady state probability distributions of irreducible Markov chains whose generator matrices have tridiagonal structure. The first exact algorithm is based on divide-and-conquer procedure and the second one is a parallel algorithm. Examples on random walks and queuing networks are given to demonstrate the usefulness of the algorithms.

Original languageEnglish
Pages (from-to)275-289
Number of pages15
JournalApplied Mathematics and Computation
Volume159
Issue number1
DOIs
Publication statusPublished - 25 Nov 2004

Scopus Subject Areas

  • Computational Mathematics
  • Applied Mathematics

User-Defined Keywords

  • Divide-and-conquer procedure
  • Irreducible tridiagonal matrix
  • M-matrices

Fingerprint

Dive into the research topics of 'Exact algorithms for singular tridiagonal systems with applications to Markov chains'. Together they form a unique fingerprint.

Cite this