期刊
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE
卷 43, 期 8, 页码 1580-1590出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207721.2010.549584
关键词
generalised Sylvester matrix equation; iterative method; convergence; generalised bisymmetric matrix; skew-symmetric matrix; symmetric orthogonal matrix
A matrix P is called a symmetric orthogonal if P = P-T = P-1. A matrix X is said to be a generalised bisymmetric with respect to P if X = X-T = PXP. It is obvious that any symmetric matrix is also a generalised bisymmetric matrix with respect to I (identity matrix). By extending the idea of the Jacobi and the Gauss-Seidel iterations, this article proposes two new iterative methods, respectively, for computing the generalised bisymmetric (containing symmetric solution as a special case) and skew-symmetric solutions of the generalised Sylvester matrix equation Sigma(l)(i=1) A(i)YB(i) = C, (including Sylvester and Lyapunov matrix equations as special cases) which is encountered in many systems and control applications. When the generalised Sylvester matrix equation has a unique generalised bisymmetric (skew-symmetric) solution, the first (second) iterative method converges to the generalised bisymmetric (skewsymmetric) solution of this matrix equation for any initial generalised bisymmetric (skew-symmetric) matrix. Finally, some numerical results are given to illustrate the effect of the theoretical results.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据