Inversion and spectral analysis of matrices arising in the analysis of Markov processes.
Saved in:
| Title: | Inversion and spectral analysis of matrices arising in the analysis of Markov processes. |
|---|---|
| Authors: | Katehakis, Michael N.1 (AUTHOR) mnk@rutgers.edu, Smit, Laurens C.2 (AUTHOR) laurens@pipe.nl, Spieksma, Floske M.2 (AUTHOR) spieksma@math.leidenuniv.nl |
| Source: | Annals of Operations Research. Nov2025, Vol. 354 Issue 3, p1145-1170. 26p. |
| Subjects: | Markov processes, Matrix inversion, Dynamical systems, Spectral theory, Eigenvalues, Queuing theory, Eigenvectors, Matrices (Mathematics) |
| Abstract: | In this paper we provide a novel inversion method and algorithms for nearly tridiagonal matrices arising in the analysis of Markov processes. The method provides a fast and exact computation procedure of the inverse of the matrix that contains the coefficients of a rate matrix of the Markov processes. If the matrix is of countable size, the method provides an exact solution, independent of the truncation size. In contrast, alternative inverse techniques perform much slower and work only for finite size matrices. This leads to more efficient methods to compute the solution to a countable (finite or infinite) set of equations that occurs in queueing systems and in related fields including Markov processes, birth-and-death processes and inventory systems. Furthermore, we provide a procedure to construct the eigenvalues and eigenvectors of an arbitrary matrix, using those of an easier to analyze matrix. We apply and specialize this procedure to the matrix arising in the corresponding Markov rate matrices under consideration. [ABSTRACT FROM AUTHOR] |
| Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this paper we provide a novel inversion method and algorithms for nearly tridiagonal matrices arising in the analysis of Markov processes. The method provides a fast and exact computation procedure of the inverse of the matrix that contains the coefficients of a rate matrix of the Markov processes. If the matrix is of countable size, the method provides an exact solution, independent of the truncation size. In contrast, alternative inverse techniques perform much slower and work only for finite size matrices. This leads to more efficient methods to compute the solution to a countable (finite or infinite) set of equations that occurs in queueing systems and in related fields including Markov processes, birth-and-death processes and inventory systems. Furthermore, we provide a procedure to construct the eigenvalues and eigenvectors of an arbitrary matrix, using those of an easier to analyze matrix. We apply and specialize this procedure to the matrix arising in the corresponding Markov rate matrices under consideration. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 02545330 |
| DOI: | 10.1007/s10479-019-03460-3 |
