Some relaxed iteration methods for solving matrix equation AXB=C

Zhaolu Tian, Xiaojing Li, Yinghui Dong and Zhongyun Liu

Applied Mathematics and Computation, 2021, vol. 403, issue C

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.

Keywords: Matrix splitting; Iteration method; Relaxed; Optimal parameter; Kronecker products (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321002794
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:403:y:2021:i:c:s0096300321002794

DOI: 10.1016/j.amc.2021.126189

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().