Kaczmarz-Type Methods for Solving Matrix Equations

MaRDI QIDQ6438585zbMATH OpenFDO

Authors Weiguo Li, Wendi Bao, Lili Xing, Zhiwei Guo

Publication date 30 May 2023

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

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 page was built for publication: Kaczmarz-Type Methods for Solving Matrix Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6438585)