Kaczmarz-Type Methods for Solving Matrix Equations
Abstract
In this paper, several Kaczmarz-type numerical methods for solving the matrix equation AX=B and XA=C are proposed, where the coefficient matrix A may be full rank or rank deficient. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.