Abstract
In this paper, several Kaczmarz-type numerical methods for solving the matrix equations AX = B and XA = C are proposed, where the coefficient matrix A may be full rank or deficient rank. These methods are iterative methods without matrix multiplication. Theoretically, the convergence of these methods is proved. The numerical results show that these methods are more efficient than iterative methods involving matrix multiplication for high-dimensional matrices.
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.
