Abstract
We study potential advantages of adaptive mesh point selection for the solution of systems of initial value problems. For an optimal order discretization method, we propose an algorithm for successive selection of the mesh points, which only requires evaluations of the right-hand side function. The selection (asymptotically) guarantees that the maximum local error of the method does not exceed a prescribed level. The usage of the algorithm is not restricted to the chosen method; it can also be applied with any method from a general class. We provide a rigorous analysis of the cost of the proposed algorithm. It is shown that the cost is almost minimal, up to absolute constants, among all mesh selection algorithms. For illustration, we specify the advantage of the adaptive mesh over the uniform one. Efficiency of the adaptive algorithm results from automatic adjustment of the successive mesh points to the local behavior of the solution. Some numerical results illustrating theoretical findings are reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Choi, S.T., Ding, Y., Hickernell, F., Tong, X.: Local adaption for approximation and minimization of univariate functions. J. Complex. 40, 17–33 (2017). https://doi.org/10.1016/j.jco.2016.11.005
Daun, T.: On the randomized solution of initial value problems. J. Complex. 27, 300–311 (2011)
Jackiewicz, Z.: Implementation of DIMSIMs for stiff differential systems. Appl. Numer. Math. 42(1-3), 251–267 (2002)
Kacewicz, B.: Adaptive mesh point selection for the efficient solution of scalar IVPs, to appear in Numerical Algorithms (2017). https://doi.org/10.1007/s11075-017-0304-2
Kacewicz, B., Przybyowicz, P.: Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface. J. Complex. 31, 75–97 (2015)
Lyness, J.N.: When not to use an automatic quadrature routine?. SIAM Rev. 25, 63–87 (1983)
Mazzia, F., Nagy, A.: A new mesh selection strategy with stiffness detection for explicit Runge Kutta methods. Appl. Math. Comp. 255, 125–134 (2015)
Piessens, R., De Doncker-Kapenga, E., Überhuber, C.W.: QUADPACK: a subroutine package for automatic integration, Springer, ISBN: 3-540-12553-1 (1983)
Plaskota, L.: Automatic integration using asymptotically optimal adaptive Simpson quadrature. Numer. Math. 131, 173–198 (2015)
Plaskota, L., Wasilkowski, G.W.: The power of adaptive algorithms for functions with singularities. J. Fixed Point Theory Appl. 6, 227–248 (2009)
Wilga, B.: Adaptive mesh selection in the numerical solution of IVPs. In: Polish, master’s thesis supervised by B. Kacewicz, Faculty of Applied Mathematics, AGH University of Science and Technology, Cracow, Poland, in preparation (2017)
Acknowledgments
This research was partly supported by the Polish NCN grant - decision No. DEC-2017/25/B/ST1/00945 and by the Polish Ministry of Science and Higher Education.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: Long Chen
Rights and permissions
About this article
Cite this article
Kacewicz, B. Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems. Adv Comput Math 44, 1325–1344 (2018). https://doi.org/10.1007/s10444-017-9584-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10444-017-9584-2