Kaczmarz-Type Method for Solving Matrix Equation AXB=C

05/26/2023
by   Xing Lili, et al.
0

In this paper, several row and column orthogonal projection methods are proposed for solving matrix equation AXB=C, where the matrix A and B are full rank or rank deficient and equation is consistent or not. These methods are iterative methods without matrix multiplication. It is theoretically proved these methods converge to the solution or least-squares solution of the matrix equation. Numerical results show that these methods are more efficient than iterative methods involving matrix multiplication for high-dimensional matrix.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2023

Kaczmarz-Type Methods for Solving Matrix Equations

In this paper, several Kaczmarz-type numerical methods for solving the m...
research
10/26/2017

A Fast Algorithm for Solving Henderson's Mixed Model Equation

This article investigates a fast and stable method to solve Henderson's ...
research
02/04/2023

System reduction-based approximate reanalysis method for statically indeterminate structures with high-rank modification

Efficient structural reanalysis for high-rank modification plays an impo...
research
06/27/2023

Matrix equation representation of convolution equation and its unique solvability

We consider the convolution equation F*X=B, where F∈ℝ^3× 3 and B∈ℝ^m× n ...
research
10/12/2021

Extending the R Language with a Scalable Matrix Summarization Operator

Analysts prefer simpler interpreted languages to program their computati...

Please sign up or login with your details

Forgot password? Click here to reset