Abstract
In paper a general complex fuzzy matrix equation
Introduction
There are lots of imprecisions in the real-world engineering systems. Fuzzy mathematics is one of powerful tools for modeling and dealing them. In many linear systems, some of the system parameters are vague or imprecise, and fuzzy number is a better expression than crisp one for handling the problem, and hence solving a linear system involved with fuzzy numbers is becoming more important. The fuzzy numbers and their arithmetic operations were firstly introduced and investigated by Zadeh [32], Dubois and Prade [15] and Nahmias [25]. A different approach to fuzzy numbers and the structure of fuzzy number spaces was given by Puri and Ralescu [27], Goetschell and Voxman [17] and Wu and Ma Ming [30, 31].
Since Friedman et al. [16] proposed a general model for solving an n × n fuzzy linear systems
Although fuzzy matrix equation has a wide use in control theory and control engineering, few work has been done in the past. In 2009, Allahviranloo et al. [6] firstly discussed the fuzzy linear matrix equations (FLME) of the form
In general, the uncertain elements of fuzzy linear systems were denoted by the parametric form of fuzzy numbers and the systems were extended into a crisp function linear systems. Thus it may lead to two defects. The one is that the extended linear equations always contains parameter r, 0 ≤ r ≤ 1, which makes their computation inconvenient in some sense. The other is that sometimes the weak fuzzy solution of fuzzy linear systems does not exist [5]. To overcome above two defects and handle the full fuzzy linear systems (FFLS), D. Dubois and H. Prade [15] introduced the LR fuzzy number. In 2006, Dehgham et al. [14] discussed computational methods for fully fuzzy linear systems
Preliminaries
There are several definitions for the concept of fuzzy numbers (see [15, 25, 32, 34]).
The fuzzy number
u is upper semicontinuous, u is fuzzy convex, i.e., u (λx + (1 - λ) y) ≥ min {u (x), u (y)} for all x, y ∈ R, λ ∈ [0, 1], u is normal, i.e., there exists x0 ∈ R such that u (x0) =1, suppu = {x ∈ R ∣ u (x) >0} is the support of the u, and its closure cl(suppu) is compact.
Let E1 be the set of all fuzzy numbers on R.
L (x) = L (- x), L (0) =1 and L (1) =0, L (x) is non increasing on [0, ∞).
The definition of a right shape function R (·) is similar to that of L (·).
Addition
Subtraction
Scalar multiplication
Fuzzy matrix equations
Using matrix notation, we have
A fuzzy numbers matrix
Equivalent fuzzy matrix system
Since
Comparing with the coefficient of i, we have
Expressing (3.3) in matrix form, we have
In order to solve the complex fuzzy linear system (2.2), we need to solve the fuzzy matrix Equations (3.1).
Addition
Subtraction
Scalar multiplication
if
if
For fuzzy matrix equation
Since
So the Equations (3.2) be rewritten is
Thus we get
To solve complex fuzzy matrix Equations (2.2), we need to consider the fuzzy matrix systems (3.1). In order to solve the Equations (3.1), we need to consider the matrix system (3.4). By Theorem 3.4., we obtain the minimal solution of the function system (3.4) as
From the Equations (3.1), we know
Thus we get the minimal solution of fuzzy matrix Equation (3.1) is
Since complex fuzzy matrix Equation (2.2) is equivalent to the fuzzy matrix Equation (3.1), we obtain the solution of the original fuzzy system (2.2) is as follows:
It seems that we have obtained the complex fuzzy solution as the above expression (3.12). However, the solution matrices
So we give the definition of complex LR fuzzy solution to the Equation (2.2) as follows:
If (X, X
l
, X
r
) is the minimal solution of Equations (3.5) such that X
l
≥ O, X
r
≥ O, we call
To illustrate the expression (3.10) to be a fuzzy solution matrix, we now discuss the generalized inverses of non negative matrix
Then the matrix
The key point to make the solution matrix be a strong LR fuzzy solution is that
Let
We know the condition that S† ≥ 0 is equivalent to E ≥ 0 and F ≥ 0.
Now that E ≥ O and F ≥ O, the product of two non negative matrices
The following Theorems give some results for such S-1 and S† to be nonnegative. As usual, (.) ⊤ denotes the transpose of a matrix (.).
S† ≥ 0. There exists a permutation matrix P, such that PS has the form
Denoting C = G + iH where
By Theorem 3.2., the above fuzzy matrix equation is extended into the following function linear system
From the Equations (3.10), we obtain the minimal solution of fuzzy matrix Equation (3.5) is
It means
Since
Denoting
By the same way, we obtain the minimal solution of fuzzy matrix Equation (3.5) is
It means
Since
Conclusion
In this work we introduced the complex LR fuzzy matrix equation
