期刊名称：Computational Methods in Science and Technology
印刷版ISSN：1505-0602
出版年度：2019
卷号：25
期号：1
页码：17-30
DOI：10.12921/cmst.2019.0000006
出版社：Poznan Supercomputing and Networking Center
摘要：In a number of our previous papers we have presented interval versions of Runge-Kutta methods (explicit and implicit) in which the step size was constant. Such an approach has required to choose manually the step size in order to ensure an interval enclosure to the solution with the smallest width. In this paper we propose an algorithm for choosing automatically the step size which guarantees the best (i.e., the tiniest) interval enclosure. This step size is determined with machine accuracy.
