article · Iranian Journal of Mathematical Sciences and Informatics
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 10 3 at 10 iterations.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.52547/ijmsi.18.1.109
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
