An adaptive stepsize algorithm for the numerical solving of initial-value problems
Publié en ligne: 04 avr. 2017
Pages: 185 - 198
Reçu: 02 mai 2014
Accepté: 28 juin 2014
DOI: https://doi.org/10.1515/auom-2015-0012
Mots clés
© 2015 Romulus Militaru, published by De Gruyter Open
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
The present paper focuses on the efficient numerical solving of initial-value problems (IVPs) using digital computers and one-step numerical methods. We start from considering that the integration stepsize is the crucial factor in determining the number of calculations required and the amount of work involved to obtain the approximate values of the exact solution of a certain problem for a given set of points, within a prescribed computational accuracy, is proportional to the number of accomplished iterations. We perform an analysis of the local truncation error and we derive an adaptive stepsize algorithm which coupled with a certain one-step numerical method makes the use of this structure more computationally effective and insures that the estimated values of the exact solution are in agreement with an imposed accuracy. We conclude with numerical computations proving the efficiency of the proposed step selection algorithm.