Abstract
We propose a two-step AOR iteration method for solving the linear matrix equation \(AXB=C\). The convergence of this iteration method is discussed, and numerical results are reported to show the correctness of the theory and the effectiveness of this method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bai Z-Z (2000) Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems. Appl Math Comput 109:273–285
Bai Z-Z (2011) On Hermitian and skew-Hermitian splitting iteration methods for the continuous Sylvester equations. J Comput Math 29:185–198
Bai Z-Z (2015) Motivations and realizations of Krylov subspace methods for large sparse linear systems. J Comput Appl Math 283:71–78
Bai Z-Z, Golub GH, Ng MK (2003) Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. SIAM J Matrix Anal Appl 24:603–626
Deng Y-B, Bai Z-Z, Gao Y-H (2006) Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations. Num Linear Algebra Appl 13:801–823
Fausett DW, Fulton CT (1994) Large least squares problems involving Kronecker products. SIAM J Matrix Anal Appl 15:219–227
Golub GH, Van Loan CF (2013) Matrix Computations, 4th edn. The Johns Hopkins University Press, Baltimore
Li X, Huo H-F, Yang A-L (2018) Preconditioned HSS iteration method and its non-alternating variant for continuous Sylvester equations. Comput Math Appl 75:1095–1106
Liao A-P, Bai Z-Z (2003) Least-squares solution of \(AXB=D\) over symmetric positive semidefinite matrices \(X\). J Comput Math 21:175–182
Liao A-P, Bai Z-Z (2005) Least squares symmetric and skew-symmetric solutions of the matrix equation \(AXA^{T} + BYB^{T} = C\) with the least norm. Math Num Sin 27:81–95 ((In Chinese))
Liu Z-Y, Zhou Y, Zhang Y-L, Lin L, Xie D-X (2019) Some remarks on Jacobi and Gauss-Seidel-type iteration methods for the matrix equation \(AXB = C\). Appl Math Comput 354:305–307
Peng Z-Y (2005) An iterative method for the least squares symmetric solution of the linear matrix equation \(AXB=C\). Appl Math Comput 170:711–723
Rauhala UA (1980) Introduction to array algebra. Photogramm Eng Remote Sens 46:177–192
Regalia PA, Mitra SK (1989) Kronecker products, unitary matrices and signal processing applications. SIAM Rev 31:586–613
Tian Z-L, Tian M-Y, Liu Z-Y, Xu T-Y (2017) The Jacobi and Gauss-Seidel-type iteration methods for the matrix equation \(AXB=C\). Appl Math Comput 292:63–75
Wang X, Li Y, Dai L (2013) On Hermitian and skew-Hermitian splitting iteration methods for the linear matrix equation \(AXB=C\). Comput Math Appl 65:657–664
Yang J, Deng Y-B (2018) On the solutions of the equation \(AXB=C\) under Toeplitz-like and Hankel matrices constraint. Math Methods Appl Sci 41:2074–2094
Zak MK, Toutounian F (2013) Nested splitting conjugate gradient method for matrix equation \(AXB=C\) and preconditioning. Comput Math Appl 66:269–278
Zha H (1995) Comments on large least squares problems involving Kronecker products. SIAM J Matrix Anal Appl 16:1172
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by yimin wei.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supported by The National Natural Science Foundation (no. 11501038), and The Science and Technology Planning Projects of Beijing Municipal Education Commission (no. KM201911232010 and no. KM202011232019), P. R. China.
Rights and permissions
About this article
Cite this article
Chen, F., Li, TY. Two-step AOR iteration method for the linear matrix equation \(AXB=C\). Comp. Appl. Math. 40, 89 (2021). https://doi.org/10.1007/s40314-021-01472-z
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-021-01472-z