An adaptive stepsize algorithm for the numerical solving of initial-value problems

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Militaru, R. (2015). An adaptive stepsize algorithm for the numerical solving of initial-value problems. Analele Stiintifice Ale Universitatii Ovidius Constanta, Seria Matematica, 23(1), 185–198. https://doi.org/10.1515/auom-2015-0012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free