The randomized block steepest descent iterative method for solving linear systems and its extension to the tensor framework
Mathematical communications · 17.11.2026 · 31 (2) · 179-195
DOI: 10.64785/mc.31.2.3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical communications, online erschienen am 17.11.2026. Verfasst von Fatemeh Panjeh Ali Beik und 1 weiteren Autor:innen.
Abstract (Originalsprache)
We present a new randomized block variant of the residual norm steepest descent iterative method for solving a consistent linear system of equations. The proposed algorithm is also applied both in matrix form for solving a class of matrix equations and in the t-product framework for solving a class of tensor equations. We prove that the residual norm of the computed approximate solutions converges linearly in expectation. Numerical experiments are reported to illustrate the validity of established results and superiority of the proposed approach over three recently examined methods for solving a linear system of equations with randomly generated coefficient matrices, a matrix equation and a tensor equation arising from color image restoration problems in the literature.
Zitieren
APA
Beik, F. P. A., & Zhang, K. (2026). The randomized block steepest descent iterative method for solving linear systems and its extension to the tensor framework. Mathematical communications, 31(2), 179-195. https://doi.org/10.64785/mc.31.2.3
Vancouver
Beik FPA, Zhang K. The randomized block steepest descent iterative method for solving linear systems and its extension to the tensor framework. Mathematical communications. 2026;31(2):179-195. doi:10.64785/mc.31.2.3
BibTeX
@article{Beik2026,
author = {Beik, Fatemeh Panjeh Ali and Zhang, Ke},
title = {The randomized block steepest descent iterative method for solving linear systems and its extension to the tensor framework},
journal = {Mathematical communications},
year = {2026},
volume = {31},
number = {2},
pages = {179--195},
doi = {10.64785/mc.31.2.3}
}
EUVIMED