Highly Accurate Latouche-Ramaswami Logarithmic Reduction Algorithm for Quasi-Birth-and-Death Process

Authors

  • Guiding Gu School of Mathematics, Shanghai University of Finance and Economics, Shanghai 200433, China
  • Wang Li Department of Mathematics, University of Texas at Arlington, P.O. Box 19408, Arlington, TX 76019, USA
  • Ren-Cang Li Department of Mathematics, University of Texas at Arlington, P.O. Box 19408, Arlington, TX 76019, USA

DOI:

https://doi.org/10.4208/jms.v55n2.22.05

Keywords:

Quadratic matrix equation, M-matrix, quasi-birth-and-death process, minimal nonnegative solution, entrywise relative accuracy.

Abstract

This paper is concerned with the quadratic matrix equation $A_0+A_1X+A_2X^2$ $=X$ where $I-A_0-A_1-A_2$ is a regular $M$-matrix, i.e., there exists an entrywise positive vector u such that $(I-A_0-A_1-A_2)$u $\ge 0$ entrywise. It broadly includes those originally arising from the quasi-birth-and-death (QBD) process as a special case where $I-A_0-A_1-A_2$  is an irreducible singular $M$-matrix and $(A_0+A_1+A_2)$1=1 with 1 being the vector of all ones. A highly accurate implementation of Latouche-Ramaswami logarithmic reduction algorithm [Journal of Applied Probability, 30(3):650-674, 1993] is proposed to compute the unique minimal nonnegative solution of the matrix equation with high entrywise relative accuracy as it deserves. Numerical examples are presented to demonstrate the effectiveness of the proposed implementation.

Published

2022-04-25

Issue

Section

Articles