SOME NEW COMPUTATIONAL METHODS TO SOLVE DUAL FULLY FUZZY LINEAR SYSTEM OF ARBITRARY TRIANGULAR FUZZY NUMBERS

2013 ◽  
Vol 09 (01) ◽  
pp. 13-26 ◽  
Author(s):  
AMIT KUMAR ◽  
BABBAR NEETU ◽  
ABHINAV BANSAL

In this paper, we discuss two new computational techniques for solving a generalized fully fuzzy linear system (FFLS) with arbitrary triangular fuzzy numbers (m,α,β). The methods eliminate the non-negative restriction on the fuzzy coefficient matrix that has been considered by almost every method in the literature and relies on the decomposition of the dual FFLS into a crisp linear system that can be further solved by a variety of classical methods. To illustrate the proposed methods, numerical examples are solved and the obtained results are discussed. The methods pose several advantages over the existing methods to solve a simple or dual FFLS.

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Esmaeil Siahlooei ◽  
Seyed Abolfazl Shahzadeh Fazeli

We present a method for solving fully fuzzy linear systems using interval aspects of fuzzy numbers. This new method uses a decomposition technique to convert a fully fuzzy linear system into two types of decomposition in the form of interval matrices. It finds the solution of a fully fuzzy linear system by using interval operations. This new method uses interval arithmetic and two new interval operations ⊖ and ⊘. These new operations, which are inverses of basic interval operations + and ×, will be presented in the middle of this paper. Some numerical examples are given to illustrate the ability of proposed methods.


2021 ◽  
Author(s):  
Ahmed Elsayed ◽  
Nazihah Ahmad ◽  
Ghassan Malkawi

Abstract Almost every existing method for solving trapezoidal fully fuzzy Sylvester matrix equation restricts the coefficient matrix and the solution to be positive fuzzy numbers only. In this paper, we develop new analytical methods to solve a trapezoidal fully fuzzy Sylvester matrix equation with restricted and unrestricted coefficients. The trapezoidal fully fuzzy Sylvester matrix equation is transferred to a system of crisp equations based on the sign of the coefficients by using Ahmd arithmetic multiplication operations between trapezoidal fuzzy numbers. The constructed method not only obtain a simple crisp system of linear equation that can be solved by any classical methods but also provide a widen the scope of the trapezoidal fully fuzzy Sylvester matrix equation in scientific applications. Furthermore, these methods have less steps and conceptually easy to understand when compared with existing methods. To illustrate the proposed methods numerical examples are solved.


2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Kumar Dookhitram ◽  
Sameer Sunhaloo ◽  
Nisha Rambeerich ◽  
Arshad Peer ◽  
Aslam Saib

2013 ◽  
Vol 17 (9) ◽  
pp. 1725-1731 ◽  
Author(s):  
S. Moloudzadeh ◽  
T. Allahviranloo ◽  
P. Darabi

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
H. Saberi Najafi ◽  
S. A. Edalatpanah

We consider a class of fuzzy linear system of equations and demonstrate some of the existing challenges. Furthermore, we explain the efficiency of this model when the coefficient matrix is an H-matrix. Numerical experiments are illustrated to show the applicability of the theoretical analysis.


Sign in / Sign up

Export Citation Format

Share Document