This article proposes a relaxed gradient iterative (RGI) algorithm to solve coupled Sylvester-conjugate transpose matrix equations (CSCTME) with two unknowns.
This article proposes a RGI algorithm to solve CSCTME with two unknowns.
The introduced (RGI) algorithm is more efficient than the gradient iterative (GI) algorithm presented in Bayoumi (2014), where the author's method exhibits quick convergence behavior.
The introduced (RGI) algorithm is more efficient than the GI algorithm presented in Bayoumi (2014), where the author's method exhibits quick convergence behavior.
In systems and control, Lyapunov matrix equations, Sylvester matrix equations and other matrix equations are commonly encountered.
In systems and control, Lyapunov matrix equations, Sylvester matrix equations and other matrix equations are commonly encountered.
This article proposes a relaxed gradient iterative (RGI) algorithm to solve coupled Sylvester conjugate transpose matrix equations (CSCTME) with two unknowns. For any initial matrices, a sufficient condition is derived to determine whether the proposed algorithm converges to the exact solution. To demonstrate the effectiveness of the suggested method and to compare it with the gradient-based iterative algorithm proposed in [6] numerical examples are provided.
