Kaczmarz-Type Methods for Solving Matrix Equations

05/31/2023
by   Weiguo Li, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2023

Kaczmarz-Type Method for Solving Matrix Equation AXB=C

In this paper, several row and column orthogonal projection methods are ...
research
06/24/2021

A sparse approximate inverse for triangular matrices based on Jacobi iteration

In this paper, we propose a sparse approximate inverse for triangular ma...
research
11/04/2020

Exponential of tridiagonal Toeplitz matrices: applications and generalization

In this paper, an approximate method is presented for computing exponent...
research
05/25/2021

An efficient iterative method for solving parameter-dependent and random diffusion problems

This paper develops and analyzes a general iterative framework for solvi...
research
09/21/2023

An iterative method to solve Lyapunov equations

We present here a new splitting method to solve Lyapunov equations in a ...
research
07/19/2023

Comparative analysis of Jacobi and Gauss-Seidel iterative methods

The paper presents a comparative analysis of iterative numerical methods...

Please sign up or login with your details

Forgot password? Click here to reset