An Optimal Algorithm for the δ-ziti Method to Solve Some Mathematical Problems

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.