Iterative algorithm for solving a class of general Sylvester-conjugate matrix equation \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\sum_{i = 1}^{s} A_{i}V + \sum_{j = 1}^{t} B_{j}W = \sum_{l = 1}^{m} E_{l}\overline{V}F_{l} + C$\end{document}

This paper is concerned with iterative solution to general Sylvester-conjugate matrix equation of the form \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\sum_{i = 1}^{s} A_{i}V + \sum_{j = 1}^{t} B_{j}W = \sum_{l = 1}^{m} E_{l}\overline{V}F_{l} + C$\end{document}. An iterative algorithm is established to solve this matrix equation. When this matrix equation is consistent, for any initial matrices, the solutions can be obtained within finite iterative steps in the absence of round off errors. Some lemmas and theorems are stated and proved where the iterative solutions are obtained. Finally, a numerical example is given to verify the effectiveness of the proposed algorithm.