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.

Full Text
Published version (Free)

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 call