Variable <i>s</i> -step CGNR method for solving the matrix equation <i>AXB = C</i> arising in image processing

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.

Authors

Institutions

Publication Details

Journal
Mathematical Modelling and Analysis
Published
2026-01-21
DOI
https://doi.org/10.3846/mma.2026.23695
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Variable s -step CGNR method for solving the matrix equation AXB = C arising in image processing

Hojjatollah Shokri Kaveh, Masoud Hajarian
Mathematical Modelling and Analysis
Matrix Theory and Algorithms
article

Variable s -step CGNR method for solving the matrix equation AXB = C arising in image processing

Hojjatollah Shokri Kaveh, Masoud Hajarian
article en

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.

Mathematical Modelling and AnalysisVol. 31(1)
Shahid Beheshti University (IR)
University of Texas at San Antonio
Openalex Percentile: Top 80%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.