Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations (Q638860): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.apm.2011.01.022 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2033987350 / rank | |||
Normal rank |
Revision as of 02:38, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations |
scientific article |
Statements
Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations (English)
0 references
16 September 2011
0 references
A complex matrix \(P \in \mathbb C^{n \times n}\) is said to be a generalized reflection if \(P=P^H=P^{-1}\). Let \(P \in \mathbb C^{n \times n}\) and \(Q \in \mathbb C^{n \times n}\) be two generalized reflection matrices. A complex matrix \(A \in \mathbb C^{n \times n}\) is called generalized centro-symmetric with respect to \((P;Q)\) if \(A = P A Q\). It is obvious that any \(n \times n\) complex matrix is also a generalized centro-symmetric matrix with respect to \((I;I)\). In this work, the problem is considered of finding a simple way to compute a generalized centro-symmetric solution pair of the generalized coupled Sylvester matrix equations \[ \begin{aligned} &\sum_{i=1}^l A_i X B_i + \sum_{i=1}^l C_i Y D_i = M, \\ &\sum_{i=1}^l E_i X F_i + \sum_{i=1}^l G_i Y H_i = N, \end{aligned} \] (including Sylvester and Lyapunov matrix equations as special cases) and to determine the solvability of these matrix equations over generalized centro-symmetric matrices. By extending the idea of the conjugate gradient method, an iterative algorithm is proposed for solving the generalized coupled Sylvester matrix equations over generalized centro-symmetric matrices. Moreover, the application of the proposed method to find a generalized centro-symmetric solution to the quadratic matrix equation \(Q(X)=A X^2 + B X + C = 0\) is highlighted. Finally, two numerical examples are presented to support the theoretical results.
0 references
Sylvester matrix equation
0 references
Lyapunov matrix equation
0 references
generalized coupled Sylvester matrix equations
0 references
least Frobenius norm solution pair
0 references
optimal approximation solution pair
0 references
iterative method
0 references
centro-symmetric matrix
0 references
conjugate gradient method
0 references
quadratic matrix equation
0 references
numerical examples
0 references