Abstract
AbstractThis paper discussed a modified gradient-based iterative (MGI) algorithm for solving the Sylvester conjugate transpose matrix problem over the Hamiltonian matrix. We proved that the suggested algorithm converges to the exact solution for every given initial Hamiltonian matrix. A sufficient condition is specified to assure that the suggested algorithm's solution converges to the Hamiltonian solution. Numerical examples are presented to verify the theoretical conclusions and illustrate the superiority and efficiency of the offered approach over the relaxed gradient-iterative (RGI) algorithm proposed in [13].
Publisher
Research Square Platform LLC
Reference13 articles.
1. A relaxed gradient-based algorithm for solving extended Sylvester-conjugate matrix equations;Ramadan MA;Asian. J. Control.,2014
2. A modified gradient-based algorithm for solving extended Sylvester - conjugate matrix equations;Ramadan MA;Asian. J. Control.,2018
3. An efficient algorithm for solving extended Sylvester-conjugate transpose matrix equations;Song C;Arab J. Math. Sci.,2011
4. An accelerated gradient based iterative algorithm for solving extended Sylvester - conjugate matrix equations;Bayoumi AME;Trans. Inst. Meas. Control,2018
5. Zhang, X.: and X. Sheng, the Relaxed Gradient Based Iterative Algorithm for the Symmetric (Skew Symmetric) Solution of the Sylvester Equation$$ AX+XB=C$$, Mathematical Problems in Engineering, DOI: 10.1155/2017/1624969, Article ID 1624969, 1–8. (2017)