Adaptive mesh point selection for the efficient solution of scalar IVPs

DOI10.1007/S11075-017-0304-2zbMATH Open1393.65004arXiv1612.02749OpenAlexW2593248190MaRDI QIDQ679699FDOQ679699

Authors: Bolesław Kacewicz 

Publication date: 19 January 2018

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: We discuss adaptive mesh point selection for the solution of scalar IVPs. We consider a method that is optimal in the sense of the speed of convergence, and 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.

Full work available at URL: https://arxiv.org/abs/1612.02749

Recommendations

• Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems
• scientific article; zbMATH DE number 4090718
• Mesh Selection in Collocation for Boundary Value Problems
• scientific article; zbMATH DE number 59398
• Adaptive recovery of near optimal meshes in the finite element method for parameter dependent problems

zbMATH Keywords

optimalitymesh selectionadaptionIVPs

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50) Error bounds for numerical methods for ordinary differential equations (65L70) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Cites Work

• Title not available (Why is that?)
• Local adaption for approximation and minimization of univariate functions
• Minimum asymptotic error of algorithms for solving ODE
• Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface
• A new mesh selection strategy with stiffness detection for explicit Runge-Kutta methods
• When Not to Use an Automatic Quadrature Routine
• The power of adaptive algorithms for functions with singularities
• Implementation of DIMSIMs for stiff differential systems
• Automatic integration using asymptotically optimal adaptive simpson quadrature
• On sequential and parallel solution of initial value problems

Cited In (4)

• Title not available (Why is that?)
• Adaptive mesh selection asymptotically guarantees a prescribed local error for systems of initial value problems
• Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
• An elementary solution of a minimax problem arising in algorithms for automatic mesh selection

Uses Software

• QUADPACK
• DIFSUB
• ODEPACK

This page was built for publication: Adaptive mesh point selection for the efficient solution of scalar IVPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679699)