Abstract
By applying the hierarchical identification principle, the gradient-based iterative algorithm is suggested for solving the Sylvester conjugate matrix equation. With the real representation of a complex matrix, a new convergence proof is given. The necessary and sufficient conditions for the convergence factor is determined to guarantee the convergence of the algorithm for any initial iterative matrix. Also a conjecture by Wu et al. (2010) is solved. A numerical example is offered to illustrate the effectiveness of the suggested algorithm and verify some conclusions proposed in this paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
