在这篇论文,一个反复的算法被介绍解决 Sylvester 和 Lyapunov 矩阵方程。由这个反复的算法,为任何起始的矩阵 X 1, 答案 X * 能当舍入错误不在时在有限重复步以内被获得。一些例子说明那这个算法比的很有效、好[1 ] 并且[2 ] 。
In this paper, an iterative algorithm is presented to solve the Sylvester and Lyapunov matrix equations. By this iterative algorithm, for any initial matrix X1, a solution X* can be obtained within finite iteration steps in the absence of roundoff errors. Some examples illustrate that this algorithm is very efficient and better than that of [ 1 ] and [2].