Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-24T09:05:11.176Z Has data issue: false hasContentIssue false
  • English
  • Français

Newton-Shamanskii Method for a Quadratic Matrix Equation Arising in Quasi-Birth-Death Problems

Published online by Cambridge University Press:  16 July 2018

Pei-Chang Guo
Pei-Chang Guo*
Affiliation:
School of Mathematical Sciences, Peking University, Beijing 100871, China.
*
*Corresponding author.Email address:[email protected]
Get access

Abstract

In order to determine the stationary distribution for discrete time quasi-birth-death Markov chains, it is necessary to find the minimal nonnegative solution of a quadratic matrix equation. The Newton-Shamanskii method is applied to solve this equation, and the sequence of matrices produced is monotonically increasing and converges to its minimal nonnegative solution. Numerical results illustrate the effectiveness of this procedure.

Keywords

65F3065H10Quadratic matrix equationquasi-birth-death problemsNewton-Shamanskii methodminimal nonnegative solution
Type
Research Article
Information
East Asian Journal on Applied Mathematics , Volume 4 , Issue 4 , November 2014 , pp. 386 - 395
Copyright
Copyright © Global-Science Press 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Latouche, G. and Ramaswami, V., Introduction to Matrix Analytic Methods in Stochastic Modeling, SIAM, Philadelphia (1999).CrossRefGoogle Scholar
[2] Latouche, G., Newton's iteration for non-linear equations in Markov chains, IMA J. Numer. Anal. 14 583–598 (1994).CrossRefGoogle Scholar
[3] Gardiner, J.D., Laub, A.J., Amato, J.J. and Moler, C.B., Solution of the Sylvester matrix equation AX BT + CXDT = E , ACM Trans. Math. Software 18, 223–231 (1992).CrossRefGoogle Scholar
[4] Bini, D.A., Latouche, G. and Meini, B., Numerical methods for structured Markov chains, Oxford University Press, New York (2005).CrossRefGoogle Scholar
[5] Latouche, G. and Ramaswami, V., A logarithmic reduction algorithm for quasi-birth-death processes, J. Appl. Prob. 30, 650–674 (1993).CrossRefGoogle Scholar
[6] Bini, D.A. and Meini, B., On cyclic reduction applied to a class of Toeplitz-like matrices arising in queueing problems, in Computations with Markov Chains, Kluwer, Dordrecht (1995).Google Scholar
[7] Bini, D.A. and Meini, B., On the solution of a nonlinear matrix equation arising in queueingprob-lems, SIAM J. Matrix Anal. Appl. 17, 906–926 (1996).CrossRefGoogle Scholar
[8] Bini, D.A. and Meini, B., Improved cyclic reduction for solving queueing problems, Numer. Algorithms 15, 57–74 (1997).CrossRefGoogle Scholar
[9] Meini, B., Solving QBD problems: The cyclic reduction algorithm versus the invariant subspace method, Adv. Perf. Anal. 1, 215–225 (1998).Google Scholar
[10] He, C., Meini, B. and Rhee, N.H., A shifted cyclic reduction algorithm for quasi-birth-death problems, SIAM J. Matrix Anal. Appl. 23, 673–691 (2001).CrossRefGoogle Scholar
[11] Bini, D.A., Latouche, G. and Meini, B., Solving matrix polynomial equations arising in queueing problems, Linear Algebra Appl. 340, 225–244 (2002).CrossRefGoogle Scholar
[12] Poloni, F., Quadratic vector equations, Linear Algebra Appl. 438, 1627–1644 (2013).CrossRefGoogle Scholar
[13] Lin, Y. and Bao, L., Convergence analysis of the Newton-Shamanskii method for a nonsymmetric algebraic Riccati equation, Numer. Linear Algebra Appl. 15, 535–546 (2008).CrossRefGoogle Scholar
[14] Guo, C.-H., Monotone convergence of Newton-like methods for M-matrix algebraic Riccati equations, Numer. Algorithms 64, 295–309 (2013).CrossRefGoogle Scholar
[15] Guo, P.-C. and Xu, S.-F., The modified Newton-Shamanskii method for the solution of a quadratic vector equation arising in Markovian binary trees, Calcolo, to appear.CrossRefGoogle Scholar
[16] Neuts, M.F., Structured Stochastic Matrices of M/G/1 Type and Their Applications, Dekker, New York (1989).Google Scholar
[17] Varga, R., Matrix Iterative Analysis, Prentice-Hall (1962).Google Scholar