Abstract
This paper is concerned with an efficient iterative algorithm to solve general the Sylvester-conjugate matrix equation of the form ∑_(i= 1)^s▒〖A_i V B_i 〗+ ∑_(j=1)^t▒〖C_j W D_j 〗=∑_(l=1)^m▒〖E_1 V ̅ 〗 F_1+C The proposed algorithm is an extension to our proposed general Sylvester-conjugate equation of the form ∑_(i= 1)^s▒〖A_i V 〗+ ∑_(j=1)^t▒〖B_j W 〗=∑_(l=1)^m▒〖E_1 V ̅ 〗 F_1+C When a solution exists for this matrix equation, for any initial matrices, the solutions can be obtained within finite iterative steps in the absence of round off errors. Some lemmas and theorems are stated and proved where the iterative solutions are obtained. Finally, a numerical example is given to verify the effectiveness of the proposed algorithm.
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.
