2010IET Control Theory and ApplicationsRequires access

Numerical solution to linear matrix equation by finite steps iteration

Z.-Y. Li, Bin Zhou, Yilong Wang, Guang‐Ren Duan

Open publisher page 24 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 24 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Mathematics, Sylvester equation, Matrix difference equation, State-transition matrix, Matrix differential equation, Matrix splitting, Matrix (chemical analysis), Eight-point algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Numerical solution to linear matrix equation by finite steps iteration — Research Paper | ScholarLens