Abstract
The main purpose of this paper is to establish two relaxed gradient-based iterative (RGI) algorithms extending the Jacobi and Gauss–Seidel iterations for solving the generalized Sylvester-conjugate matrix equation , over centro-symmetric, and centro-Hermitian matrices. It is shown that the iterative methods, respectively, converge to the centro-symmetric and centro-Hermitian solutions for any initial centro-symmetric and centro-Hermitian matrices. We report numerical tests to show the effectiveness of the proposed approaches.
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.
