An iterative method for symmetric solutions and optimal approximation solution of the system of matrix equations A1XB1 = C1, A2XB2 = C2
暂无分享,去创建一个
Xi-Yan Hu | Lei Zhang | Ya-Xin Peng | Xiyan Hu | Lei Zhang | Ya-Xin Peng
[1] Magnus R. Hestenes,et al. Conjugate Direction Methods in Optimization , 1980 .
[2] Dean M. Young,et al. A representation of the general common solution to the matrix equations A1XB1 = C1 and A2XB2 = C2 with applications , 2001 .
[3] Sujit Kumar Mitra,et al. A pair of simultaneous linear matrix equations A1XB1 = C1, A2XB2 = C2 and a matrix programming problem , 1990 .
[4] J. W. van der Woude. On the existence of a common solution X to the matrix equations AiXBj = Cij, (i, j) ∈ Γ , 2003 .
[5] O. Axelsson. Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations , 1980 .
[6] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .
[7] Kang C. Jea,et al. Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods , 1980 .
[8] S. Mitra. The matrix equations AX = C, XB = D , 1984 .
[9] J. Reid. Large Sparse Sets of Linear Equations , 1973 .
[10] Gene H. Golub,et al. Matrix computations , 1983 .
[11] Xi-Yan Hu,et al. An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation AXB=C , 2005, Appl. Math. Comput..