论文信息 - The iterative solution of the matrix equation XA + BX + C = 0

The iterative solution of the matrix equation XA + BX + C = 0

Abstract An iterative procedure is presented for the solution of the matrix equation XA + BX + C = 0 for complex matrices A , B , and C . Known iterative solution techniques, converging when A and B are stable, follow as special cases of this general formulation.

D. F. Miller

[1] Richard H. Bartels,et al. Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] , 1972, Commun. ACM.

[2] E. Davison,et al. The numerical solution of A'Q+QA =-C , 1968 .

[3] G. Golub,et al. A Hessenberg-Schur method for the problem AX + XB= C , 1979 .

[4] Per Hagander,et al. Numerical solution of ATS + SA + Q = 0 , 1972, Inf. Sci..

[5] C. S. Lu. Solution of the matrix equation AX+XB = C , 1971 .

[6] P. Lancaster. Explicit Solutions of Linear Matrix Equations , 1970 .

[7] R. A. Smith. Matrix Equation $XA + BX = C$ , 1968 .

[8] Dereck S. Meek,et al. The numerical solution of A'Q+QA = -C , 1977 .