Next Article in Journal
A New Log-Logistic Lifetime Model with Mathematical Properties, Copula, Modified Goodness-of-Fit Test for Validation and Real Data Modeling
Next Article in Special Issue
Construction of Fuzzy Measures over Product Spaces
Previous Article in Journal
Spatial-Perceptual Embedding with Robust Just Noticeable Difference Model for Color Image Watermarking
Previous Article in Special Issue
Strong Tolerance and Strong Universality of Interval Eigenvectors in a Max-Łukasiewicz Algebra
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Which Alternative for Solving Dual Fuzzy Nonlinear Equations Is More Precise?

by
Joanna Kołodziejczyk
,
Andrzej Piegat
and
Wojciech Sałabun
*
Research Team on Intelligent Decision Support Systems, Department of Artificial Intelligence Methods and Applied Mathematics, Faculty of Computer Science and Information Technology, West Pomeranian University of Technology in Szczecin ul. Żołnierska 49, 71-210 Szczecin, Poland
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(9), 1507; https://doi.org/10.3390/math8091507
Submission received: 14 August 2020 / Revised: 2 September 2020 / Accepted: 3 September 2020 / Published: 4 September 2020
(This article belongs to the Special Issue Fuzzy Sets, Fuzzy Logic and Their Applications 2020)

Abstract

:
To answer the question stated in the title, we present and compare two approaches: first, a standard approach for solving dual fuzzy nonlinear systems (DFN-systems) based on Newton’s method, which uses 2D FN representation and second, the new approach, based on multidimensional fuzzy arithmetic (MF-arithmetic). We use a numerical example to explain how the proposed MF-arithmetic solves the DFN-system. To analyze results from the standard and the new approaches, we introduce an imprecision measure. We discuss the reasons why imprecision varies between both methods. The imprecision of the standard approach results (roots) is significant, which means that many possible values are excluded.

1. Introduction

Solving linear and nonlinear fuzzy equations is a difficult task. This is evidenced by the fact that scientists are constantly developing new and better methods, because previous methods are not satisfactory and scientists have recognized the need to improve them. In the case of fuzzy nonlinear equations, one of the first methods was published in 1990 [1].
Newton’s numerical methods for solving DFN-systems are widespread in the literature. Abbasbandy and Asady proposed the numerical parametric approach to find a fuzzy nonlinear equation using Newton’s method. The efficiency of the algorithm was shown based on some numerical examples [2]. The continuation of their work is found in [3]. Ramli et al. show that the disadvantages of Newton’s method arise from the need to calculate and invert the Jacobian matrix at each iteration. They proposed an eight-step algorithm to solve fuzzy nonlinear equations [4]. In [5], Kajani et al. have applied Newton’s method for solving a DFN-system, which cannot be replaced by a fuzzy nonlinear system according to fuzzy arithmetic. Newton’s method was also used to solve dual fuzzy polynomial equations, where the modified Adomian decomposition method was applied in the numerical algorithm [6]. Waziri and Majid proposed a new approach for solving DFN-equations by combining Newton’s method for initial iteration and Broyden’s method for the rest of the iterations [7]. The paper [8] presents a method of solving DFN-systems based on Chord Newton’s method as an improvement of Newton’s iterative method published in [5]. An unquestionable advantage of the method [8] is that it requires the Jacobian matrix to be calculated only once for all iterations whereas in Newton’s method from [5] the matrix has to be calculated in each subsequent iteration, which is connected with a high computational effort. Wang et al. introduced the general family of n-point Newton-type iterative methods for solving nonlinear equations using direct Hermite interpolation [9]. All these approaches have one thing in common, as will be shown, which is they give imprecise results.
In the paper, we compare two approaches to solve DFN-systems first, a standard based on Newton’s method and a 2D FN representation. The second is a novel alternative approach based on multidimensional fuzzy arithmetic. We introduce imprecision to measure how different a solution is from the universal algebraic solution to analyze both methods’ solutions. The universal algebraic solution is a set of all solutions that satisfied the equations. We show that the standard approach finds a narrower set of solutions than the universal algebraic solution, which means that they omit many possible values. Our proposal’s primary motivation is the advantage of determining all possible results when looking for solutions, not only the most narrow subset. The full universal algebraic solution is especially desired in decision support systems, where the imprecision of traditional approaches leads to limitations of possible states and, therefore, may constitute decision variants.
The paper is organized as follows: first, we give some essential basic definitions in a standard approach and proposed MF-arithmetic in Section 2. The ideas for both approaches are compared in Section 3. The imprecision measure is defined in Section 4. In Section 5, we solve the benchmark DFN-system using both proposed approaches. Finally, in Section 6, we discuss the most important outcomes.

2. Preliminaries

Definition 1.
[5] The dual fuzzy nonlinear system [8] is understood to be the system (1):
Q ( x ) = R ( x ) + c
where all parameters are fuzzy numbers.
The standard approach to solving DFN-systems applies Newton’s algorithm and a parametric form of a fuzzy number. Our approach uses MF-arithmetic based on a horizontal fuzzy number definition.

2.1. Basic Definitions in the Standard Approach

The definitions presented in the subsection are fundamental standard approaches using Newton’s methods for solving DFN-systems and comes from articles: [5,8].
Definition 2.
A fuzzy number is a fuzzy set like u : R I = [ 0 , 1 ] which satisfies:
1. 
u is upper semicontinuous,
2. 
u ( x ) = 0 outside some interval [ c , d ] ,
3. 
There are real numbers a , b such that c a b d and
(a) 
u ( x ) is monotonic increasing on [ c , a ]
(b) 
u ( x ) is monotonic decreasing on [ b , d ]
(c) 
u ( x ) = 1 , a x b
Definition 3.
A fuzzy number in parametric form is a pair u ̲ , u ¯ of functions u ̲ ( r ) , u ¯ ( r ) , 0 r 1 which satisfies the following:
1. 
u ̲ ( r ) is a bounded monotonic increasing left continuous function,
2. 
u ¯ ( r ) is a bounded monotonic decreasing left continuous function,
3. 
u ̲ ( r ) u ¯ ( r ) , 0 x 1 .
where the variable r represents the membership level.
A popular triangular fuzzy number with the parameters ( a , b , c ) (shown in Figure 1 (left graph)) in its parametric form is:
u ̲ ( r ) = a + ( b a ) r , u ¯ ( r ) = c ( c b ) r
In [8] the described Chord–Newton’s approach was implemented according to the following steps:
Step 1
Transform the dual fuzzy nonlinear equations into parametric form.
Step 2
Determine the initial point x 0 by solving the parametric equations for r = 0 and r = 1 .
Step 3
Compute the Jacobian matrix . J x ̲ 0 , x ¯ 0 , r
Step 4
Compute (3)
x n ( r ) = x n 1 ( r ) + s a θ n γ n J 1 x ̲ 0 , x ¯ 0 , r n = 1 , 2 ,
Step 5
Repeat steps from 3 to 4 and continue with the next n keeping Jacobian until tolerance ϵ 10 5 is satisfied.

2.2. Multidimensional Fuzzy Arithmetic

The MF-arithmetic theoretical foundations are linked with the horizontal fuzzy numbers (HFN) [10]. The HFN with linear or/and nonlinear left and right borders can be defined based on the FN parametric definition.
Definition 4.
A horizontal fuzzy number, of an arbitrary fuzzy number ( u ̲ ( μ ) , u ¯ ( μ ) ) is defined as follows:
U = u g r R : u g r = u μ , α u = u ̲ ( μ ) + α u ( u ¯ ( μ ) u ̲ ( μ ) ) } ,
where μ , α u [ 0 , 1 ] and μ represents the membership level.
The variable α u [ 0 , 1 ] is the Relative Distance Measure (RDM) [11,12] and ensures obtaining any FN value between the left border u ̲ ( μ ) and right border u ¯ ( μ ) . For α u = 0 value of the left endpoint u ̲ ( μ ) and for α u = 1 the right endpoint u ¯ ( μ ) of FN.
The fuzzy number U represents only an approximate knowledge about the precise but unknown true value of the variable u g r (epistemic approach [13]).
If we have an approximate knowledge of two uncertain values of the variables x and y in the form of horizontal membership function: x g r ( μ , α x ) and y g r ( μ , α y ) then the basic arithmetic operations ( { + , , × , / } ) can be expressed as Equation (5).
x g r μ , α x y g r μ , α y = z g r μ , α x , α y , μ , α x , α y [ 0 , 1 ] .
The division operation guarantees a result in the form of a single granule if the following condition is satisfied: 0 y g r μ , α y . However, if 0 y g r μ , α y then the quotient will be multi-granular [14]. It should be noted that the result z g r μ , α x , α y of any arithmetic operation is not defined in 2D space μ × z but in 4D space μ × α x × α y × z .
Definition 5.
[10] The direct solution of an operation on n horizontal fuzzy numbers u 1 ( μ , α u 1 ) , , u n ( μ , α u n ) , where μ , α u 1 , , α u n [ 0 , 1 ] is a set of numbers expressed in the form of multidimensional formula Z = z μ , α u 1 , , α u n with up to n HFN variables α u 1 , , α u n [ 0 , 1 ] .
Definition 6.
[10] For the direct solution Z = z μ , α u 1 , , α u n of the basic arithmetic operations on n horizontal fuzzy numbers span is a fuzzy number:
s Z r = ( min α u 1 , , α u n z μ , α u 1 , , α u n max α u 1 , , α u n z μ , α u 1 , , α u n
Multidimensional fuzzy arithmetic has such important mathematical properties as (assuming X , Y , Z are HFN):
  • Additive inverse element X X = 0 ,
  • Multiplicative inverse element X · 1 / X = 1 ,
  • Distributive law X ( Y + Z ) = X Y + X Z ,
  • Cancellation law for multiplication X Z = Y Z X = Y , and others.
These properties allow solving any problem by transforming fuzzy equations from one mathematical form to another. In other words, without these properties, transformations are impossible. 2D-fuzzy arithmetic methods do not have such properties, which causes calculation difficulties.
The horizontal triangle membership functions corresponding to the vertical triangle membership functions with the parameters ( a , b , c ) , shown in Figure 1 (right graph), are represented by Equation (7) [14].
x r = a + b a μ + c a 1 μ α x ,
where μ , α x [ 0 , 1 ] and X : x r X .

3. Multidimensional Fuzzy Arithmetic Approach

What we called a standard approach are two-dimensional (2D) versions of the fuzzy arithmetic, and calculus based on it is presented in the scheme in Figure 2.
This approach assumes that the result of calculations on 2D-FNs is also a 2D-FN. Reference [12] considers this assumption incorrect. Such the approach delivers: sometimes precise, sometimes imprecise, sometimes paradoxical results or sometimes they are not able to solve the problem at all [15] or sometimes they can only solve it partially, as in the case of the benchmark (Equation (9)).
On the other hand, multidimensional fuzzy arithmetic works according to a different scheme than standard fuzzy 2D arithmetics. The diagram is given in Figure 3.
In 2D fuzzy calculation methods, what is assumed to be a “result” in MF-arithmetic is only a 2D indicator of a multidimensional result, which at most can be called “secondary result”. There are three basic indicators for the multidimensional fuzzy result:
  • Span,
  • Cardinality distribution,
  • Center of gravity.
What is interpreted as the “result” in 2D methods is actually only the span of the multidimensional fuzzy result [16,17]. Until now, MF-arithmetic has been described in about 40 papers [15].

4. Imprecision Measure

Before numerical example presentation and further discussion, let us define a DFN-systems solution quality measure named “imprecision”. This quality is related to the concept of a universal algebraic solution. Let:
  • U A -solution—universal algebraic solution always satisfies the given nonlinear equation regardless of its mathematical form (right and left sides of the equation are equal),
  • A U A -solution delivered by the method in the form of an MF-arithmetic,
  • B—a solution delivered by the method in the form of a fuzzy number (FN),
  • S u p p ( B ) —the support of B FN,
  • S u p p ( s ( A ) ) —the support of the A’s span s ( A ) .
Definition 7.
The imprecision of a solution B is a measure of how different a solution B is from the A which is U A -solution:
I m p r e c i s i o n ( B ) = S u p p ( B ) S u p p ( s ( A ) ) S u p p ( s ( A ) ) · 100 % ,
The imprecision ( B ) calculates the percentage of values excluded (negative Imprecision for the case S u p p ( B ) S u p p ( s ( A ) ) ) or values included (positive Imprecision for the case S u p p ( s ( A ) ) S u p p ( B ) ) from or to the U A -solution.

5. Solving the Benchmark Equation

The best proof of methods qualitative correctness and precision is the correct solution to real problems. To show the performance of Newton’s approach, authors in [7] present solutions to some DFN-systems benchmark problems. To compare the standard and proposed MF-arithmetic approaches we take the benchmark from [5,7] called Problem 1.
Problem 1
([8]). Consider the dual fuzzy nonlinear equation:
( 6 , 2 , 2 ) x 2 + ( 2 , 1 , 1 ) x = ( 2 , 1 , 1 ) x 2 + ( 2 , 1 , 1 )
In this problem ( 6 , 2 , 2 ) denotes triangle FN with a core σ = 6 and with a left and right deviation equal to 2 and ( 2 , 1 , 1 ) denotes a FN with a core equal to σ = 2 and both deviations equal to 1. The above FNs are shown in Figure 4.

5.1. Standard Approach

Using the standard approach using Newton’s method and parametric FN representation, the authors of [5,8] achieved only one positive solution (positive root) of Equation (9) in form of the fuzzy number X 2 shown in Figure 5.
As will be shown, the positive solution X 2 delivered by the standard approach is, to a considerable degree, imprecise due to the FN definition and followed by its assumptions. Additionally, according to the authors [5,8] the negative solution X 1 of the benchmark Equation (9) does not exist at all and the explanation for this fact is given in [5].

5.2. MF-Arithmetic Approach

The benchmark equation (Equation (9)) represents a stationary, real system (Equation (10)),
d 1 x 2 + d 2 x = d 3 x 2 + d 4 ,
where d 1 , d 2 , d 3 , d 4 are true, crisp coefficients describing properties in the real system. In the analysed benchmark these true values are not known exactly. However, we have approximate knowledge about them: d 1 D 1 = ( 6 , 2 , 2 ) , d 2 D 2 = ( 2 , 1 , 1 ) , d 3 D 3 = ( 2 , 1 , 1 ) , d 4 D 4 = ( 2 , 1 , 1 ) . The fact that
D 2 = D 3 = D 4 = ( 2 , 1 , 1 )
does not imply that the true coefficient values are equal, i.e., d 2 = d 3 = d 4 . The probability of such a case occurring is equal to zero, because it is the probability of drawing a single point from a cuboid (geometric probability).
For true coefficient values, the equation (Equation (10)) can be converted to (Equation (12)).
( d 1 d 3 ) x 2 + d 2 x d 4 = 0 .
Well known Vieta’s formulas (Equation (13)) are applied to solve the equation (Equation (12)).
x 1 = d 2 Δ 2 ( d 1 d 3 ) , x 2 = d 2 + Δ 2 ( d 1 d 3 ) , Δ = d 2 2 + 4 ( d 1 d 3 ) d 4 .
In terms of multidimensional fuzzy arithmetic the mathematical models of true and possible coefficient values are described as follows (Equation (14)):
d 1 g r = ( 4 + 2 μ ) + 4 ( 1 μ ) α d 1 , μ , α d 1 [ 0 , 1 ] , d 2 g r = ( 1 + μ ) + 2 ( 1 μ ) α d 2 , μ , α d 2 [ 0 , 1 ] , d 3 g r = ( 1 + μ ) + 2 ( 1 μ ) α d 3 , μ , α d 3 [ 0 , 1 ] , d 4 g r = ( 1 + μ ) + 2 ( 1 μ ) α d 4 , μ , α d 4 [ 0 , 1 ] .
To achieve benchmark (Equation (9)) solutions, the expression obtained in (Equation (14)) is substituted in equations (Equation (13)):
x 1 g r = [ ( 1 + μ ) + 2 ( 1 μ ) α d 2 ] Δ 2 [ ( 3 + μ ) + ( 1 μ ) ( 4 α d 1 2 α d 3 ) ] , x 2 g r = [ ( 1 + μ ) + 2 ( 1 μ ) α d 2 ] + Δ 2 [ ( 3 + μ ) + ( 1 μ ) ( 4 α d 1 2 α d 3 ) ] , Δ = [ ( 1 + μ ) + 2 ( 1 μ ) α d 2 ] 2 + 4 [ ( 3 + μ ) + + ( 1 μ ) ( 4 α d 1 2 α d 3 ) ] [ ( 1 + μ ) + 2 ( 1 μ ) α d 4 ] , μ , α d 1 , α d 2 , α d 3 , α d 4 [ 0 , 1 ] .
The x 1 g r and x 2 g r possible values satisfy the following conditions: x 1 g r < 0 and x 2 g r > 0 and their denominators do not include zero. Hence, the solutions are single information granules. Each information granule is multidimensional (6D) because x 1 g r = f 1 ( μ , α d 1 , α d 2 , α d 3 , α d 4 ) and x 2 g r = f 1 ( μ , α d 1 , α d 2 , α d 3 , α d 4 ) .
They are universal, algebraic solutionsof the benchmark, that can be easily verified by substitution in the Equation (9). The solutions ensure left and right-hand side equality regardless of the mathematical representation of the benchmark equation, which means that they are universal [11,12,15]. The multidimensional, algebraic solutions x 1 g r and x 2 g r are hypersurface fragments in 6D spaces and cannot be visualised. For simplified (2D) information about the solutions, low-dimensional indicators can be used such as: span, cardinality distribution and center of gravity of multidimensional fuzzy solution [11,12,15,17]. Spans of multidimensional solutions s ( x 1 , 2 g r ) can be obtained with Equation (16).
s ( x 1 , 2 g r ) = min α d 1 , , α d 4 x 1 , 2 g r ( μ , α d 1 , , α d 4 ) , max α d 1 , , α d 4 x 1 , 2 g r ( μ , α d 1 , , α d 4 ) .
To determine the span of the negative root x 1 g r (Equation (17)) equation, Equation (15) is substituted to Equation (16).
s ( x 1 g r ) = 3 + μ 21 + 26 μ 11 μ 2 2 + 6 μ , 1 + μ + 29 + 18 μ 11 μ 2 14 + 6 μ .
According to the authors of [8] the negative root does not exist. The lack of the negative solution is the consequence of the parametric FN form and the low-dimension fuzzy calculus. Newton’s methods [5,8] found the second root that does not satisfy the third condition in Definition 3 and therefore was rejected. We observe that the low-dimensional fuzzy calculus is imprecise. It is strange that the negative root was rejected, because negative crisp benchmark solutions can easily be found. The span function of the negative root s ( x 1 g r ) , which is the benchmark (Equation (9)) solution, is shown in Figure 6.
The minimum value of the negative root,
min α d 1 , , α d 4 x 1 g r ( μ , α d 1 , α d 2 , α d 3 , α d 4 ) ,
was obtained for following values of RDM-variables:
α d 1 = 0 , α d 2 = α d 3 = α d 4 = 1 ,
and the membership level μ = 0 and is equal to min x 1 g r = 3.79129 .
The maximum value of the negative root,
max α d 1 , , α d 4 x 1 g r ( μ , α d 1 , α d 2 , α d 3 , α d 4 ) ,
was derived for the set of RDM-variables:
α d 1 = 1 , α d 2 = α d 3 = α d 4 = 0 ,
and the μ = 0 level and is equal to max x 1 g r = 0.456083 .
These results can easily be verified with a method described in [17]. Solving equations (Equation (14)) by substituting RDM-variables α d 1 = 0 , α d 2 = α d 3 = α d 4 = 1 for min x 1 g r and μ = 0 results in a set of corresponding coefficient values:
d 1 = 4 , d 2 = 3 , d 3 = 3 , d 4 = 3 .
All these values are possible because they are contained in supports of fuzzy coefficients D 1 , D 2 , D 3 , D 4 in the benchmark (Equation (9)). For these coefficients the equation (Equation (9)) takes form:
4 x 2 + 3 x = 3 x 2 + 3 ,
and have two roots: x n e g = 3.79129 and x p o s = 0.791288 . The negative root is the same as that found using multidimensional fuzzy arithmetic.
Now we check the correctness of the max x 1 g r solution. Coefficient values corresponding to RDM-variables α d 1 = 1 , α d 2 = α d 3 = α d 4 = 0 and μ = 0 are
d 1 = 8 , d 2 = 1 , d 3 = 1 , d 4 = 1 .
They generate a possible form of the Equation (9):
8 x 2 + x = x 2 + 1 ,
which has a negative root x n e g = 0.456083 and also a positive x p o s = 0.313226 .
Other combinations of RDM-variables
α d 1 , α d 2 , α d 3 , α d 4 [ 0 , 1 ]
generate intermediate values of the negative root x 1 [ 3.79129 , 0.456083 ] as shown in Figure 6, which can be easily checked.
The above is an empirical proof that the negative solution (root) of the benchmark (Equation (9)) exists.
The positive solution (root) x 2 of the benchmark (Equation (9)) can be determined on the basis of Equations (15) and (16) and its span function s ( x g r 2 ) is as follows:
s ( x 2 g r ) = 3 + μ + 37 + 10 μ 11 μ 2 14 6 μ , 1 μ + 13 + 34 μ 11 μ 2 2 + 6 μ .
The minimum, left border of this function is evaluated for the RDM-variable set α d 1 = α d 2 = 1 , α d 3 = α d 4 = 0 and the maximum, right border corresponds to the set: α d 1 = α d 2 = 0 , α d 3 = α d 4 = 1 . Span functions determined by multidimensional fuzzy arithmetic and the standard approach are shown in Figure 7.
The result in Figure 7b delivered by Newton’s method seems to be of better quality (less uncertain), as its support is narrower than the support of the span function calculated using multidimensional fuzzy arithmetic (Figure 7a). If we expect the correct result to be precise and true, such a conclusion would be considered incorrect. The correct result does not necessarily mean less uncertain (narrower).
Let us check whether the standard approach result is possible and true. According to [8] possible solutions x 2 (only the positive root) for the benchmark (9) on the membership level μ = 0 are in the range [ 0.4343 , 0.5307 ] . As a consequence every x 2 lying outside of the interval is not possible. The validity of this conclusion can be easily verified by the following reasoning. The values of RDM-variables α d 1 = α d 2 = 1 , α d 3 = α d 4 = 0 and μ = 0 correspond to coefficients:
d 1 = 8 , d 2 = 2 , d 3 = 1 , d 4 = 1 ,
which generate the possible benchmark (9) form:
8 x 2 + 3 x = x 2 + 1 .
Such quadratic equation has two roots and the positive root is x 2 = 0.220197 . It means that such root value is possible. However, according to the standard approach using Newton’s method, this value is impossible.
Moreover, RDM-variable values α d 1 = α d 2 = 0 , α d 3 = α d 4 = 1 and μ = 0 resulted in
d 1 = 4 , d 2 = 1 , d 3 = 3 , d 4 = 3
coefficients that transforms the benchmark Equation (9) into the form
4 x 2 + x = 3 x 2 + 3 .
This quadratic equation has a positive root x 2 = 1.30278 , which according to the standard approach (Figure 7b), is impossible. Other intermediate, possible values of the root x 2 can be achieved for other combinations of RDM-variables α d 1 , α d 2 , α d 3 , α d 4 [ 0 , 1 ] .

5.3. Final Comparison

The total comparison of all solutions (roots) obtained with multidimensional fuzzy arithmetic and with the standard approach using Newton’s method and parametric FN representation is shown in Figure 8.
We claim that the results of the standard approach are, to some degree, imprecise. Let us calculate the imprecision based on Definition 7. The standard Newton method excludes over 91% possible positive root solutions compared to possible solutions delivered by multidimensional fuzzy arithmetic:
I m p r e c i s i o n ( s t a n d a r d A p p r o a c h ) = ( 0.0964 1.08258 ) 1.08258 · 100 % = 91.095 % .
The number of solutions excluded from the negative root is 100%.
The experimental verification shows that roots: x 1 [ 3.39179 , 0.4560838 ] and x 2 [ 0.220197 , 1.30278 ] computed by MF-arithmetic are true and possible. On this basis, we can conclude that the standard Newton method solution x 2 [ 0.4343 , 0.5307 ] is significantly imprecise.

6. Conclusions

Using an example and solving the DFN-equation benchmark, we compare the standard approach based on Newton’s method, which uses 2D FN representation to the MF-arithmetic approach. Calculating the imprecision measure, we show that the standard approach results are significantly imprecise, i.e., differs from the universal algebraic solution (UA-solution). According to the standard approach, the benchmark equation’s negative root does not exist at all, and the positive root is significantly (over 91%) imprecise (underestimated). The reason for such imprecision is twofold. First is the fuzzy numbers representation and, consequently, the low-dimensional fuzzy calculus, i.e., striving for a direct calculation of results without prior determination of the multidimensional, universal, algebraic fuzzy result. Second, the assumptions in the fuzzy number representation reject the negative root.
The precise solution of DFN-systems can be achieved with the MF-arithmetic, which works according to the scheme:
  • Get 2D fuzzy inputs,
  • Calculate a multidimensional direct fuzzy result,
  • Calculate the 2D secondary result.
Based on the presented example, we stated that without the multidimensional fuzzy calculation, in general, true and precise solutions for DFN-systems are impossible to obtain. The standard approach has limited applications for solving dual fuzzy nonlinear systems due to a high imprecision, i.e., by rejecting a range of possible values.
In future work, we explore MF-arithmetic applicability for solving other types of equations and systems of equations. We plan to apply our approach to real decision-making problems.

Author Contributions

Conceptualization, A.P. and J.K.; methodology, A.P., J.K.; software, J.K.; validation, A.P., J.K. and W.S.; formal analysis, A.P. and J.K.; investigation, J.K.; resources, J.L. and W.S.; data curation, J.K.; writing—original draft preparation, J.K., A.P. and W.S.; writing—review and editing, J.K. and W.S.; visualization, J.K.; supervision, A.P. and W.S.; project administration, J.K.; funding acquisition, W.S. All authors have read and agreed to the published version of the manuscript.

Funding

The work was supported by statutory funds of the Research Team on Intelligent Decision Support Systems, Department of Artificial Intelligence and Applied Mathematics, Faculty of Computer Science and Information Technology, West Pomeranian University of Technology in Szczecin.

Acknowledgments

The authors would like to thank the editor and the anonymous reviewers, whose insightful comments and constructive suggestions helped us to significantly improve the quality of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
DFN-systemDual Fuzzy Nonlinear System
FNFuzzy Number
RDMRelative Distance Measure
MF-arithmeticMultidimensional Fuzzy Arithmetic

References

  1. Buckley, J.J.; Qu, Y. Solving Linear and Quadratic Fuzzy Equations. Fuzzy Sets Syst. 1990, 38, 43–59. [Google Scholar] [CrossRef]
  2. Abbasbandy, S.; Asady, B. Newton’s Method for Solving Fuzzy Nonlinear Equations. Appl. Math. Comput. 2004, 159, 349–356. [Google Scholar] [CrossRef]
  3. Abbasbandy, S.; Ezzati, R. Newton’s method for solving a system of fuzzy nonlinear equations. Appl. Math. Comput. 2006, 175, 1189–1199. [Google Scholar] [CrossRef]
  4. Ramli, A.; Abdullah, M.L.; Mamat, M. Broyden’s method for solving fuzzy nonlinear equations. Adv. Fuzzy Syst. 2010, 2010, 763270. [Google Scholar] [CrossRef]
  5. Kajani, M.T.; Asady, B.; Vencheh, A.H. An Iterative Method for Solving Dual Fuzzy Nonlinear Equations. Appl. Math. Comput. 2005, 167, 316–323. [Google Scholar] [CrossRef]
  6. Mosleh, M. Solution of dual fuzzy polynomial equations by modified Adomian decomposition method. Fuzzy Inf. Eng. 2013, 5, 45–56. [Google Scholar] [CrossRef]
  7. Waziri, M.Y.; Majid, Z.A. A New Approach for Solving Dual Fuzzy Nonlinear Equations Using Broyden’s and Newton’s Methods. Adv. Fuzzy Syst. 2012, 2012, 682087. [Google Scholar] [CrossRef] [Green Version]
  8. Waziri, M.Y.; Moyi, A.U. An Alternative Approach for Solving Dual Fuzzy Nonlinear Equations. Int. J. Fuzzy Syst. 2016, 18, 103–107. [Google Scholar] [CrossRef]
  9. Wang, X.; Qin, Y.; Qian, W.; Zhang, S.; Fan, X.A. Family of Newton Type Iterative Methods for Solving Nonlinear Equations. Algorithms 2015, 8, 786–798. [Google Scholar] [CrossRef] [Green Version]
  10. Landowski, M. Method with horizontal fuzzy numbers for solving real fuzzy linear systems. Soft Comput. 2019, 23, 3921–3933. [Google Scholar] [CrossRef] [Green Version]
  11. Piegat, A.; Landowski, M. Fuzzy Arithmetic Type 1 with Horizontal Membership Functions. In Uncertainty Modeling: Dedicated to Professor Boris Kovalerchuk on his Anniversary; Springer International Publishing: Cham, Switzerland, 2017; pp. 233–250. [Google Scholar]
  12. Piegat, A.; Landowski, M. Is Fuzzy Number the Right Result of Arithmetic Operations on Fuzzy Numbers? In Advances in Fuzzy Logic and Technology 2017; Kacprzyk, J., Szmidt, E., Zadrożny, S., Atanassov, K.T., Krawczak, M., Eds.; Springer International Publishing: Cham, Switzerland, 2018; pp. 181–194. [Google Scholar]
  13. Lodwick, W.A.; Dubois, D. Interval Linear Systems As a Necessary Step in Fuzzy Linear Systems. Fuzzy Sets Syst. 2015, 281, 227–251. [Google Scholar] [CrossRef] [Green Version]
  14. Piegat, A.; Pluciński, M. Fuzzy number division and the multi-granularity phenomenon. Bull. Pol. Acad. Sci. Tech. Sci. 2017, 65, 497–511. [Google Scholar] [CrossRef] [Green Version]
  15. Piegat, A.; Landowski, M. Why Multidimensional Fuzzy Arithmetic? In Proceedings of the 13th International Conference on Theory and Application of Fuzzy Systems and Soft Computing—ICAFS-2018; Istanbul, Turkey, 28–30 October 2018, Aliev, R.A., Kacprzyk, J., Pedrycz, W., Jamshidi, M., Sadikoglu, F.M., Eds.; Springer International Publishing: Cham, Switzerland, 2019; pp. 16–23. [Google Scholar]
  16. Piegat, A.; Landowski, M. Two Interpretations of Multidimensional RDM Interval Arithmetic-Multiplication and Division. Int. J. Fuzzy Syst. 2013, 15, 488–496. [Google Scholar]
  17. Piegat, A.; Landowski, M. Correctness-checking of uncertain-equation solutions on example of the interval-modal method. In Modern Approach in Fuzzy Sets, Intuitionistic Fuzzy Sets, Generalized Nets and Related Topics; IBS PAN: Warswa, Poland, 2014; pp. 159–170. [Google Scholar]
Figure 1. Triangle membership function of a fuzzy number X with the cut at membership level r = μ = 0.4 : left graph—parametric fuzzy number (FN), right graph—horizontal FN.
Figure 1. Triangle membership function of a fuzzy number X with the cut at membership level r = μ = 0.4 : left graph—parametric fuzzy number (FN), right graph—horizontal FN.
Mathematics 08 01507 g001
Figure 2. A standard approach (2D) scheme in fuzzy arithmetic.
Figure 2. A standard approach (2D) scheme in fuzzy arithmetic.
Mathematics 08 01507 g002
Figure 3. A proposed multidimensional fuzzy (MF)-arithmetic approach scheme.
Figure 3. A proposed multidimensional fuzzy (MF)-arithmetic approach scheme.
Mathematics 08 01507 g003
Figure 4. Triangle fuzzy numbers D 1 , D 2 , D 3 , D 4 used as uncertain coefficients in the discussed benchmark Problem 1.
Figure 4. Triangle fuzzy numbers D 1 , D 2 , D 3 , D 4 used as uncertain coefficients in the discussed benchmark Problem 1.
Mathematics 08 01507 g004
Figure 5. Solution X 2 of the benchmark Equation (9) achieved with the use of a standard approach based on Newton’s methods presented in [5,8].
Figure 5. Solution X 2 of the benchmark Equation (9) achieved with the use of a standard approach based on Newton’s methods presented in [5,8].
Mathematics 08 01507 g005
Figure 6. The span function s ( x 1 g r ) of the negative multidimensional solution (root) of the benchmark (9) determined using MF-arithmetic (a) and solution found with a standard approach based on Newton’s method [5,8] (b). (a) MF-arithmetic approach; (b) standard approach based on Newton’s method.
Figure 6. The span function s ( x 1 g r ) of the negative multidimensional solution (root) of the benchmark (9) determined using MF-arithmetic (a) and solution found with a standard approach based on Newton’s method [5,8] (b). (a) MF-arithmetic approach; (b) standard approach based on Newton’s method.
Mathematics 08 01507 g006
Figure 7. The span function s ( x 2 g r ) of the positive root determined by MF-arithmetic (a) and with standard approach using Newton’s method [5,8] (b). (a) MF-arithmetic approach; (b) standard approach.
Figure 7. The span function s ( x 2 g r ) of the positive root determined by MF-arithmetic (a) and with standard approach using Newton’s method [5,8] (b). (a) MF-arithmetic approach; (b) standard approach.
Mathematics 08 01507 g007
Figure 8. All solutions (roots) calculated with multidimensional fuzzy arithmetic (continuous line) and with the standard approach using Newton’s method (dashed line).
Figure 8. All solutions (roots) calculated with multidimensional fuzzy arithmetic (continuous line) and with the standard approach using Newton’s method (dashed line).
Mathematics 08 01507 g008

Share and Cite

MDPI and ACS Style

Kołodziejczyk, J.; Piegat, A.; Sałabun, W. Which Alternative for Solving Dual Fuzzy Nonlinear Equations Is More Precise? Mathematics 2020, 8, 1507. https://doi.org/10.3390/math8091507

AMA Style

Kołodziejczyk J, Piegat A, Sałabun W. Which Alternative for Solving Dual Fuzzy Nonlinear Equations Is More Precise? Mathematics. 2020; 8(9):1507. https://doi.org/10.3390/math8091507

Chicago/Turabian Style

Kołodziejczyk, Joanna, Andrzej Piegat, and Wojciech Sałabun. 2020. "Which Alternative for Solving Dual Fuzzy Nonlinear Equations Is More Precise?" Mathematics 8, no. 9: 1507. https://doi.org/10.3390/math8091507

APA Style

Kołodziejczyk, J., Piegat, A., & Sałabun, W. (2020). Which Alternative for Solving Dual Fuzzy Nonlinear Equations Is More Precise? Mathematics, 8(9), 1507. https://doi.org/10.3390/math8091507

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