scholarly journals Highly accurate doubling algorithm for quadratic matrix equation from quasi-birth-and-death process

2019 ◽  
Vol 583 ◽  
pp. 1-45 ◽  
Author(s):  
Cairong Chen ◽  
Ren-Cang Li ◽  
Changfeng Ma
2014 ◽  
Vol 4 (4) ◽  
pp. 386-395
Author(s):  
Pei-Chang Guo

AbstractIn 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.


2017 ◽  
Vol 15 (1) ◽  
pp. 340-353 ◽  
Author(s):  
Duanmei Zhou ◽  
Guoliang Chen ◽  
Jiu Ding

Abstract Let A = PQT, where P and Q are two n × 2 complex matrices of full column rank such that QTP is singular. We solve the quadratic matrix equation AXA = XAX. Together with a previous paper devoted to the case that QTP is nonsingular, we have completely solved the matrix equation with any given matrix A of rank-two.


Sign in / Sign up

Export Citation Format

Share Document