Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information

DOI10.1016/j.jco.2018.02.002zbMath1446.65039arXiv1709.09951OpenAlexW3106520470MaRDI QIDQ1635841

Bolesław Kacewicz

Publication date: 1 June 2018

Published in: Journal of Complexity (Search for Journal in Brave)

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

zbMATH Keywords

complexity boundsworst case settingnonadaptive informationsystems of initial-value problems

Mathematics Subject Classification ID

Numerical methods for initial value problems involving ordinary differential equations (65L05) Complexity and performance of numerical algorithms (65Y20) Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50)

Uses Software

• QUADPACK

Cites Work

• A new mesh selection strategy with stiffness detection for explicit Runge-Kutta methods
• Automatic integration using asymptotically optimal adaptive simpson quadrature
• Adaptive mesh point selection for the efficient solution of scalar IVPs
• On sequential and parallel solution of initial value problems
• Optimal solution of ordinary differential equations
• Implementation of DIMSIMs for stiff differential systems
• Local adaption for approximation and minimization of univariate functions
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information