Kaczmarz-Type Methods for Solving Matrix Equations
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:OH3PJLDPrecord.jsonopen to challenge →
classification
math.NA
cs.NA
keywords
methodsmatrixiterativekaczmarz-typemultiplicationnumericalranksolving
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.