2023/05/31 by Weiguo Li, Wendi Bao, Li, Weiguo +5
Computer Science · Mathematics · #65F10 #65F20 #65F30 #65F50 #Advanced Optimization Algorithms Research #FOS: Mathematics #Iterative Methods for Nonlinear Equations #Matrix Theory and Algorithms #Numerical Analysis (math.NA)
paper · pdf · doi:10.48550/arxiv.2305.19508
openalex publication_date 2023/05/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.