Two-Stage Algorithm for Solving Arbitrary Trapezoidal Fully Fuzzy Sylvester Matrix Equations

被引:5
|
作者
Elsayed, Ahmed Abdel Aziz [1 ,2 ]
Saassouh, Bassem [3 ]
Ahmad, Nazihah [2 ]
Malkawi, Ghassan [4 ]
机构
[1] Inst Appl Technol, Dept Math, Mohamed Bin Zayed City 33884, U Arab Emirates
[2] Univ Utara Malaysia, Sch Quantitat Sci, Sintok 06010, Kedah, Malaysia
[3] Abu Dhabi Polytech Coll, Acad Support Dept, Abu Dhabi 111499, U Arab Emirates
[4] Higher Coll Technol HCT, Fac Engn, Math & Nat Sci Div, Al Ain Campus, Abu Dhabi 17155, U Arab Emirates
来源
SYMMETRY-BASEL | 2022年 / 14卷 / 03期
关键词
fully fuzzy sylvester matrix equations; fuzzy matrix equation; numerical fuzzy solution; trapezoidal fuzzy multiplication; RELATIONAL EQUATIONS; OPTIMIZATION; RESOLUTION; SYSTEM;
D O I
10.3390/sym14030446
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Sylvester Matrix Equations (SME) play a central role in applied mathematics, particularly in systems and control theory. A fuzzy theory is normally applied to represent the uncertainty of real problems where the classical SME is extended to Fully Fuzzy Sylvester Matrix Equation (FFSME). The existing analytical methods for solving FFSME are based on Vec-operator and Kronecker product. Nevertheless, these methods are only applicable for nonnegative fuzzy numbers, which limits the applications of the existing methods. Thus, this paper proposes a new numerical method for solving arbitrary Trapezoidal FFSME (TrFFSME), which includes near-zero trapezoidal fuzzy numbers to overcome this limitation. The TrFFSME is converted to a system of non-linear equations based on newly developed arithmetic fuzzy multiplication operations. Then the non-linear system is solved using a newly developed two-stage algorithm. In the first stage algorithm, initial values are determined. Subsequently, the second stage algorithm obtains all possible finite fuzzy solutions. A numerical example is solved to illustrate the proposed method. Besides, this proposed method can solve other forms of fuzzy matrix equations and produces finite fuzzy and non-fuzzy solutions compared to the existing methods.
引用
收藏
页数:24
相关论文
共 50 条
  • [41] A modified gradient based algorithm for solving Sylvester equations
    Wang, Xiang
    Dai, Lin
    Liao, Dan
    APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (09) : 5620 - 5628
  • [42] Study on fuzzy clustering based on two-stage algorithm
    Huang, Li-min
    Wu, Xiao-jun
    Wang, Shi-tong
    Huadong Chuanbo Gongye Xueyuan Xuebao/Journal of East China Shipbuilding Institute, 2000, 14 (02): : 74 - 77
  • [43] Two-stage learning algorithm for fuzzy cognitive maps
    Papageorgiou, EI
    Groumpos, PP
    2004 2ND INTERNATIONAL IEEE CONFERENCE INTELLIGENT SYSTEMS, VOLS 1 AND 2, PROCEEDINGS, 2004, : 82 - 87
  • [44] A Preliminary Study on the Solution of Fully Fuzzy Sylvester Matrix Equation
    Daud, Wan Suhana Wan
    Ahmad, Nazihah
    Malkawi, Ghassan
    INTERNATIONAL CONFERENCE ON MATHEMATICS, ENGINEERING AND INDUSTRIAL APPLICATIONS 2016 (ICOMEIA2016), 2016, 1775
  • [45] Approximate Solution of LR Fuzzy Sylvester Matrix Equations
    Guo, Xiaobin
    Shang, Dequan
    JOURNAL OF APPLIED MATHEMATICS, 2013,
  • [47] A modified gradient-based algorithm for solving extended Sylvester-conjugate matrix equations
    Ramadan, Mohamed A.
    Bayoumi, Ahmed M. E.
    ASIAN JOURNAL OF CONTROL, 2018, 20 (01) : 228 - 235
  • [48] Solving symmetric fully fuzzy linear systems with trapezoidal fuzzy number matrices
    Jayanth Karthik, N.
    Chandrasekaran, E.
    Sattanathan, R.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2015, 92 : 265 - 274
  • [49] A New Two-Stage Algorithm for Solving Power Flow Tracing
    Maleksaeedi, Iman
    Khiav, Behzad Esazadeh
    Germi, Masoud Bakhshi
    Ghadimi, Noradin
    COMPLEXITY, 2015, 21 (01) : 187 - 194
  • [50] On global Hessenberg based methods for solving Sylvester matrix equations
    Heyouni, Mohammed
    Saberi-Movahed, Farid
    Tajaddini, Azita
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2019, 77 (01) : 77 - 92