Honam Mathematical Journal (호남수학학술지)

The Honam Mathematical Society (호남수학회)
권호 표지
DOI QR코드

DOI QR Code

NEWTON'S METHOD FOR SOLVING A QUADRATIC MATRIX EQUATION WITH SPECIAL COEFFICIENT MATRICES

  • Received : 2013.06.04
  • Accepted : 2013.06.18
  • Published : 2013.09.25
Download PDF
⟨ Previous Next ⟩

Abstract

We consider the iterative solution of a quadratic matrix equation with special coefficient matrices which arises in the quasibirth and death problem. In this paper, we show that the elementwise minimal positive solvent of the quadratic matrix equations can be obtained using Newton's method if there exists a positive solvent and the convergence rate of the Newton iteration is quadratic if the Fr$\acute{e}$chet derivative at the elementwise minimal positive solvent is nonsingular. Although the Fr$\acute{e}$chet derivative is singular, the convergence rate is at least linear. Numerical experiments of the convergence rate are given.

Keywords

Acknowledgement

Supported by : National Research Foundation of Korea(NRF)

References

  1. Dario A. Bini, Guy Latouche, and Beatrice Meini, Numerical methods for structured Markov chains, Oxford University Press Oxford, 2005.
  2. B.J. Broxson, The Kronecker product, Master's thesis, University of North Florida, 2006.
  3. Chun-Hua Guo and Nicholas J. Higham, Iterative solution of a nonsymmetric algebraic RICCATI equation, SIAM Journal on Matrix Analysis and Applications, 29 (2007), 396-412. https://doi.org/10.1137/050647669
  4. Chun-Hua Guo and Peter Lancaster, Analysis and modification of newton's method for algebraic RICCATI equations, Mathematics of Computation, 67 (223) (1998), 1089-1105. https://doi.org/10.1090/S0025-5718-98-00947-8
  5. S. Hautphenne, G. Latouche, and Marie-Ange Remiche, Newton's iteration for the extinction probability of a Markovian binary tree, Linear Algebra and its Applications, 428 (2008), 2791-2804. https://doi.org/10.1016/j.laa.2007.12.024
  6. C. He, B. Meini, N. H. Rhee, and K. Sohraby, A quadratically convergent Bernoulli-like algorithm for solving matrix polynomial equations in markov chains, Electronic transactions on numerical analysis, 17 (2004), 151-167.
  7. Qi-Ming He and Marcel F. Neuts, On the convergence and limits of certain matrix sequences arising in quasi-birth-and-death Markov chains, Journal of Applied Probability, 38(2) (2001), 519-541. https://doi.org/10.1239/jap/996986760
  8. Roger A. Horn and Charles R. Johnson, Matrix Analysis, Cambridge University Press, 1985.
  9. C. T. Kelley, A shamanskii-like acceleration scheme for nonlinear equations at singular roots, Mathematics of Computation, 47(176) (1986), 609-623.
  10. Hyun-Min Kim, Numerical methods for solving a quadratic matrix equation, PhD thesis, Department of Mathematics, University of Manchester, 2000.
  11. W. Kratz and E. Stickel, Numerical solution of matrix polynomial equations by Newton's method, IMA Journal of Numerical Analysis, 7 (1987), 355-369. https://doi.org/10.1093/imanum/7.3.355
  12. G. Latouche, Newton's iteration for nonlinear equations in Markov chains, IMA Journal of Numerical Analysis, 14 (1994), 583-598. https://doi.org/10.1093/imanum/14.4.583
  13. G. Latouche and V. Ramaswami, Introduction to Matrix Analytic Methods in Stochastic Modeling, ASA-SIAM, 1999.
  14. George Poole and Thomas Boullion, A survey on M-matrices, SIAM review, 16(4) (1974), 419-427. https://doi.org/10.1137/1016079
  15. Jong Hyeon Seo and Hyun-Min Kim, Solving matrix polynomials by Newton's method with exact line searches, Journal of KSIAM, 12(2) (2008), 55-68.
  16. G. Strang, Linear Algebra and Its Applications, Thomson, Brooks/Cole, 4th edition, 2006.
  17. David M. Young, Iterative Solution of Large Linear Systems, Academic Press, 1971.