Skip to main content
Log in

Adaptive mesh point selection for the efficient solution of scalar IVPs

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

We discuss adaptive mesh point selection for the solution of scalar initial value problems. We consider a method that is optimal in the sense of the speed of convergence, and we aim at minimizing the local errors. Although the speed of convergence cannot be improved by using the adaptive mesh points compared to the equidistant points, we show that the factor in the error expression can be significantly reduced. We obtain formulas specifying the gain achieved in terms of the number of discretization subintervals, as well as in terms of the prescribed level of the local error. Both nonconstructive and constructive versions of the adaptive mesh selection are shown, and a numerical example is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Choi, S.T., Ding, Y., Hickernell, F.J., Tong, X.: Local adaption for approximation and minimization of univariate functions, to appear in Journal Complexity (2017). doi:10.1016/j.jco.2016.11.005

  2. Jackiewicz, Z.: Implementation of DIMSIMs for stiff differential systems. Appl. Numer. Math. 42(1-3), 251–267 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kacewicz, B.: Minimum asymptotic error of algorithms for solving ODE. J. Complex. 4, 373–389 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kacewicz, B.: On sequential and parallel solution of initial value problems. J. Complex. 6, 136–148 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kacewicz, B., Przybyowicz, P.: Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface. J. Complex. 31, 75–97 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  6. Lyness, J.N.: When not to use an automatic quadrature routine? SIAM Rev. 25, 63–87 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mazzia, F., Nagy, A.: A new mesh selection strategy with stiffness detection for explicit Runge-Kutta methods. Appl. Math. Comp. 255, 125–134 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. Piessens, R., De Doncker-Kapenga, E., Überhuber, C. W.: QUADPACK: a subroutine package for automatic integration. Springer (1983). ISBN: 3-540-12553-1

  9. Plaskota, L.: Automatic integration using asymptotically optimal adaptive Simpson quadrature. Numer. Math. 131, 173–198 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  10. Plaskota, L., Wasilkowski, G.W.: The power of adaptive algorithms for functions with singularities. J. Fixed Point Theory Appl. 6, 227–248 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

I thank L. Plaskota and P. Przybyłowicz for their comments on the manuscript. This research was partly supported by the Polish Ministry of Science and Higher Education.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bolesław Kacewicz.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kacewicz, B. Adaptive mesh point selection for the efficient solution of scalar IVPs. Numer Algor 77, 57–75 (2018). https://doi.org/10.1007/s11075-017-0304-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-017-0304-2

Keywords

Mathematics Subject Classification (2010)

Navigation