Certain efficient iterative methods for bipolar fuzzy system of linear equations

2020 ◽  
Vol 39 (3) ◽  
pp. 3971-3985 ◽  
Author(s):  
Muhammad Saqib ◽  
Muhammad Akram ◽  
Shahida Bashir

A bipolar fuzzy set model is an extension of fuzzy set model. We develop new iterative methods: generalized Jacobi, generalized Gauss-Seidel, refined Jacobi, refined Gauss-seidel, refined generalized Jacobi and refined generalized Gauss-seidel methods, for solving bipolar fuzzy system of linear equations(BFSLEs). We decompose n ×  n BFSLEs into 4n ×  4n symmetric crisp linear system. We present some results that give the convergence of proposed iterative methods. We solve some BFSLEs to check the validity, efficiency and stability of our proposed iterative schemes. Further, we compute Hausdorff distance between the exact solutions and approximate solution of our proposed schemes. The numerical examples show that some proposed methods converge for the BFSLEs, but Jacobi and Gauss-seidel iterative methods diverge for BFSLEs. Finally, comparison tables show the performance, validity and efficiency of our proposed iterative methods for BFSLEs.

Author(s):  
Laxminarayan Sahoo

This chapter deals with solution methodology of fuzzy system of linear equations (FSLEs). In fuzzy set theory, finding solutions of FLSEs has long been a well-known problem to the researchers. In this chapter, the fuzzy number has been converted into interval number, and the authors have solved the interval system of linear equation for finding the fuzzy valued solution. Here, a fuzzy valued linear system has been introduced and a numerical example has been solved and presented for illustration of purpose.


Fuzzy Systems ◽  
2017 ◽  
pp. 55-73
Author(s):  
S. A. Edalatpanah

In the present chapter, we give an overview of computational iterative schemes for fuzzy system of linear equations. We also consider fully fuzzy linear systems (FFLS) and demonstrate a class of the existing iterative methods using the splitting approach for calculating the solution. Furthermore, the main aim in this work is to design a numerical procedure for improving this algorithm. Some numerical experiments are illustrated to show the applicability of the methods and to show the efficiency of proposed algorithm, we report the numerical results of large-scaled fuzzy problems.


2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Reza Kargar ◽  
Tofigh Allahviranloo ◽  
Mohsen Rostami-Malkhalifeh ◽  
Gholam Reza Jahanshaloo

This paper proposes a new method for solving fuzzy system of linear equations with crisp coefficients matrix and fuzzy or interval right hand side. Some conditions for the existence of a fuzzy or interval solution ofm×nlinear system are derived and also a practical algorithm is introduced in detail. The method is based on linear programming problem. Finally the applicability of the proposed method is illustrated by some numerical examples.


Author(s):  
S. A. Edalatpanah

In the present chapter, we give an overview of computational iterative schemes for fuzzy system of linear equations. We also consider fully fuzzy linear systems (FFLS) and demonstrate a class of the existing iterative methods using the splitting approach for calculating the solution. Furthermore, the main aim in this work is to design a numerical procedure for improving this algorithm. Some numerical experiments are illustrated to show the applicability of the methods and to show the efficiency of proposed algorithm, we report the numerical results of large-scaled fuzzy problems.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mohsen Alipour ◽  
Dumitru Baleanu ◽  
Fereshteh Babaei

We introduce a new combination of Bernstein polynomials (BPs) and Block-Pulse functions (BPFs) on the interval [0, 1]. These functions are suitable for finding an approximate solution of the second kind integral equation. We call this method Hybrid Bernstein Block-Pulse Functions Method (HBBPFM). This method is very simple such that an integral equation is reduced to a system of linear equations. On the other hand, convergence analysis for this method is discussed. The method is computationally very simple and attractive so that numerical examples illustrate the efficiency and accuracy of this method.


Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 850
Author(s):  
Nasser Mikaeilvand ◽  
Zahra Noeiaghdam ◽  
Samad Noeiaghdam ◽  
Juan J. Nieto

The aim of this research is to apply a novel technique based on the embedding method to solve the n × n fuzzy system of linear equations (FSLEs). By using this method, the strong fuzzy number solutions of FSLEs can be obtained in two steps. In the first step, if the created n × n crisp linear system has a non-negative solution, the fuzzy linear system will have a fuzzy number vector solution that will be found in the second step by solving another created n × n crisp linear system. Several theorems have been proved to show that the number of operations by the presented method are less than the number of operations by Friedman and Ezzati’s methods. To show the advantages of this scheme, two applicable algorithms and flowcharts are presented and several numerical examples are solved by applying them. Furthermore, some graphs of the obtained results are demonstrated that show the solutions are fuzzy number vectors.


2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Xiaobin Guo ◽  
Dequan Shang

The approximate solution ofnth-order fuzzy linear differential equations in which coefficient functions maintain the sign is investigated by the undetermined fuzzy coefficients method. The differential equations is converted to a crisp function system of linear equations according to the operations of fuzzy numbers. The fuzzy approximate solution of the fuzzy linear differential equation is obtained by solving the crisp linear equations. Some numerical examples are given to illustrate the proposed method. It is an extension of Allahviranloo's results.


Author(s):  
David Ek ◽  
Anders Forsgren

AbstractThe focus in this paper is interior-point methods for bound-constrained nonlinear optimization, where the system of nonlinear equations that arise are solved with Newton’s method. There is a trade-off between solving Newton systems directly, which give high quality solutions, and solving many approximate Newton systems which are computationally less expensive but give lower quality solutions. We propose partial and full approximate solutions to the Newton systems. The specific approximate solution depends on estimates of the active and inactive constraints at the solution. These sets are at each iteration estimated by basic heuristics. The partial approximate solutions are computationally inexpensive, whereas a system of linear equations needs to be solved for the full approximate solution. The size of the system is determined by the estimate of the inactive constraints at the solution. In addition, we motivate and suggest two Newton-like approaches which are based on an intermediate step that consists of the partial approximate solutions. The theoretical setting is introduced and asymptotic error bounds are given. We also give numerical results to investigate the performance of the approximate solutions within and beyond the theoretical framework.


2016 ◽  
Vol 47 (2) ◽  
pp. 179-192
Author(s):  
Tesfaye Kebede Enyew

In this paper, a Second degree generalized Jacobi Iteration method for solving system of linear equations, $Ax=b$ and discuss about the optimal values $a_{1}$ and $b_{1}$ in terms of spectral radius about for the convergence of SDGJ method of $x^{(n+1)}=b_{1}[D_{m}^{-1}(L_{m}+U_{m})x^{(n)}+k_{1m}]-a_{1}x^{(n-1)}.$ Few numerical examples are considered to show that the effective of the Second degree Generalized Jacobi Iteration method (SDGJ) in comparison with FDJ, FDGJ, SDJ.


Sign in / Sign up

Export Citation Format

Share Document