abs method for solving fuzzy sylvester matrix equation

Authors

m. a. fariborzi araghi

islamic azad university, central tehran branch, iran department of mathematics m. hosseinzadeh

iran, islamic republic of

abstract

the main aim of this paper intends to discuss the solution of fuzzy sylvester matrix equation

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

ABS METHOD FOR SOLVING FUZZY SYLVESTER MATRIX EQUATION

The main aim of this paper intends to discuss the solution of fuzzy Sylvester matrix equation  

full text

ABS Method for Solving 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 algorithms called Huang algorithm. At first, we transform this system to an (mn)×(mn) fuzzy system of linear equatio...

full text

Global conjugate gradient method for solving large general Sylvester matrix equation

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 present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

full text

On the solving of matrix equation of Sylvester type

A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...

full text

global conjugate gradient method for solving large general sylvester matrix equation

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 present a global conjugate gradient (gl-cg) algo- rithm for solving linear system of equations with multiple right-han...

full text

Solving LR fuzzy linear matrix equation†

In this paper, the fuzzy matrix equation $Awidetilde{X}B=widetilde{C}$ in which $A,B$ are $n times n$crisp matrices respectively and $widetilde{C}$ is an $n times n$ arbitrary LR fuzzy numbers matrix, is investigated. A new numerical procedure for calculating the fuzzy solution is designed and a sufficient condition for the existence of strong fuzzy solution is derived. Some examples are ...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of mathematical modelling and computations

جلد ۲، شماره ۳ (SUMMER)، صفحات ۲۳۱-۲۳۷

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023