Approximate solution of dual fuzzy matrix equations

2014 ◽  
Vol 266 ◽  
pp. 112-133 ◽  
Author(s):  
Zengtai Gong ◽  
Xiaobin Guo ◽  
Kun Liu
2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Xiaobin Guo ◽  
Dequan Shang

The fuzzy matrix equationsA~⊗X~⊗B~=C~in whichA~,B~, andC~arem×m,n×n, andm×nnonnegative LR fuzzy numbers matrices, respectively, are investigated. The fuzzy matrix systems is extended into three crisp systems of linear matrix equations according to arithmetic operations of LR fuzzy numbers. Based on pseudoinverse of matrix, the fuzzy approximate solution of original fuzzy systems is obtained by solving the crisp linear matrix systems. In addition, the existence condition of nonnegative fuzzy solution is discussed. Two examples are calculated to illustrate the proposed method.


2017 ◽  
Vol 418-419 ◽  
pp. 184-185 ◽  
Author(s):  
Jeevan Jot Kaur ◽  
Amit Kumar

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Xiaobin Guo ◽  
Lijuan Wu

In this paper, the inconsistent LR fuzzy matrix equation A X ˜ = B ˜ is proposed and discussed. Firstly, the LR fuzzy matrix equation is transformed into two crisp matrix equations in which one determines the mean value and the other determines the left and right extends of fuzzy approximate solution. Secondly, the approximate solution of the LR fuzzy matrix equation is obtained by solving two crisp matrix equations according to the generalized inverse of crisp matrix theory. Then, sufficient conditions for the existence of strong LR fuzzy approximate solution are given. Finally, some numerical examples are given to illustrate our proposed method.


2012 ◽  
Vol 36 (12) ◽  
pp. 6114-6121 ◽  
Author(s):  
Mahmood Otadi ◽  
Maryam Mosleh

2017 ◽  
Vol 22 (7) ◽  
pp. 2095-2103 ◽  
Author(s):  
M. Amirfakhrian ◽  
M. Fallah ◽  
R. Rodríguez-López

2022 ◽  
Vol 7 (4) ◽  
pp. 5386-5407
Author(s):  
Kanjanaporn Tansri ◽  
◽  
Sarawanee Choomklang ◽  
Pattrawut Chansangiam

<abstract><p>We develop an effective algorithm to find a well-approximate solution of a generalized Sylvester-transpose matrix equation where all coefficient matrices and an unknown matrix are rectangular. The algorithm aims to construct a finite sequence of approximated solutions from any given initial matrix. It turns out that the associated residual matrices are orthogonal, and thus, the desire solution comes out in the final step with a satisfactory error. We provide numerical experiments to show the capability and performance of the algorithm.</p></abstract>


Sign in / Sign up

Export Citation Format

Share Document