Arbitrary Generalized Trapezoidal Fully Fuzzy Sylvester Matrix Equation

Arbitrary Generalized Trapezoidal Fully Fuzzy Sylvester Matrix Equation

Ahmed AbdelAziz Elsayed, Nazihah Ahmad, Ghassan Malkawi
Copyright: © 2022 |Pages: 22
DOI: 10.4018/IJFSA.303564
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In the fuzzy literature, researchers have applied the concept of Vec-operator and Kronecker product for solving arbitrary Fuzzy Matrix Equations (FME). However, this approach is limited to positive or negative FMEs and cannot be applied to FMEs with near-zero fuzzy numbers. Therefore, this paper proposes a new analytical method for solving a family of arbitrary FMEs. The proposed method is able to solve Arbitrary Generalized Trapezoidal Fully Fuzzy Sylvester Matrix Equations (AGTrFFSME), in addition to many unrestricted FMEs such as Sylvester, Lyapunov and Stein fully fuzzy matrix equations with arbitrary triangular or trapezoidal fuzzy numbers. The proposed method thus fruitfully removes the sign restriction imposed by researchers and is, therefore, better to use in several engineering and scientific applications. The AGTrFFSME is converted to a system of non-linear equations, which is reduced using new multiplication operations between trapezoidal fuzzy numbers. The feasibility conditions are introduced to distinguish between fuzzy and non-fuzzy solutions to the AGTrFFSME.
Article Preview
Top

1. Introduction

Many real problems in control systems are related to the solvability of the Generalized Sylvester Matrix Equation (GSME) in the form IJFSA.303564.m01, either using analytical or numerical methods. The GSME has important applications in the design and analysis of linear control systems (Datta, 2004), observer design (Tsui, 1988), reduction of large-scale dynamical systems (Van Dooren, 2000), restoration of noisy images (Bouhamidi & Jbilou, 2007; Calvetti & Reichel, 1996), medical imaging data acquisition and filtering (Bouhamidi & Jbilou, 2007). Researchers for many years have proposed many analytical and numerical methods for solving the GSME with crisp numbers (Dehghan & Shirilord, 2019; Ding et al., 2008; Sasaki & Chansangiam, 2020). However, in many applications, the classical GSME is not well equipped to handle uncertainty in real-life problems such as conflicting requirements during the system process, the distraction of any elements and noise. Therefore, the crisp numbers need to be replaced by fuzzy numbers. Lukasiewicz and Tarski (1920) studied the fuzzy logic as infinite valued logic, and Lotfi Zadeh (1965) introduced the fuzzy set theory and Fuzzy Relation Equations (FREs) with the max-min composition were introduced by Sanchez (1976). Solving FREs has become one of the most extensively studied problems in fuzzy sets and fuzzy logic (De Baets, 2000) (di Nola et al., 1989). In addition to the FREs, many researchers considered different types of fuzzy intervals (Yu et al., 2021)(Li et al., 2020) (Li & Liu, 2014) and different types of fuzzy numbers such as Triangular Fuzzy Numbers (TFNs) (Liang & Li, 2019) (Ye & Li, 2020), and Trapezoidal Fuzzy Numbers (TrFNs) (Vijayalakshmi & Sattanathan, 2011)(Bansal, 2011; Vahidi & Rezvani, 2013).

When all parameters of the GSME are in fuzzy form, it is called a Generalized Fully Fuzzy Sylvester Matrix Equation (GFFSME).

  • Definition 1.1 The fully fuzzy matrix equation that can be written as

  • IJFSA.303564.m02 (1.1)

where, IJFSA.303564.m03, IJFSA.303564.m04, IJFSA.303564.m05, IJFSA.303564.m06, IJFSA.303564.m07 and IJFSA.303564.m08 is called GFFSME.

Complete Article List

Search this Journal:
Reset
Volume 13: 1 Issue (2024)
Volume 12: 1 Issue (2023)
Volume 11: 4 Issues (2022)
Volume 10: 4 Issues (2021)
Volume 9: 4 Issues (2020)
Volume 8: 4 Issues (2019)
Volume 7: 4 Issues (2018)
Volume 6: 4 Issues (2017)
Volume 5: 4 Issues (2016)
Volume 4: 4 Issues (2015)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing