Next Article in Journal
Negative Feedback Punishment Approach Helps Sanctioning Institutions Achieve Stable, Time-Saving and Low-Cost Performances
Previous Article in Journal
Mathematical Model of Hepatitis B Virus Treatment with Support of Immune System
Previous Article in Special Issue
Evaluating Pallet Investment Strategy Using Fuzzy Analytic Network Process: A Case in Chinese Chain Supermarkets
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Fuzzy Complex Linear Systems Based on a New Representation of Fuzzy Complex Numbers

1
School of Mathematics and Statistics, Longdong University, Qingyang 745000, China
2
College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730000, China
*
Authors to whom correspondence should be addressed.
Mathematics 2022, 10(15), 2822; https://doi.org/10.3390/math10152822
Submission received: 22 July 2022 / Revised: 5 August 2022 / Accepted: 6 August 2022 / Published: 8 August 2022
(This article belongs to the Special Issue Fuzzy Group Decision Making)

Abstract

:
Since the product of complex numbers and rectangular fuzzy complex numbers (RFCN) is not necessarily a RFCN in the former fuzzy complex linear system (FCLS), the scalar multiplication and addition operations of complex numbers and fuzzy complex numbers (FCN) based on a new representation of FCN are proposed. We also introduce a new method for solving FCLS, which can convert FCLS into two distinct linear systems. One is an n × n complex linear system, and the other is an ( m n ) × ( m n ) real linear system, where n is the number of unknown variables, and m is the number of substitutional cyclic sets composed of coefficients of FCLS. In particular, using this method to solve one-dimensional fuzzy linear systems, a ( 2 n ) × ( 2 n ) RLS is obtained, which is consistent with Friedman’s method. Finally, FCLS based on the RFCN as a special case are also investigated.

1. Introduction

In 1989, the concept of FCN was first proposed by Buckley [1]. The basic arithmetic operations, algebraic and exponential forms of FCN, and a distance on the space of FCN were defined and studied. Subsequently, the derivative of fuzzy complex-valued functions (FCVF) was further generalized and developed [2] based on the concept of derivatives of real fuzzy mapping proposed by Dubois and Prade [3,4]. At the same time, the contour integral of FCVF on the complex plane was given [5]. In 1999, Wu and Qiu [6] improved the results in [1], which were different from those defined in [2,5], and introduced the derivatives and integrals of functions that map complex numbers to generalized FCN. In 2000, Qiu et al. studied the sequences and series of FCN and their convergence [7]. In 2001, Qiu et al. considered the continuity and differentiability of functions that map complex numbers to FCN or FCN to complex numbers [8].
In the process of mathematical modeling involving some practical problems, such as optimization problems, often due to measurement error and incomplete information, there will be some uncertain parameters and variables that can be expressed as a fuzzy number. Therefore, the linear system modeled by fuzzy numbers has many potential applications in actual production and life. In 1998, Friedman et al. proposed a method to solve the fuzzy linear system (FLS) n × n [9] by using the embedding method given in [10] and replacing the original FLS n × n with a crisp function linear system ( 2 n ) × ( 2 n ) . Based on this method, some researchers have proposed various methods for solving FLS [11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33].
As far as we know, the research results of FCLS are relatively few. In 2009, Rahgooy et al. considered the solution of FCLS and applied it to the circuit analysis problem [34]. In 2010, Jahantigh et al. proposed a numerical procedure for FCLS [35]. In 2012, Behera and Chakraverty introduced a new and simple centre- and width-based method for solving FCLS [36]. Hladik and Djanybekov also investigated a solution of the complex interval linear systems (FILS) [37,38]. It is worth noting that a new and simple method for solving the general FCLS was proposed by Behera and Chakraverty [39,40].
Although Behera and Chakraverty have defined the scalar multiplication of complex number and FCN [39], just as Buckley pointed out in [1] that the product of two RFCN is not necessarily a RFCN, in fact, the scalar multiplication of complex numbers and RFCN is not necessarily a RFCN either. For example, let z ˜ = a ˜ + i b ˜ be a RFCN defined by the membership function
z ˜ ( z ) = 1 , ( x , y ) [ 1 , 1 ] × [ 1 , 1 ] , 0 , otherwise ,
where z = x + i y and a ˜ , b ˜ are fuzzy numbers defined by the membership functions
a ˜ ( x ) = 1 , x [ 1 , 1 ] , 0 , otherwise , b ˜ ( y ) = 1 , y [ 1 , 1 ] , 0 , otherwise ,
respectively. It is easy to verify that w z ˜ is not an RFCN by the extension principle, where w = 2 2 ( 1 + i ) . In fact,
w z ˜ ( z ) = 1 , ( x , y ) [ 1 , 0 ] × [ ( x + 2 ) , x + 2 ] [ 0 , 1 ] × [ x 2 , 2 x ] , 0 , otherwise ,
which does not write the form of a ˜ + i b ˜ . Therefore, the left and right sides of FCLS may not be equal in [39]. For the above reason, based on the new representation and operation of FCN, we propose a new method to solve FCLS, which can convert the FCLS into two distinct linear systems. One is a complex linear system n × n , and the other is an RLS ( m n ) × ( m n ) . Finally, FCLS based on RFCN as a special case is also investigated.
The structure of this paper is as follows. Section 2 provides background notions related to FCN. In Section 3, a new representation and the arithmetic operations of FCN are provided. In Section 4, a new method for solving FCLS is proposed, and Section 5 studies a system of functional equations with period 2 π . A especial case of FCLS is considered in Section 6. Section 7 presents our conclusions.

2. Background

A fuzzy set u ˜ is a mapping from R to [ 0 , 1 ] defined by the function u ˜ ( x ) . Let [ u ˜ ] r = { x | u ˜ ( x ) r } for r ( 0 , 1 ] and [ u ˜ ] 0 = { x | u ˜ ( x ) > 0 } ¯ . A fuzzy set u ˜ is a fuzzy number if u ˜ is a normal, convex fuzzy set that is upper semi-continuous, and supp u ˜ = { x | u ˜ ( x ) > 0 } ¯ is compact.
We denote a complex number by z = x + i y , and denote the complex plane by C . A fuzzy complex set z ˜ is a mapping from C to [ 0 , 1 ] defined by the function z ˜ ( z ) . Let [ z ˜ ] r = { z | z ˜ ( z ) r } for r ( 0 , 1 ] , [ z ˜ ] 0 = 0 < r 1 [ z ˜ ] r [1,7].
Definition 1
([7]). A fuzzy complex set z ˜ is called an FCN if the following conditions are satisfied:
( 1 ) z ˜ is a upper semi-continuous function;
( 2 ) [ z ˜ ] r is a compact set for 0 r 1 ;
( 3 ) z ˜ is normal, i.e., there exists a z 0 such that z ˜ ( z 0 ) = 1 ;
( 4 ) z ˜ is a fuzzy convex set, i.e., z ˜ ( λ z 1 + ( 1 λ ) z 2 ) min { z ˜ ( z 1 ) , z ˜ ( z 2 ) } for all z 1 , z 2 C , λ [ 0 , 1 ] .
We use z ˜ , w ˜ for FCN and x ˜ , y ˜ , u ˜ , v ˜ for fuzzy numbers. Let C ˜ be the set of FCN. If f ( z 1 , z 2 ) = w is a mapping from C × C into C , we may define a mapping f ( z ˜ 1 , z ˜ 2 ) = w ˜ from C ˜ × C ˜ into C ˜ by the extension principle as [1]
w ˜ ( w ) = sup { min ( z ˜ 1 ( z 1 ) , z ˜ 2 ( z 2 ) ) | f ( z 1 , z 2 ) = w } .
Let f ( z 1 , z 2 ) = z 1 + z 2 or f ( z 1 , z 2 ) = z 1 z 2 ; then we may define the sum or multiplication of two FCN by w ˜ = z ˜ 1 + z ˜ 2 or w ˜ = z ˜ 1 z ˜ 2 . We also define the subtraction of two FCN by
z ˜ 1 z ˜ 2 = z ˜ 1 + ( z ˜ 2 ) ,
where
z 2 ˜ ( z ) = z 2 ˜ ( z ) .
The sum and multiplication of FCN satisfy following properties:
[ z ˜ 1 + z ˜ 2 ] α = [ z ˜ 1 ] α + [ z ˜ 2 ] α , [ z ˜ 1 z ˜ 2 ] α = [ z ˜ 1 ] α [ z ˜ 2 ] α .
A FCN is called a trivial zero fuzzy number (TZFN) if [ z ˜ ] 0 = { 0 } . A FCN is called a nontrivial zero fuzzy number (NTZFN) if 0 [ z ˜ ] 1 and [ z ˜ ] 0 { 0 } .

3. A New Representation of FCN

In this section, a new representation of FCN is given, and the scalar multiplication and addition operations of complex numbers and FCN based on the representation of FCN are proposed.
Theorem 1
([41]). Let o ˜ be a NTZFN of complex plane. Then
o ˜ = φ [ 0 , 2 π ] R ˜ ( φ ) e i φ ,
where R ˜ ( φ ) = r [ 0 , 1 ] r * [ 0 , ρ ( r , φ ) ] is a fuzzy number for all φ [ 0 , 2 π ] .
We give a definition of FCN based on the above representation theorem of NTZFN.
Definition 2
([41]). If z ˜ is a FCN, then
z ˜ = z ^ + φ [ 0 , 2 π ] R ˜ ( φ ) e i φ ,
where [ z ^ ] r = { z = x 0 + i y 0 } , for all r [ 0 , 1 ] ,
x 0 = [ z ˜ ] 1 x d x d y [ z ˜ ] 1 d x d y , y 0 = [ z ˜ ] 1 y d x d y [ z ˜ ] 1 d x d y ,
φ [ 0 , 2 π ] R ˜ ( φ ) e i φ is the new representation of NTZFN z ˜ z ^ .
For simplicity, FCN z ˜ = z ^ + φ [ 0 , 2 π ] R ˜ ( φ ) e i φ is written as z ˜ = z + φ [ 0 , 2 π ] R ˜ ( φ ) e i φ . FCN z ˜ = z + φ [ 0 , 2 π ] R ˜ ( φ ) e i φ can also be written as z ˜ = z + φ [ 0 , 2 π ] R ˜ ( φ + k π 2 ) e i ( φ + k π 2 ) , k Z + .
Theorem 2
([41]). Let z ˜ = r e i θ + φ [ 0 , 2 π ] R ˜ ( φ ) e i φ , z = r e i θ C , k R . Then
( 1 ) z z ˜ = r e i θ r e i θ + φ [ 0 , 2 π ] R ˜ ( φ ) e i φ = r r e i ( θ + θ ) + φ [ 0 , 2 π ] r R ˜ ( φ ) e i ( θ + φ ) .
( 2 ) k z ˜ = ( k r ) e i θ + φ [ 0 , 2 π ] k R ˜ ( φ ) e i φ , k 0 , ( k r ) e i ( θ + π ) + φ [ 0 , 2 π ] ( k ) R ˜ ( φ ) e i ( φ + π ) , k < 0 .
Definition 3
([41]). Let
z ˜ 1 = a 1 + i b 1 + φ [ 0 , 2 π ] R ˜ 1 ( φ ) e i φ , z ˜ 2 = a 2 + i b 2 + φ [ 0 , 2 π ] R ˜ 2 ( φ ) e i φ .
If
w ˜ = ( a 1 + a 2 ) + i ( b 1 + b 2 ) + φ [ 0 , 2 π ] ( R ˜ 1 ( φ ) + R ˜ 2 ( φ ) ) e i φ
is a FCN, then w ˜ is called the strong sum of two FCN z ˜ 1 and z ˜ 2 , which is denoted by z ˜ 1 z ˜ 2 .
The strong sum and the sum of two FCN are equivalent when the condition of Corollary 5.4 is satisfied in [41].
For simplicity, we also write FCN z ˜ = z ^ + φ [ 0 , 2 π ] R ˜ ( φ ) e i φ as z ˜ = z + R ˜ ( φ ) e i φ , φ [ 0 , 2 π ] , the scalar multiplication and the strong sum of FCN as
z z ˜ = z z + r R ˜ ( φ ) e i ( θ + φ ) , φ [ 0 , 2 π ] ,
k z ˜ = k z + k R ˜ ( φ ) e i φ , φ [ 0 , 2 π ] , k 0 , k z + ( k ) R ˜ ( φ ) e i ( φ + π ) , φ [ 0 , 2 π ] , k < 0 ,
z ˜ 1 + z ˜ 2 = z 1 + z 2 + ( R ˜ 1 ( φ ) + R ˜ 2 ( φ ) ) e i φ , φ [ 0 , 2 π ]
respectively, where z = r e i θ is a complex number.
It is worth noting that since FCN can be regarded as a generalization of one-dimensional fuzzy numbers, we can similarly represent one-dimensional fuzzy numbers and define the operations of one-dimensional fuzzy numbers; see reference [42].

4. FCLS

The n × n FCLS is written as
c 11 z ˜ 1 + c 12 z ˜ 2 + + c 1 n z ˜ n = w ˜ 1 , c 21 z ˜ 1 + c 22 z ˜ 2 + + c 2 n z ˜ n = w ˜ 2 c n 1 z ˜ 1 + c n 2 z ˜ 2 + + c n n z ˜ n = w ˜ n .
We may write the above as
C Z ˜ = W ˜ ,
where C = ( c j k ) n × n is a crisp n × n complex matrix, W ˜ = ( w ˜ 1 , w ˜ 2 , , w ˜ n ) T is a column vector of known FCN, and Z ˜ = ( z ˜ 1 , z ˜ 2 , , z ˜ n ) T is the vector of unknown FCN.
System ( 1 ) may be also written as
j = 1 n c k j z ˜ j = w ˜ k ,
where k = 1 , 2 , , n . Let c k j = r k j c e i θ k j c , w ˜ k = w k + R ˜ k w e i φ , z ˜ k = z k + R ˜ k z e i φ , φ [ 0 , 2 π ] , where w k , z k are some complex numbers, R ˜ k w = R ˜ k w ( φ ) , R ˜ k z = R ˜ k z ( φ ) are some fuzzy numbers, and i is an imaginary unit. By ( 3 ) , we obtain the system
j = 1 n ( c k j z j + c k j R ˜ j z e i φ ) = w k + R ˜ k w e i φ ,
i.e.,
j = 1 n ( c k j z j + r k j c R ˜ j z e i ( φ + θ k j c ) ) = w k + R ˜ k w e i φ ,
where k = 1 , 2 , , n . The above system is written as
j = 1 n c k j z j = w k ,
and
j = 1 n r k j c R ˜ j z e i ( φ + θ k j c ) = R ˜ k w e i φ ,
where k = 1 , 2 , , n , and ( 4 ) is a complex linear system, which may be denoted by
C Z = W ,
where Z = ( z 1 , z 2 , , z n ) T , W = ( w 1 , w 2 , , w n ) T . System ( 5 ) is written as
j = 1 n r k j c R ˜ j z ( φ θ k j c ) e i φ = R ˜ k w e i φ ,
i.e.,
j = 1 n r k j c R ˜ j z ( φ θ k j c ) = R ˜ k w ( φ ) ,
where k = 1 , 2 , , n , and r k j c are some positive real numbers for every φ , R ˜ k w ( φ ) are some known fuzzy numbers known and R ˜ k z ( φ ) are some unknown fuzzy numbers.
Let
[ R ˜ k w ] r = [ R ˜ k w ( φ ) ] r = [ 0 , b k ( r , φ ) ] ,
[ R ˜ k z ] r = [ R ˜ k z ( φ ) ] r = [ 0 , ρ k ( r , φ ) ] ,
b k ( φ ) = b k ( r , φ ) , ρ k ( φ ) = ρ k ( r , φ ) .
Then, System ( 7 ) can be equivalently written as the following system
j = 1 n r k j c ρ j ( φ θ k j c ) = b k ( φ ) ,
where k = 1 , 2 , , n , and ρ i ( φ ) are some unknown functions with period 2 π , and b i ( φ ) are some known functions with period 2 π .
We obtain the following theorem by the above discussion.
Theorem 3.
A vector Z ˜ = ( z ˜ 1 , z ˜ 2 , , z ˜ n ) T is a solution (a unique solution) of Equation ( 2 ) if and only if the vectors Z = ( z 1 , z 2 , , z n ) T ,   U ρ = ( ρ 1 ( φ ) , ρ 2 ( φ ) , , , ρ n ( φ ) ) T are solutions (two unique solutions) of Equation ( 6 ) and System ( 8 ) , respectively, and
[ z ˜ k ] r = z k + φ [ 0 , 2 π ] [ 0 , ρ k ( φ ) ] e i φ .
Example 1.
Consider the 3 × 3 FCLS
( 1 + i ) z ˜ 1 + z ˜ 2 + i z ˜ 3 = w ˜ 1 , 3 z ˜ 1 + ( 1 i ) z ˜ 2 + z ˜ 3 = w ˜ 2 , z ˜ 1 i z ˜ 2 ( 1 + i ) z ˜ 3 = w ˜ 3 ,
where
w ˜ 1 = 3 + 2 i + R ˜ 1 w ( φ ) e i φ , [ R ˜ 1 w ( φ ) ] r = [ 0 , ( 2 + 2 2 + | sin φ | ) ( 1 r ) ] ,
w ˜ 2 = 5 i + R ˜ 2 w ( φ ) e i φ , [ R ˜ 2 w ( φ ) ] r = [ 0 , ( 7 + 2 + 2 | sin ( φ + π 4 ) | ) ( 1 r ) ] ,
w ˜ 3 = 1 + R ˜ 3 w ( φ ) e i φ , [ R ˜ 3 w ( φ ) ] r = [ 0 , ( 3 + 2 2 + | cos φ | ) ( 1 r ) ] .
Let
z ˜ k = z k + R ˜ k z e i φ , [ R ˜ k z ] r = [ R ˜ k z ( φ ) ] r = [ 0 , ρ k ( r , φ ) ] , ρ k ( φ ) = ρ k ( r , φ ) , k = 1 , 2 , 3 .
Equation ( 9 ) is written as
( 1 + i ) ( z 1 + R ˜ 1 z ( φ ) e i φ ) + ( z 2 + R ˜ 2 z ( φ ) e i φ ) + i ( z 3 + R ˜ 3 z ( φ ) e i φ ) = 3 + 2 i + R ˜ 1 w ( φ ) e i φ , 3 ( z 1 + R ˜ 1 z ( φ ) e i φ ) + ( 1 i ) ( z 2 + R ˜ 2 z ( φ ) e i φ ) + ( z 3 + R ˜ 3 z ( φ ) e i φ ) = 5 i + R ˜ 2 w ( φ ) e i φ , ( z 1 + R ˜ 1 z ( φ ) e i φ ) i ( z 2 + R ˜ 2 z ( φ ) e i φ ) ( 1 + i ) ( z 3 + R ˜ 3 z ( φ ) e i φ ) = 1 + R ˜ 3 w ( φ ) e i φ .
Equation above is equivalent to
( 1 + i ) z 1 + z 2 + i z 3 = 3 + 2 i , 3 z 1 + ( 1 i ) z 2 + z 3 = 5 i z 1 i z 2 ( 1 + i ) z 3 = 1 ,
and
( 1 + i ) ( R ˜ 1 z ( φ ) e i φ ) + R ˜ 2 z ( φ ) e i φ + i ( R ˜ 3 z ( φ ) e i φ ) = R ˜ 1 w ( φ ) e i φ , 3 ( R ˜ 1 z ( φ ) e i φ ) + ( 1 i ) ( R ˜ 2 z ( φ ) e i φ ) + ( R ˜ 3 z ( φ ) e i φ ) = R ˜ 2 w ( φ ) e i φ , R ˜ 1 z ( φ ) e i φ i ( R ˜ 2 z ( φ ) e i φ ) ( 1 + i ) ( R ˜ 3 z ( φ ) e i φ ) = R ˜ 3 w ( φ ) e i φ .
The solution of Equation ( 10 ) is
z 1 = 1 , z 2 = 1 + i , z 3 = i .
Equation ( 11 ) is written as
( 2 e i π 4 ) ( R ˜ 1 z ( φ ) e i φ ) + R ˜ 2 z ( φ ) e i φ + e i π 2 ( R ˜ 3 z ( φ ) e i φ ) = R ˜ 1 w ( φ ) e i φ , 3 ( R ˜ 1 z ( φ ) e i φ ) + ( 2 e i ( π 4 ) ) ( R ˜ 2 z ( φ ) e i φ ) + R ˜ 3 z ( φ ) e i φ = R ˜ 2 w ( φ ) e i φ , R ˜ 1 z ( φ ) e i φ + e i ( π 2 ) ( R ˜ 2 z ( φ ) e i φ ) + ( 2 e i 5 π 4 ) ( R ˜ 3 z ( φ ) e i φ ) = R ˜ 3 w ( φ ) e i φ .
i.e.,
2 R ˜ 1 z ( φ ) e i ( φ + π 4 ) + R ˜ 2 z ( φ ) e i φ + R ˜ 3 z ( φ ) e i ( φ + π 2 ) = R ˜ 1 w ( φ ) e i φ , 3 R ˜ 1 z ( φ ) e i φ + 2 R ˜ 2 z ( φ ) e i ( φ π 4 ) + R ˜ 3 z ( φ ) e i φ = R ˜ 2 w ( φ ) e i φ , R ˜ 1 z ( φ ) e i φ + R ˜ 2 z ( φ ) e i ( φ π 2 ) + 2 R ˜ 3 z ( φ ) e i ( φ + 5 π 4 ) = R ˜ 3 w ( φ ) e i φ .
That is,
2 R ˜ 1 z ( φ π 4 ) e i φ + R ˜ 2 z ( φ ) e i φ + R ˜ 3 z ( φ π 2 ) e i φ = R ˜ 1 w ( φ ) e i φ , 3 R ˜ 1 z ( φ ) e i φ + 2 R ˜ 2 z ( φ + π 4 ) e i φ + R ˜ 3 z ( φ ) e i φ = R ˜ 2 w ( φ ) e i φ , R ˜ 1 z ( φ ) e i φ + R ˜ 2 z ( φ + π 2 ) e i φ + 2 R ˜ 3 z ( φ 5 π 4 ) e i φ = R ˜ 3 w ( φ ) e i φ .
It follows that
2 R ˜ 1 z ( φ π 4 ) + R ˜ 2 z ( φ ) + R ˜ 3 z ( φ π 2 ) = R ˜ 1 w ( φ ) , 3 R ˜ 1 z ( φ ) + 2 R ˜ 2 z ( φ + π 4 ) + R ˜ 3 z ( φ ) = R ˜ 2 w ( φ ) , R ˜ 1 z ( φ ) + R ˜ 2 z ( φ + π 2 ) + 2 R ˜ 3 z ( φ 5 π 4 ) = R ˜ 3 w ( φ ) .
i.e.,
2 ρ 1 ( φ π 4 ) + ρ 2 ( φ ) + ρ 3 ( φ π 2 ) = b 1 ( φ ) , 3 ρ 1 ( φ ) + 2 ρ 2 ( φ + π 4 ) + ρ 3 ( φ ) = b 2 ( φ ) , ρ 1 ( φ ) + ρ 2 ( φ + π 2 ) + 2 ρ 3 ( φ 5 π 4 ) = b 3 ( φ ) ,
where ρ i ( φ ) are three functions unknown with period 2 π , b i ( φ ) are three functions known with period 2 π , and
b 1 ( φ ) = ( 2 + 2 2 + | sin φ | ) ( 1 r ) ,
b 2 ( φ ) = ( 7 + 2 + 2 | sin ( φ + π 4 ) | ) ( 1 r ) ,
b 3 ( φ ) = ( 3 + 2 2 + | cos φ | ) ( 1 r ) .
It is to easy verify that
ρ 1 ( φ ) = 2 ( 1 r ) , ρ 2 ( φ ) = ( 1 + | sin φ | ) ( 1 r ) , ρ 3 ( φ ) = 1 r
are solutions of Equation ( 13 ) . From Theorem 3 and Equation ( 12 ) , we obtain
[ z ˜ 1 ] r = 1 + φ [ 0 , 2 π ] [ 0 , 2 ( 1 r ) ] e i φ ,
[ z ˜ 2 ] r = ( 1 + i ) + φ [ 0 , 2 π ] [ 0 , ( 1 + | sin φ | ) ( 1 r ) ] e i φ ,
[ z ˜ 3 ] r = ( i ) + φ [ 0 , 2 π ] [ 0 , ( 1 r ) ] e i φ .

5. System of Functional Equations with Period 2 π

Since System ( 8 ) is a system of functional equations with period 2 π that cannot be solved directly, we need to convert System ( 8 ) into a ( m n ) × ( m n ) RLS. First, we give the following three definitions.
Definition 4.
A set C = { φ θ 1 , φ θ 2 , , φ θ m } is said to be m-substitutional cyclic if for any φ θ i , φ θ j C , we have φ θ i θ j C .
Definition 5.
A m-substitutional cyclic set C is said to be generated by the set { φ θ 1 , φ θ 2 , , φ θ k } if { φ θ 1 , φ θ 2 , , φ θ k } C and for any m-substitution cyclic set D including the set { φ θ 1 , φ θ 2 , , φ θ k } satisfies C D , denoted by
C = < φ θ 1 , φ θ 2 , , φ θ k > .
Definition 6.
The system ( 8 ) is said to be m-substitutional cyclic if there exists a m-substitutional cyclic set C = { φ θ 1 , φ θ 2 , , φ θ m } such that
C = < φ θ 11 c , , φ θ 1 n c , φ θ 21 c , , φ θ 2 n c , φ θ n 1 c , , φ θ n n c > .
Obviously, we can get the following theorem by Definition 6 .
Theorem 4.
If System ( 8 ) is m-substitutional cyclic, then the vector
ρ 1 ( φ ) , ρ 2 ( φ ) , , ρ n ( φ ) T
is a solution of System ( 8 ) if only if
ρ 1 ( φ θ 1 ) , , ρ n ( φ θ 1 ) , ρ 1 ( φ θ 2 ) , , ρ n ( φ θ 2 ) , , ρ 1 ( φ θ m ) , , ρ n ( φ θ m ) T
is a solution of the following ( m n ) × ( m n ) system
j = 1 n r k j c ρ j ( φ θ 1 θ k j c ) = b k ( φ θ 1 ) , j = 1 n r k j c ρ j ( φ θ 2 θ k j c ) = b k ( φ θ 2 ) , j = 1 n r k j c ρ j ( φ θ m θ k j c ) = b k ( φ θ m ) ,
where k = 1 , 2 , , n , ρ i ( φ ) are some unknown functions with period 2 π , and b i ( φ ) are some functions known with period 2 π .
Example 2.
Since the m-substitutional cyclic set
C = { φ 5 π 4 , φ π , φ 3 π 4 , φ π 2 , φ π 4 , φ , φ + π 4 , φ + π 2 }       = < φ 5 π 4 , φ π 2 , φ π 4 , φ , φ + π 4 , φ + π 2 >
is in System ( 13 ) , we know that System ( 13 ) is m-substitutional cyclic, which is equivalent to the following system:
2 ρ 1 ( φ + π 2 ) + ρ 2 ( φ 5 π 4 ) + ρ 3 ( φ + π 4 ) = b 1 ( φ 5 π 4 ) , 3 ρ 1 ( φ 5 π 4 ) + 2 ρ 2 ( φ π ) + ρ 3 ( φ 5 π 4 ) = b 2 ( φ 5 π 4 ) , ρ 1 ( φ 5 π 4 ) + ρ 2 ( φ 3 π 4 ) + 2 ρ 3 ( φ π 2 ) = b 3 ( φ 5 π 4 ) , 2 ρ 1 ( φ 5 π 4 ) + ρ 2 ( φ π ) + ρ 3 ( φ + π 2 ) = b 1 ( φ π ) , 3 ρ 1 ( φ π ) + 2 ρ 2 ( φ 3 π 4 ) + ρ 3 ( φ π ) = b 2 ( φ π ) , ρ 1 ( φ π ) + ρ 2 ( φ π 2 ) + 2 ρ 3 ( φ π 4 ) = b 3 ( φ π ) , 2 ρ 1 ( φ π ) + ρ 2 ( φ 3 π 4 ) + ρ 3 ( φ 5 π 4 ) = b 1 ( φ 3 π 4 ) , 3 ρ 1 ( φ 3 π 4 ) + 2 ρ 2 ( φ π 2 ) + ρ 3 ( φ 3 π 4 ) = b 3 ( φ 3 π 4 ) , ρ 1 ( φ 3 π 4 ) + ρ 2 ( φ π 4 ) + 2 ρ 3 ( φ ) = b 3 ( φ 3 π 4 ) , 2 ρ 1 ( φ 3 π 4 ) + ρ 2 ( φ π 2 ) + ρ 3 ( φ π ) = b 1 ( φ π 2 ) , 3 ρ 1 ( φ π 2 ) + 2 ρ 2 ( φ π 4 ) + ρ 3 ( φ π 2 ) = b 2 ( φ π 2 ) , ρ 1 ( φ π 2 ) + ρ 2 ( φ ) + 2 ρ 3 ( φ + π 4 ) = b 3 ( φ π 2 ) , 2 ρ 1 ( φ π 2 ) + ρ 2 ( φ π 4 ) + ρ 3 ( φ 3 π 4 ) = b 1 ( φ π 4 ) , 3 ρ 1 ( φ π 4 ) + 2 ρ 2 ( φ ) + ρ 3 ( φ π 4 ) = b 2 ( φ π 4 ) , ρ 1 ( φ π 4 ) + ρ 2 ( φ + π 4 ) + 2 ρ 3 ( φ + π 2 ) = b 3 ( φ π 4 ) , 2 ρ 1 ( φ π 4 ) + ρ 2 ( φ ) + ρ 3 ( φ π 2 ) = b 1 ( φ ) , 3 ρ 1 ( φ ) + 2 ρ 2 ( φ + π 4 ) + ρ 3 ( φ ) = b 2 ( φ ) , ρ 1 ( φ ) + ρ 2 ( φ + π 2 ) + 2 ρ 3 ( φ 5 π 4 ) = b 3 ( φ ) ,
2 ρ 1 ( φ ) + ρ 2 ( φ + π 4 ) + ρ 3 ( φ π 4 ) = b 1 ( φ + π 4 ) , 3 ρ 1 ( φ + π 4 ) + 2 ρ 2 ( φ + π 2 ) + ρ 3 ( φ + π 4 ) = b 2 ( φ + π 4 ) , ρ 1 ( φ + π 4 ) + ρ 2 ( φ 5 π 4 ) + 2 ρ 3 ( φ π ) = b 3 ( φ + π 4 ) , 2 ρ 1 ( φ + π 4 ) + ρ 2 ( φ + π 2 ) + ρ 3 ( φ ) = b 1 ( φ + π 2 ) , 3 ρ 1 ( φ + π 2 ) + 2 ρ 2 ( φ 5 π 4 ) + ρ 3 ( φ + π 2 ) = b 2 ( φ + π 2 ) , ρ 1 ( φ + π 2 ) + ρ 2 ( φ + π ) + 2 ρ 3 ( φ 3 π 4 ) = b 3 ( φ + π 2 ) .
We may write the above as
K X = B ,
where
X = ( ρ 1 ( φ 5 π 4 ) , ρ 2 ( φ 5 π 4 ) , ρ 3 ( φ 5 π 4 ) , ρ 1 ( φ π ) , ρ 2 ( φ π ) , ρ 3 ( φ π ) , ρ 1 ( φ 3 π 4 ) , ρ 2 ( φ 3 π 4 ) , ρ 3 ( φ 3 π 4 ) , ρ 1 ( φ π 2 ) , ρ 2 ( φ π 2 ) , ρ 3 ( φ π 2 ) , ρ 1 ( φ π 4 ) , ρ 2 ( φ π 4 ) , ρ 3 ( φ π 4 ) , ρ 1 ( φ ) , ρ 2 ( φ ) , ρ 3 ( φ ) , ρ 1 ( φ + π 4 ) , ρ 2 ( φ + π 4 ) , ρ 3 ( φ + π 4 ) , ρ 1 ( φ + π 2 ) , ρ 2 ( φ + π 2 ) , ρ 3 ( φ + π 2 ) ) T ,
B = ( b 1 ( φ 5 π 4 ) , b 2 ( φ 5 π 4 ) , b 3 ( φ 5 π 4 ) , b 1 ( φ π ) , b 2 ( φ π ) , b 3 ( φ π ) , b 1 ( φ 3 π 4 ) , b 2 ( φ 3 π 4 ) , b 3 ( φ 3 π 4 ) , b 1 ( φ π 2 ) , b 2 ( φ π 2 ) , b 3 ( φ π 2 ) , b 1 ( φ π 4 ) , b 2 ( φ π 4 ) , b 3 ( φ π 4 ) , b 1 ( φ ) , b 2 ( φ ) , b 3 ( φ ) , b 1 ( φ + π 4 ) , b 2 ( φ + π 4 ) , b 3 ( φ + π 4 ) , b 1 ( φ + π 2 ) , b 2 ( φ + π 2 ) , b 3 ( φ + π 2 ) ) T ,
K = U L U L 2 U L 3 U L 4 U L 5 U L 6 U L 7 U ,
U = ( U 1 , U 2 , , U 8 ) ,
U 1 = 0 1 0 3 0 1 1 0 0 , U 2 = 0 0 0 0 2 0 0 0 0 ,
U 3 = 0 0 0 0 0 0 0 1 0 , U 4 = 0 0 0 0 0 0 0 0 2 ,
U 5 = 0 0 0 0 0 0 0 0 0 , U 6 = 0 0 0 0 0 0 0 0 0 ,
U 7 = 0 0 1 0 0 0 0 0 0 , U 8 = 2 0 0 0 0 0 0 0 0 .
L U = L ( U 1 , U 2 , , U 8 ) = ( U 8 , U 1 , , U 7 ) .
Similarly, we also may denote System ( 14 ) in the form of a matrix as
K X = B ,
where
X = ( ρ 1 ( φ θ 1 ) , , ρ n ( φ θ 1 ) , ρ 1 ( φ θ 2 ) , , ρ n ( φ θ 2 ) , , ρ 1 ( φ θ m ) , , ρ n ( φ θ m ) ) T ,
B = ( b 1 ( φ θ 1 ) , , b n ( φ θ 1 ) , b 1 ( φ θ 2 ) , , b n ( φ θ 2 ) , , b 1 ( φ θ m ) , , b n ( φ θ m ) ) T ,
K = U L U L 2 U L m 1 U ,
U = ( U 1 , U 2 , , U m )
U i ( i = 1 , 2 , , m ) denotes an n × m coefficient matrix of the first n equations of System ( 14 ) determined by the variable φ θ i in order ρ 1 , ρ 2 , , ρ n . L denotes putting the previous column of the block matrix into the latter column, and the last column of the block matrix into the first column, i.e.,
L U = L ( U 1 , U 2 , , U m ) = ( U m , U 1 , , U m 1 ) .
We obtain the following theorem by the above discussion.
Theorem 5.
A vector Z ˜ = ( z ˜ 1 , z ˜ 2 , , z ˜ n ) T is a solution (a unique solution) of Equation ( 2 ) if and only if the vectors Z = ( z 1 , z 2 , , z n ) T and
X = ( ρ 1 ( φ θ 1 ) , , ρ n ( φ θ 1 ) , ρ 1 ( φ θ 2 ) , , ρ n ( φ θ 2 ) , , ρ 1 ( φ θ m ) , , ρ n ( φ θ m ) ) T , are solutions (two unique solutions) of Equation ( 6 ) and ( 15 ) , respectively, and
[ z ˜ k ] r = z k + φ [ 0 , 2 π ] [ 0 , ρ k ( φ ) ] e i φ .
FCLS can be transformed into two distinct linear systems: one is an n × n complex linear system, and the other is an ( m n ) × ( m n ) RLS. Since FCN can be regarded as an extension of one-dimensional fuzzy numbers, we discuss the one-dimensional FLS by using the method of studying FCLS. Our method can also transform the one-dimensional FLS into two distinct linear systems: one is an n × n RLS, and the other is a ( 2 n ) × ( 2 n ) RLS. The method of solving the one-dimensional FLS is similar to the method of solving FCLS [42].
It should be noted that the method introduced by Friedman et al. for solving the one-dimensional FLS is to transform the original n × n FLS into a ( 2 n ) × ( 2 n ) RLS [9]. The coefficient matrix of the ( 2 n ) × ( 2 n ) RLS is a block matrix, the positive part of the original FLS coefficient matrix is the main diagonal of the block matrix, and the negative part of the original FLS coefficient matrix is the negative diagonal of the block matrix. Our method is to transform the one-dimensional FLS into a n × n RLS and a ( 2 n ) × ( 2 n ) RLS, where the coefficients of the n × n RLS are the coefficients of the original FLS, and the coefficient matrix of the ( 2 n ) × ( 2 n ) RLS is also a block matrix. The positive part of the original FLS coefficient matrix is the main diagonal of the block matrix, and the negative part of the original FLS coefficient matrix is the negative diagonal of the block matrix. This is identical to the coefficient matrix of the ( 2 n ) × ( 2 n ) RLS in the approach developed by Friedman et al. Therefore, our method can be regarded as an extension of the method introduced by Friedman et al. in the case of FCLS.

6. FCLS Based on RFCN

From Theorem 5 in the reference [1] and Lemma 2 , as well as Theorem 2.3 in the reference [43], we know that a RFCN z ˜ may be written as a form of a ˜ + i b ˜ . It follows from ( 2 ) of Theorem 2 and Definition 3 that
k z ˜ = k a ˜ + i ( k b ˜ ) , z ˜ 1 + z ˜ 2 = ( a ˜ 1 + a ˜ 2 ) + i ( b ˜ 1 + b ˜ 2 ) ,
where z ˜ = a ˜ + i b ˜ , z ˜ 1 = a ˜ 1 + i b ˜ 1 , z ˜ 2 = a ˜ 2 + i b ˜ 2 , k R .
However, by ( 1 ) of Theorem 2, we note that the scalar multiplication of an RFCN is not always an RFCN. Therefore, We consider only a FCLS based on an RFCN, and its coefficients are all real numbers.
The n × n FCLS based on RFCN is written as
a 11 z ˜ 1 + a 12 z ˜ 2 + + a 1 n z ˜ n = w ˜ 1 , a 21 z ˜ 1 + a 22 z ˜ 2 + + a 2 n z ˜ n = w ˜ 2 a n 1 z ˜ 1 + a n 2 z ˜ 2 + + a n n z ˜ n = w ˜ n ,
where z ˜ j = x ˜ j + i y ˜ j ( j = 1 , 2 , , n ) are unknown RFCN, w ˜ k = c ˜ k + i d ˜ k ( k = 1 , 2 , , n ) are known RFCN, a j k ( i , j = 1 , 2 , , n ) are real numbers, and i is an imaginary unit.
We can write the above as
A Z ˜ = W ˜ ,
where A = ( a j k ) n × n is a real n × n matrix, W ˜ = ( c ˜ k + i d ˜ k ) n × 1 is a column vector of the known RFCN and Z ˜ = ( x ˜ j + i y ˜ j ) n × 1 is a column vector of the unknown RFCN.
Then, Equation ( 17 ) is equivalent to the equations
A X ˜ = C ˜ ,
and
A Y ˜ = D ˜ ,
where C ˜ = ( c ˜ k ) n × 1 , D ˜ = ( d ˜ k ) n × 1 are two column vectors of known fuzzy numbers, and X ˜ = ( x ˜ j ) n × 1 , Y ˜ = ( y ˜ j ) n × 1 are two column vectors of unknown fuzzy numbers.
We obtain the following theorem by the above discussion.
Theorem 6.
A column vector of RFCN Z ˜ = X ˜ + i Y ˜ is a solution of Equation ( 17 ) if and only if X ˜ and Y ˜ are the solutions of Equations ( 18 ) and ( 19 ) , respectively.
Example 3.
Let
z ˜ 1 z ˜ 2 = w ˜ 1 , z ˜ 1 + 3 z ˜ 2 = w ˜ 2 ,
be a 2 × 2 FCLS based on RFCN, where
[ w ˜ 1 ] α = [ α , 2 α ] + i [ 1 + α , 3 α ] , [ w ˜ 2 ] α = [ 4 + α , 7 2 α ] + i [ α 4 , 1 2 α ] .
Let
[ z ˜ 1 ] α = [ x 1 α , x 1 + α ] + i [ y 1 α , y 1 + α ] , [ z ˜ 2 ] α = [ x 2 α , x 2 + α ] + i [ y 2 α , y 2 + α ] .
Then, Equation ( 20 ) is equivalent to the systems
[ x 1 α , x 1 + α ] [ x 2 α , x 2 + α ] = [ α , 2 α ] , [ x 1 α , x 1 + α ] + 3 [ x 2 α , x 2 + α ] = [ 4 + α , 7 2 α ] ,
and
[ y 1 α , y 1 + α ] [ y 2 α , y 2 + α ] = [ 1 + α , 3 α ] , [ y 1 α , y 1 + α ] + 3 [ y 2 α , y 2 + α ] = [ α 4 , 1 2 α ] .
By System ( 21 ) , we get
x 1 α = 11 8 + 5 α 8 , x 1 + α = 23 8 7 α 8 ,
x 2 α = 7 8 + α 8 , x 2 + α = 11 8 3 α 8 .
By System ( 22 ) , we get
y 1 α = 1 8 + 5 α 8 , y 1 + α = 13 8 7 α 8 ,
y 2 α = 11 8 + α 8 , y 2 + α = 7 8 3 α 8
Hece, we obtain that
[ z ˜ 1 ] α = [ 11 8 + 5 α 8 , 23 8 7 α 8 ] + i [ 1 8 + 5 α 8 , 13 8 7 α 8 ] ,
[ z ˜ 2 ] α = [ 7 8 + α 8 , 11 8 3 α 8 ] + i [ 11 8 + α 8 , 7 8 3 α 8 ] .
Our calculation results are consistent with those in the literature [39].

7. Conclusions

We have discussed the scalar multiplication and addition operations of complex numbers and FCN based on the representation of FCN and also introduced a method for solving FCLS, which can convert FCLS into two distinct linear systems: one is a n × n complex linear system, and the other is an ( m n ) × ( m n ) RLS. Finally, FCLS based on the RFCN as a special case are also investigated. Our calculation results show the efficiency and effectiveness of the methodology by several examples. In the future, the research in this field will focus on fuzzy complex analysis and applications of FCLS.

Author Contributions

Conceptualization, Z.X. and Z.G.; investigation, Z.X. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (12061067), the Young Doctor Foundation Project of Department of Education of Gansu Province (2021QB-121, 2022QB-170), the Natural Science Foundation of Gansu Province (21JR1RM330), and the Youth Science and Technology Innovation and Doctor Foundation Project of Longdong University (XYZK1507, XYBYZK2111).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors would like to thank the referees for providing very helpful comments and suggestions.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Buckley, J.J. Fuzzy complex numbers. Fuzzy Sets Syst. 1989, 33, 333–345. [Google Scholar] [CrossRef]
  2. Buckley, J.J.; Qu, Y. Fuzzy complex analysis I: Differentiation. Fuzzy Sets Syst. 1991, 41, 269–284. [Google Scholar] [CrossRef]
  3. Dubois, D.; Prade, H. Fuzzy Sets and Systems: Theory and Applications; Academic Press: New York, NY, USA, 1980. [Google Scholar]
  4. Dubois, D.; Prade, H. Towards fuzzy differential calculus part 3: Differentiation. Fuzzy Sets Syst. 1982, 8, 225–233. [Google Scholar] [CrossRef]
  5. Buckley, J.J. Fuzzy complex analysis II: Integration. Fuzzy Sets Syst. 1992, 49, 171–179. [Google Scholar] [CrossRef]
  6. Wu, C.; Qiu, J. Some remarks for fuzzy complex analysis. Fuzzy Sets Syst. 1999, 106, 231–238. [Google Scholar] [CrossRef]
  7. Qiu, J.; Wu, C.; Li, F. On the restudy of fuzzy complex analysis: Part I. The sequence and series of fuzzy complex numbers and their convergences. Fuzzy Sets Syst. 2000, 115, 445–450. [Google Scholar]
  8. Qiu, J.; Wu, C.; Li, F. On the restudy of fuzzy complex analysis: Part II. The continuity and differentiation of fuzzy complex functions. Fuzzy Sets Syst. 2001, 120, 517–521. [Google Scholar] [CrossRef]
  9. Friedman, M.; Ming, M.; Kandel, A. Fuzzy linear systems. Fuzzy Sets Syst. 1998, 96, 201–209. [Google Scholar] [CrossRef]
  10. Wu, C.; Ma, M. Embedding problem of fuzzy umber space: Part I. Fuzzy Sets Syst. 1991, 44, 33–38. [Google Scholar]
  11. Abbasbandy, S.; Jafarian, A.; Ezzati, R. Conjugate gradient method for fuzzy symmetric positive definite system of linear equations. Appl. Math. Comput. 2005, 171, 1184–1191. [Google Scholar] [CrossRef]
  12. Abbasbandy, S.; Ezzati, R.; Jafarian, A. LU decomposition method for solving fuzzy system of linear equations. Appl. Math Comput. 2006, 172, 633–643. [Google Scholar] [CrossRef]
  13. Abbasbandy, S.; Jafarian, A. Steepest descent method for system of fuzzy linear equations. Appl. Math. Comput. 2006, 175, 823–833. [Google Scholar] [CrossRef]
  14. Allahviranloo, T. Numerical methods for fuzzy system of linear equations. Appl. Math. Comput. 2004, 155, 493–502. [Google Scholar] [CrossRef]
  15. Allahviranloo, T. Successive over relaxation iterative method for fuzzy system of linear equations. Appl. Math. Comput. 2005, 162, 189–196. [Google Scholar] [CrossRef]
  16. Allahviranloo, T. The Adomian decomposition method for fuzzy system of linear equations. Appl. Math. Comput. 2005, 163, 553–563. [Google Scholar] [CrossRef]
  17. Allahviranloo, T.; Ahmady, E.; Ahmady, N.; Alketaby, S. Block Jacobi two stage method with Gauss Sidel inner iterations for fuzzy systems of line. Appl. Math. Comput. 2006, 175, 1217–1228. [Google Scholar]
  18. Allahviranloo, T.; Ghanbari, M. On the algebraic solution of fuzzy linear systems based on interval theory. Appl. Math. Model. 2012, 36, 5360–5379. [Google Scholar] [CrossRef]
  19. Allahviranloo, T.; Salahshour, S. Fuzzy symmetric solutions of fuzzy linear systems. J. Comput. Appl. Math. 2011, 235, 4545–4553. [Google Scholar] [CrossRef] [Green Version]
  20. Allahviranloo, T.; Salahshour, S.; Khezerloo, M. Maximal and minimal symmetric solutions of fully fuzzy linear systems. J. Comput. Appl. Math. 2011, 235, 4652–4662. [Google Scholar] [CrossRef] [Green Version]
  21. Allahviranloo, T.; Nuraei, R.; Ghanbari, M.; Haghi, E.; Hosseinzadeh, A.A. A new metric for L-R fuzzy numbers and its application in fuzzy linear systems. Soft Comput. 2012, 16, 1743–1754. [Google Scholar] [CrossRef]
  22. Allahviranloo, T.; Kermani, M.A. Solution of a fuzzy system of linear equation. Appl. Math. Comput. 2006, 175, 519–531. [Google Scholar] [CrossRef]
  23. Amirfakhrian, M. Analyzing the solution of a system of fuzzy linear equations by a fuzzy distance. Soft Comput. 2012, 16, 1035–1041. [Google Scholar] [CrossRef]
  24. Dehghan, M.; Hashemi, B. Iterative solution of fuzzy linear systems. Appl. Math. Comput. 2006, 175, 645–674. [Google Scholar] [CrossRef]
  25. Dehghan, M.; Hashemi, B.; Ghatee, M. Solution of the fully fuzzy linear systems using iterative techniques. Chaos Soliton Fractals 2007, 34, 316–336. [Google Scholar] [CrossRef]
  26. Ezzati, R. Solving fuzzy linear systems. Soft Comput. 2011, 15, 193–197. [Google Scholar] [CrossRef]
  27. Gong, Z.; Guo, X.; Liu, K. Approximate solution of dual fuzzy matrix equations. Inf. Sci. 2014, 266, 112–133. [Google Scholar] [CrossRef]
  28. Ghanbari, R.; Mahdavi-Amiri, N. New solutions of LR fuzzy linear systems using ranking functions and ABS algorithms. Appl. Math. Model. 2010, 34, 3363–3375. [Google Scholar] [CrossRef]
  29. Tian, Z.; Hu, L.; Greenhalgh, D. Perturbation analysis of fuzzy linear systems. Inf. Sci. 2010, 180, 4706–4713. [Google Scholar] [CrossRef]
  30. Vroman, A.; Deschrijver, G.; Kerre, E.E. Solving systems of linear fuzzy equations by parametric functions—An improved algorithm. Fuzzy Sets Syst. 2007, 158, 1515–1534. [Google Scholar] [CrossRef]
  31. Wang, K.; Zhang, B. Symmetric successive overrelaxation methods for fuzzy linear system. Appl. Math. Comput. 2005, 175, 891–901. [Google Scholar] [CrossRef]
  32. Wang, X.; Zhong, Z.; Ha, M. Iteration algorithms for solving a system of fuzzy linear equations. Fuzzy Sets Syst. 2005, 119, 121–128. [Google Scholar] [CrossRef]
  33. Wang, K.; Zheng, B. Inconsistent fuzzy linear systems. Appl. Math. Comput. 2006, 181, 973–981. [Google Scholar] [CrossRef]
  34. Rahgooy, T.; Yazdi, H.S.; Monsefi, R. Fuzzy complex system of linear equations applied to circuit analysis. Int. J. Comput. Electr. Eng. 2009, 1, 535–541. [Google Scholar] [CrossRef] [Green Version]
  35. Jahantigh, M.A.; Khezerloo, S.; Khezerloo, M. Complex fuzzy linear systems. Int. J. Ind. Math. 2010, 1, 21–28. [Google Scholar]
  36. Behera, D.; Chakraverty, S. A new method for solving real and complex fuzzy systems of linear equations. Comput. Math. Model. 2012, 23, 507–518. [Google Scholar] [CrossRef]
  37. Hladik, M.K. Solution sets of complex linear interval systems of equations. Reliab. Comput. 2010, 14, 78–87. [Google Scholar]
  38. Djanybekov, B.S. Interval householder method for complex linear systems. Reliab. Comput. 2006, 12, 35–43. [Google Scholar] [CrossRef]
  39. Behera, D.; Chakraverty, S. Solving fuzzy complex system of linear equations. Inf. Sci. 2014, 277, 154–162. [Google Scholar] [CrossRef]
  40. Ghanbari, M. A discussion on “solving fuzzy complex system of linear equations”. Inf. Sci. 2017, 402, 165–169. [Google Scholar] [CrossRef]
  41. Gong, Z.T.; Xiao, Z.Y. Fuzzy complex numbers: Representations, operations, and its analysis. Fuzzy Sets Syst. 2021, 417, 1–45. [Google Scholar] [CrossRef]
  42. Xiao, Z.Y.; Gong, Z.T.; Liu, K. Fuzzy linear systems with the two-dimension fuzzy data. J. Intell. Fuzzy Syst. 2020, 38, 5295–5315. [Google Scholar] [CrossRef]
  43. Gong, Z.T.; Xiao, Z.Y. Approximation of fuzzy complex numbers by the form x ˜ + i y ˜ . J. Intell. Fuzzy Syst. 2022, 42, 3381–3391. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Xiao, Z.; Gong, Z. The Fuzzy Complex Linear Systems Based on a New Representation of Fuzzy Complex Numbers. Mathematics 2022, 10, 2822. https://doi.org/10.3390/math10152822

AMA Style

Xiao Z, Gong Z. The Fuzzy Complex Linear Systems Based on a New Representation of Fuzzy Complex Numbers. Mathematics. 2022; 10(15):2822. https://doi.org/10.3390/math10152822

Chicago/Turabian Style

Xiao, Zhiyong, and Zengtai Gong. 2022. "The Fuzzy Complex Linear Systems Based on a New Representation of Fuzzy Complex Numbers" Mathematics 10, no. 15: 2822. https://doi.org/10.3390/math10152822

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop