Uzawa Algorithms for Fully Fuzzy Linear Systems
- DOI
- 10.1080/18756891.2016.1237194How to use a DOI?
- Keywords
- FFLS; Uzawa; iterative methods; trapezoidal fuzzy numbers; fuzzy systems
- Abstract
Recently, there have been many studies on solving different kinds of fuzzy equations. In this paper, the solution of a trapezoidal fully fuzzy linear system (FFLS) is studied. Uzawa approach, which is a popular iterative technique for saddle point problems, is considered for solving such FFLSs. In our Uzawa approach, it is possible to compute the solution of a fuzzy system using various relaxation iterative methods such as Richardson, Jacobi, Gauss-Seidel, SOR, SSOR as well as Krylov subspace methods such as GMRES, QMR and BiCGSTAB. Krylov subspace iterative methods are known to converge for a larger class of matrices than relaxation iterative methods and they exhibit higher convergence rates. Thus, they are more widely used in practical problems. Numerical experiments are to illustrate the performance of our suggested methods.
- Copyright
- © 2016. the authors. Co-published by Atlantis Press and Taylor & Francis
- Open Access
- This is an open access article under the CC BY-NC license (http://creativecommons.org/licences/by-nc/4.0/).
Download article (PDF)
View full text (HTML)
Cite this article
TY - JOUR AU - H. Zareamoghaddam AU - A.T. Chronopoulos AU - M. Nouri Kadijani AU - Z. Zareamoghaddam PY - 2016 DA - 2016/09/01 TI - Uzawa Algorithms for Fully Fuzzy Linear Systems JO - International Journal of Computational Intelligence Systems SP - 971 EP - 983 VL - 9 IS - 5 SN - 1875-6883 UR - https://doi.org/10.1080/18756891.2016.1237194 DO - 10.1080/18756891.2016.1237194 ID - Zareamoghaddam2016 ER -