Abstract
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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call