In this paper, we present an accelerated gradient based algorithm by minimizing certain
criterion quadratic function for solving the generalized Sylvester-transpose matrix equation …

This paper proposes the Lanczos version of the biconjugate residual algorithm to solve the
reflexive or anti-reflexive solutions of a class of generalized coupled Sylvester matrix …

The iterative method of generalized coupled Sylvester-transpose linear matrix equations AX
B+ CYTD= S 1, EXT F+ GYH= S 2 over reflexive or anti-reflexive matrix pair (X, Y) is …

In this study, we consider the iteration solutions of the generalized coupled Sylvester-
conjugate matrix equations: A 1 X+ B 1 Y= D 1 X¯ E 1+ F 1, A 2 Y+ B 2 X= D 2 Y¯ E 2+ F 2 …

In this paper, we consider the iteration solutions of generalized coupled Sylvester-transpose
matrix equations: A 1 XB 1+ C 1 YTD 1= F 1, A 2 YB 2+ C 2 XTD 2= F 2. When the coupled …

The IDR (s) based on the induced dimension reduction (IDR) theorem, is a new class of
efficient algorithms for large nonsymmetric linear systems. IDR (1) is mathematically …

CMRH method (Changing minimal residual with Hessenberg process) is an iterative method
for solving nonsymmetric linear systems. This method is similar to QMR method but based …

This paper introduces another version of biconjugate residual method (BCR) for solving the
generalized coupled Sylvester matrix equations over centrosymmetric or anti …

In this paper a feasible and effective algorithm is proposed to find solutions to the matrix
equation AX=B subject to a matrix inequality constraint CXD≧E. Numerical experiments are …

In this paper, we first present a relaxed gradient based iterative (RGI) algorithm for solving
matrix equations A 1 XB 1= F 1 and A 2 XB 2= F 2. The idea is from (Niu et al., 2011; Xie and …