Modified Iterative Methods for Solving Fully Fuzzy Linear Systems

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.

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.


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):  
Abbas Akrami ◽  
Majid Erfanian

Real life applications arising in various fields of engineering and science (e.g. electrical, civil, economics, dietary, etc.) can be modelled using a system of linear equations. In such models, it may happen that the values of the parameters are not known or they cannot be stated precisely and that only their estimation due to experimental data or experts knowledge is available. In such a situation it is convenient to represent such parameters by fuzzy numbers. In this paper we propose an efficient optimization model for obtaining a weak fuzzy solution to fuzzy linear systems (FLS). We solve some examples and we show that this method is always efficient.


1952 ◽  
Vol 19 (2) ◽  
pp. 141-146
Author(s):  
Chih-Bing Ling

Abstract In a previous paper by the author (1), a theoretical solution for a notched strip under longitudinal tension is given. The result demands the solution of an infinite system of linear equations. A considerable amount of labor is involved in solving such a system. It seems, however, that the labor can be diminished by adapting to the solution a process known as the promotion of rank. In this paper such a process is described and then applied to solve the problem of a notched strip under transverse bending. The solution of this problem seems also to be new. The numerical results obtained are compared graphically with the experimental results available.


2017 ◽  
Vol 7 (1) ◽  
pp. 101-115 ◽  
Author(s):  
Rui-Ping Wen ◽  
Su-Dan Li ◽  
Guo-Yan Meng

AbstractThere has been a lot of study on the SOR-like methods for solving the augmented system of linear equations since the outstanding work of Golub, Wu and Yuan (BIT 41(2001)71-85) was presented fifteen years ago. Based on the SOR-like methods, we establish a class of accelerated SOR-like methods for large sparse augmented linear systems by making use of optimization technique, which will find the optimal relaxation parameter ω by optimization models. We demonstrate the convergence theory of the new methods under suitable restrictions. The numerical examples show these methods are effective.


2018 ◽  
Vol 63 ◽  
pp. 248-257 ◽  
Author(s):  
Mustafa Gaja ◽  
Olga Gorynina

In this paper we investigate the feasibility of applying the Parareal algorithm [5, 6] for quasi-static nonlinear structural analysis problems. We describe how this proposal has been realized and present some preliminary numerical results of applying this algorithm to a beam undergoing nonlinear deflection with a contact boundary condition. Further numerical experiments are needed to provide an evidence for the effciency of the 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-7 ◽  
Author(s):  
Na Huang ◽  
Changfeng Ma

We present two inversion-free iterative methods for computing the maximal positive definite solution of the equationX+AHX-1A+BHX-1B=I. We prove that the sequences generated by the two iterative schemes are monotonically increasing and bounded above. We also present some numerical results to compare our proposed methods with some previously developed inversion-free techniques for solving the same matrix equation.


Sign in / Sign up

Export Citation Format

Share Document