Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation

Creative Commons License

Shams M., Rafiq N., Kausar N., Agarwal P., Park C., Momani S.

ADVANCES IN DIFFERENCE EQUATIONS, cilt.2021, sa.1, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 2021 Sayı: 1
  • Basım Tarihi: 2021
  • Doi Numarası: 10.1186/s13662-021-03649-6
  • Dergi Adı: ADVANCES IN DIFFERENCE EQUATIONS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Communication Abstracts, Metadex, zbMATH, Directory of Open Access Journals, Civil Engineering Abstracts
  • Anahtar Kelimeler: Multiple roots, Polynomial equation, Iterative methods, Simultaneous methods, Computational efficiency and CPU-time, SIMULTANEOUS APPROXIMATION, CONVERGENCE, ZEROS
  • Yıldız Teknik Üniversitesi Adresli: Hayır

Özet

Two new iterative methods for the simultaneous determination of all multiple as well as distinct roots of nonlinear polynomial equation are established, using two suitable corrections to achieve a very high computational efficiency as compared to the existing methods in the literature. Convergence analysis shows that the orders of convergence of the newly constructed simultaneous methods are 10 and 12. At the end, numerical test examples are given to check the efficiency and numerical performance of these simultaneous methods.