Triangular intuitionistic fuzzy linear system of equations with applications: an analytical approach

Creative Commons License

Kausar N.

INVERSE PROBLEMS IN SCIENCE AND ENGINEERING, cilt.32, ss.1-46, 2024 (Scopus)

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 32
  • Basım Tarihi: 2024
  • Dergi Adı: INVERSE PROBLEMS IN SCIENCE AND ENGINEERING
  • Derginin Tarandığı İndeksler: Scopus, Academic Search Premier, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.1-46
  • Yıldız Teknik Üniversitesi Adresli: Evet

Özet

This study extended an existing semi-analytical technique, the Homotopy Perturbation Method, to the Block Homotopy Modified Perturbation Method by solving two n×n crisp triangular intuitionistic fuzzy (TIF) systems of linear equations. In the original system, the coefficient matrix is considered as real crisp, while the unknown variable vector and right hand side vector are regarded as triangular intuitionistic fuzzy numbers. The Block Homotopy Modified Perturbation Method is found to be efficient and practical to solve n×n TIF linear systems as it only requires the non-singularity of the n×n TIF linear system's coefficient matrix, whereas the point Homotopy Perturbation Method and other classical numerical iterative methods typically require non-zero diagonal entries in the coefficient matrix. A set of theorems relevant to this study are presented and demonstrated. We solve an engineering application, i.e. a current flow circuit problem that is represented in terms of a triangular intuitionistic fuzzy environment, using the suggested method. The unknown current is then obtained as a triangle intuitionistic fuzzy number. The proposed semi-analytic method is used to solve some numerical test problems in order to validate their performance and efficiency in comparison to other existing techniques. The numerical results of the example are displayed on graphs with different degrees of uncertainty. The efficiency and accuracy of the proposed method are further demonstrated by comparisons to block Jacobi, Adomain Decomposition method, Successive Over-Relaxation method and the classical Gauss-Seidel numerical method.