Abstract
Instead of using standard analytical techniques, like Buckley and Qu method, which are not suitable for solving a system of fuzzy nonlinear equations where the coefficient is fuzzy number, Broyden's method is proposed for solving fuzzy nonlinear equations. In this paper, an eight-step algorithm is used to solve fuzzy nonlinear equations. Two numerical examples are given to illustrate the proposed method.
1. Introduction
Over time, nonlinear equations have been played a major role in engineering, mathematics, medicines, and robotics.One of the applications in nonlinear problem is in weather which is inherently nonlinear in nature. Another interesting nonlinear problem is in phenomenon such as chaos arises from the difficulties of solving nonlinear equations. Consider the set of nonlinear equations The general form of the nonlinear equation for may be simply stated as finding a value of the variable such that where and was denoted by is any nonlinear function of . The value of is then called a solution or root of this equation and may be just one of many equations.
Numerical approximation methods are usually needed in solving system of equations when the equation is nonlinear. Solving a system of nonlinear equations is a problem that is avoided when possible, usually by approximating the nonlinear systems by a system of linear equations. But when this is unsatisfactory, the problem must be solved directly [1].
However, in most applications, the parameters of the system of nonlinear and measurement are not always represented by crisp number but also by fuzzy numbers. Hence, it is necessary to study numerical method for solving fuzzy nonlinear equations. The concept of fuzzy number arises from the fact that many quantifiable phenomena do not lend themselves to being characterized in terms of absolutely precise numbers [2]. For example, standard analytical techniques proposed by [3] could not be suitable to solve the fuzzy nonlinear equations such as(i)(ii)(iii)
where , and are fuzzy numbers. Therefore, numerical methods for solving the above type equations are needed to be studied. In the study by [4–6], Newton’s method and Steepest Descent’s method were used to solve this type of equations.
The disadvantages of Newton’s method arise from the need to calculate and invert the Jacobian matrix at each iteration. Even Newton’s method can converge very rapidly once a good initial value obtained, but it is not always easy to determine this kind of value and also this method is comparatively expensive to employ [1]. Although Steepest Descent’s method does not require a good initial value its weakness is that it has low speed of convergence.
In this study, Broyden’s method is proposed to solve this kind of equation. Broyden’s method is superlinearly convergent. This method was chosen due to its being a powerful alternative to Newton’s method, and hence it reduces the amount of calculation at each iteration without significantly degrading the speed of convergence. It replaces the Jacobian matrix with a matrix whose inverse is directly determined at each iteration, and it reduces the arithmetic operation form to [1]. Specifically the objective of this paper is to apply Broyden’s method in solving fuzzy nonlinear equations.
Section 2 begins with some basic definition about fuzzy numbers and a brief overview of the fuzzy nonlinear equations. Section 3 describes definition of Broyden’s method. Section 4 defines Broyden’s method for solving nonlinear equations. Two numerical examples to illustrate the proposed method are given in Section 5. This paper ends with a short conclusion in Section 6.
2. Preliminaries
In this section, some important definitions of fuzzy numbers are reviewed.
2.1. Fuzzy Number
Fuzzy numbers are of great importance in fuzzy systems. The fuzzy numbers usually used in applications are the triangular (shaped) and the trapezoidal (shaped) fuzzy numbers [7].
Definition 1 (see [8, 9]). A fuzzy number is set like which satisfies the following: is upper semicontinuous, is outside some interval ,there are real numbers such that : is monotonic increasing on , is monotonic decreasing on ,.The set of all these fuzzy numbers is denoted by . An equivalent parametric is also given in [10].
Definition 2 (see [8, 9]). Fuzzy number u in parametric form is a pair of functions , which satisfies the following requirements: is a bounded monotonic increasing left continuous function, is a bounded monotonic decreasing left continuous function,
Definition 3 (see [8, 9]). Triangular fuzzy number is a popular fuzzy number with the membership function where and hence its parametric form is
Let be the set of all trapezoidal fuzzy numbers. The addition and scalar multiplication of fuzzy numbers are defined by the extension principle and can be equivalently represented as follows [4–6].
For arbitrary and , the addition and multiplication by real number are defined as
The Definitions 1, 2, and 3 are parameters of fuzzy nonlinear equations. In the next section, Broyden’s method and its properties are presented.
3. Broyden’s Method
Broyden’s method is a method for solving the system of nonlinear equation and is designed to improve Newton’s method with respect to storage and approximation of the Jacobian. Broyden’s method is generalization of the secant method to multiple dimensions [1]. Once the initial value is obtained, then the next approximation is calculated as the same manner as Newton’s method. In order to obtain , the Secant method uses the finite difference approximation as a replacement for in Newton’s method by considering as a vector, and corresponding quotient is undefined. In Broyden’s method, the Jacobian matrix is replaced by matrix as follows: Any nonzero vector in can be written as the sum of a multiple of . How it acts on the orthogonal complement of is needed to be specified first in order to define the matrix as follows: Thus, any vector orthogonal to is unaffected by the updated form , which was used to compute . is defined by (7) and (8) as To determine , the matrix is replaced by as follows: Once the is determined, then the new approximation is obtained by executing the following where and . Hence, the number of scalar functional evaluations is reduced from to (those required for evaluating , but calculations are still required to solve the associated linear system: The reduction form the quadratic convergence of Newton’s method to superlinearly convergence can be improved by employing a matrix inversion formula of Sherman and Morrison [1].
Theorem 1 (see [1]. Sherman-Morrison). Let be a nonsingular matrix and let and be vectors, then is nonsingular, provided that , and In order to eliminate the computation matrix inversion with each iteration, the Sherman-Morrison states that can be computed directly from by using this formula where and .
The following theorem defines that the Broyden’ method make the smallest possible changes in updating the Jacobian.
Theorem 2 (see [11]). Among all matrices satisfying , the matrix minimizes the difference .
Proof. By properties of the Euclidean norm and for any vectors , we have Therefore,
Theorem 3 (see [12]). Suppose that the assumptions of Kantorovich’s Theorem hold. Then there exist positive constants and s.t. if the starting point and the starting approximate Jacobian satisfy then the sequence generated by Broyden’s method will converge superlinearly to .
As stated previously, Broyden’s method is a method for solving nonlinear equations. Next, tested Broyden’s method is tested on solving fuzzy nonlinear equations.
4. Broyden’s Method for Solving Fuzzy Nonlinear Equations
Now the objective is to obtain a solution for fuzzy nonlinear equations . The parametric form is given as follows. To solve the nonlinear system , one initial approximation is given, and then generate a sequence which converges to the solution , that is, . The method of Broyden’s Newton can be described as follows:
Step 1. Transform the fuzzy nonlinear equations into parametric form.
Step 2. Solve the above system for and in order to obtain the initial value, .
Step 3. Substitute into parametric form
Step 4. Compute the initial Jacobian matrix Use it to compute the first approximation using Newton's method. Let then For , suppose that has been obtained, then use the following steps to obtain .
Step 5. Evaluate the function
Step 6. Update the approximate Jacobian using and , for .
Step 7. Use Sherman-Morrison formula to compute as follows:
Step 8. Solve the linear system for .
Step 9. Repeat Steps from 4 to 8 and continue with the next until tolerance criteria are satisfied.
5. Numerical Application
Two examples are proposed to illustrate the Broyden’s method for solving fuzzy nonlinear equations.
Consider the example from [4, 6].
Example 1. consider
Assume that is positive, without any loss of generality, then the parametric form of this equation is as follows [4, 6]:
or equality
The above system needs initial values as follows.For
For :
Hence, and . Suppose that is negative, where and . For , therefore, negative root does not exist.
For initial value, one can use the fuzzy number
As can be observed, the above initial value is too close to the true solution. So this value can be taken as an actual solution. Therefore in this paper, another initial value is proposed in order to show the efficiency of the proposed method. Hence, the initial value is . However, other initial values also can be used, but the suggested value is more reasonable to be used because Broyden’s method needs a good initial value near to the exact solution that will lead to the true solution. Initially, parametric form can be written as follows:
Then substitute into parametric form. First iteration for Broyden’s method is similar to the iteration for Newton’s method. The Jacobian matrix for this fuzzy equation is
Let and
Since
Let , then
In the next step, is used to compute . In Broyden’s method, the Jacobian matrix is denoted by matrix , and it can be computed directly from by using this formula
where and for . Repeat Steps from 4 to 8 until it satisfies the tolerance . After three iterations, the solution was obtained with maximum error . Details of the solution from are given in Figure 1.
Figure 1 shows that Broyden’s method can converge very rapidly to a solution once initial value is obtained which is sufficiently close to true solution. The solution is obtained after two iterations with the maximum error less than .
Now the second example is proposed.
Example 2. consider
Assume that is positive, without any loss of generality, then the parametric form of this equation is as follows [4, 6]:
or equality
In order to obtain initial guess, we use above system. For ,
For :
Hence, and . For initial guess, one can use the fuzzy number:
Consequently, the initial guess is .
Similar to the arguments in Example 1, the initial value above is too near to the true solution. Hence, other initial value is proposed as but other initial values may also be able to be tested as follows:
Then the above equations are solved by using Steps from 3 to 8 until the solution is obtained within the maximum error . Details of the solution for are shown in Figure 2.
This figure illustrates how Broyden’s method converges very rapidly to a solution, once initial value is obtained which is sufficiently close to true solution. However, it is not easy to determine initial values that will lead to a solution. Poor initial values may not lead to the actual solution. The solution using Broyden’s method is obtained after three iterations with the maximum error less than .
6. Conclusion
In this paper, Broyden’s method has been applied for solving fuzzy nonlinear equations. Firstly, fuzzy nonlinear equations are written in parametric form and then are solved using Broyden’s method. The proposed eight steps algorithm yields the solution with maximum error less than . Two numerical examples have proven the feasibility of Broyden’s method in solving fuzzy nonlinear equations.