دوره 18، شماره 1 - ( 2-1402 )                   جلد 18 شماره 1 صفحات 129-109 | برگشت به فهرست نسخه ها


XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Bsiss L, Ziti C. An Optimal Algorithm for the δ-ziti Method to Solve Some Mathematical Problems. IJMSI 2023; 18 (1) :109-129
URL: http://ijmsi.ir/article-1-1298-fa.html
An Optimal Algorithm for the δ-ziti Method to Solve Some Mathematical Problems. مجله علوم ریاضی و انفورماتیک. 1402; 18 (1) :109-129

URL: http://ijmsi.ir/article-1-1298-fa.html


چکیده:  
The numerical approximation methods of the differential problems solution are numerous and various. Their classifications are based on several criteria: Consistency, precision, stability, convergence, dispersion, diffusion, speed and many others. For this reason a great interest must be given to the construction and the study of the associated algorithm: indeed the algorithm must be simple, robust, less expensive and fast. In this paper, after having recalled the δ-ziti method, we reformulat it to obtain an algorithm that does not require as many calculations as many nodes knowing that they are counted by thousands. We have, therefore, managed to optimize the number of iterations by passing for example from 103 at 10 iterations.
نوع مطالعه: پژوهشي | موضوع مقاله: عمومى

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
CAPTCHA

بازنشر اطلاعات
Creative Commons License این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است.

کلیه حقوق این وب سایت متعلق به نشریه علوم ریاضی و انفورماتیک می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2023 CC BY-NC 4.0 | Iranian Journal of Mathematical Sciences and Informatics

Designed & Developed by : Yektaweb