آمار
| تعداد نشریات | 44 |
| تعداد شماره‌ها | 1,323 |
| تعداد مقالات | 16,270 |
| تعداد مشاهده مقاله | 52,954,458 |
| تعداد دریافت فایل اصل مقاله | 15,625,032 |
A New Three-Step Optimal Without Memory Iterative Scheme for Solving Non-Linear Equations with Basins of Attraction | ||
| Computational Methods for Differential Equations | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 27 شهریور 1403 اصل مقاله (1.03 M) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22034/cmde.2024.59161.2514 | ||
| نویسندگان | ||
| Shahid Adullah* ؛ Neha Choubey؛ Suresh Dara | ||
| School of Advanced Sciences and Languages, VIT Bhopal University, Kothri-Kalan, Sehore, 466114, MP, India. | ||
| چکیده | ||
| The primary focus of this study is to introduce a new three-step iterative method without memory for root-finding by merging two different existing techniques. Based on the computational cost, the proposed method acquires optimal eight-order convergence with four functional evaluations (three evaluations for the function and one computation of first derivative). Furthermore, the suggested scheme supports the Kung Traub’s Conjecture with efficiency index of 1.682. We also established the convergence criteria developed for the root-finding technique and demonstrate the fact that the suggested approach is eighth-order convergent. In order to demonstrate the efficacy as well as application of the constructed root-finding technique, we addressed a few practical engineering models and some non-linear functions. In contrast to several existing approaches, this particular method converges more quickly. Finally, several forms of complex functions are taken into consideration under basins of attraction in order to observe the overall fractal behavior of the proposed technique | ||
| کلیدواژه‌ها | ||
| Iterative Method؛ Non-Linear Equation؛ Gauss quadrature formula؛ Order of Convergence؛ Basin of attraction | ||
|
آمار تعداد مشاهده مقاله: 110 تعداد دریافت فایل اصل مقاله: 155 |
||