abs method for solving fuzzy sylvester matrix equation
چکیده
the main aim of this paper intends to discuss the solution of fuzzy sylvester matrix equation
the main aim of this paper intends to discuss the solution of fuzzy sylvester matrix equation
The main aim of this paper intends to discuss the solution of fuzzy Sylvester matrix equation AX +XB = C where A = (aij) ∈ Rn×n , B = (bij) ∈ Rm×m are crisp Mmatrices, C = (cij) ∈ Rn×m is fuzzy matrix and X ∈ Rn×m is unknown,by applying a special algorithm based on a class of ABS
The main aim of this paper intends to discuss the solution of fuzzy Sylvester matrix equation
It is known that using Kronecker product and Vec-operation for solving matrix equations under fuzzy uncertainty, make the dimension of the crisp transformed systems much higher than the dimension of the initial fuzzy matrix equation. In this paper, a new iterative approach is pro
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 paper, we consider the fuzzy Sylvester matrix equation AX + XB = C, where A ∈ Rn×n and B ∈ Rm×m are crisp M-matrices, C is an n×m fuzzy matrix and X is unknown. We first transform this system to an (mn)× (mn) fuzzy system of linear equations. Then we investigate the exist