Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Numerical solution to linear matrix equation by finite steps iteration

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Li, Z.-Y. ; Dept. of Math., Harbin Inst. of Technol., Harbin, China ; Zhou, B. ; Wang, Y. ; Duan, G.-R.

The matrix equation Σli=1AiXBi = C, which contains the well-known Sylvester matrix equation and Lyapunov matrix equation as special cases, has many important applications in control system theory. This study presents an iterative algorithm to solve such linear matrix equation. It is shown that the proposed algorithm converges to the unique solution to the linear matrix equation at finite steps for arbitrary initial condition. Moreover, if the matrix equation is not consistent, the least squares solution can be obtained by alternatively solving a linear matrix equation in the same form, which can also be solved by the proposed iterative algorithm. Numerical example shows the effectiveness of the proposed approach.

Published in:

Control Theory & Applications, IET  (Volume:4 ,  Issue: 7 )