Variable s -step CGNR method for solving the matrix equation AXB = C arising in image processing
Abstract
The matrix equation $ {AXB} = {C}$ is widely utilized in signal and image processing. In this paper, we present a variable s-step algorithm based on the CGNR method for solving this matrix equation by employing normalization techniques. This algorithm is subsequently enhanced through the application of s-step and regularization methods. By varying the number of basic matrices involved (denoted as s), both the accuracy and speed of the algorithm are improved. The proposed algorithm effectively computes solutions to the matrix equation, demonstrating superior performance when the problem matrices are symmetric. Finally, we investigate the performance and efficacy of these techniques through several numerical examples.
Fields of Study & Subjects
Matrix Theory and Algorithms
Statistical and numerical algorithms
Tensor decomposition and applications
Publication details
- Journal / source
- Mathematical Modelling and Analysis
- Publisher
- Vilnius Gediminas Technical University
- Volume
- 31
- Issue
- 1
- Pages
- 79–95
- Publication date
- 21 January 2026
- Language
- EN