Some relaxed iteration methods for solving matrix equation AXB = C

摘要

In this paper, based on the iteration frameworks [6], several relaxed iteration methods are proposed for solving the matrix equation AXB = C by introducing a tunable parameter., and their convergence properties are analyzed in detail. Moreover, the optimal choices of the parameter.to achieve the fastest convergence rate are also obtained for some special cases. Finally, numerical experiments are carried out to illustrate the effectiveness of the proposed algorithms. (C) 2021 Elsevier Inc. All rights reserved.