Modified Jacobi-Gradient Iterative Method for Generalized Sylvester Matrix Equation
چکیده
چکیدهای برای این سند ثبت نشده است.
چکیدهای برای این سند ثبت نشده است.
In this paper, by extending the well-known Jacobi and Gauss–Seidel iterations for Ax = b, we study iterative solutions of matrix equations AXB = F and generalized Sylvester matrix equations AXB + CXD = F (including the Sylvester equation AX + XB = F as a special case), and presen
in this paper, an iterative method is proposed for solving large general sylvester matrix equation $axb+cxd = e$, where $a in r^{ntimes n}$ , $c in r^{ntimes n}$ , $b in r^{stimes s}$ and $d in r^{stimes s}$ are given matrices and $x in r^{stimes s}$ is the unknown matrix. we pre
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A \in R^{n\times n}$ , $C \in R^{n\times n}$ , $B \in R^{s\times s}$ and $D \in R^{s\times s}$ are given matrices and $X \in R^{s\times s}$ is the unknown matr
the global generalized minimum residual (gl-gmres) method is examined for solving the generalized sylvester matrix equation [sumlimits_{i = 1}^q {a_i } xb_i = c.] some new theoretical results are elaborated for the proposed method by employing the schur complement. the
The global generalized minimum residual (Gl-GMRES) method is examined for solving the generalized Sylvester matrix equation \[\sum\limits_{i = 1}^q {A_i } XB_i = C.\] Some new theoretical results are elaborated for the proposed method by employing the Schur complement. These resu
In this study based on the accelerated over relaxation (AOR) method we make an iterative scheme for solving generalized Lyapunov matrix equation$$ {A}{X}+{X}{B}+\sum_{j=1}^{m}{N}_j{X}{M}_j={C},$$over complex or real matrices. Then we analyze the convergence of the new iterative m