An efficient step size selection for ODE codes

In this study, we introduce a refined method for ascertaining error estimations in numerical simulations of dynamical systems via an innovative application of composition techniques. Our approach involves a dual application of a basic one-step numerical method of order p in this part, and for the class of Backward Difference Formulas schemes in the second part [Deeb A., Dutykh D. and AL Zohbi M. Error estimation for numerical approximations of ODEs via composition techniques....

We propose a practical implementation of high-order fully implicit Runge-Kutta(IRK) methods in a multiple precision floating-point environment. Although implementations based on IRK methods in an IEEE754 double precision environment have been reported as RADAU5 developed by Hairer and SPARK3 developed by Jay, they support only 3-stage IRK families. More stages and higher-order IRK formulas must be adopted in order to decrease truncation errors, which become relatively larger ...

Two-step predictor/corrector methods are provided to solve three classes of problems that present themselves as systems of ordinary differential equations (ODEs). In the first class, velocities are given from which displacements are to be solved. In the second class, velocities and accelerations are given from which displacements are to be solved. And in the third class, accelerations are given from which velocities and displacements are to be solved. Two-step methods are not...

Many problems in science and engineering require an efficient numerical approximation of integrals or solutions to differential equations. For systems with rapidly changing dynamics, an equidistant discretization is often inadvisable as it either results in prohibitively large errors or computational effort. To this end, adaptive schemes, such as solvers based on Runge--Kutta pairs, have been developed which adapt the step size based on local error estimations at each step. W...

This paper presents a sequence of deferred correction (DC) schemes built recursively from the implicit midpoint scheme for the numerical solution of general first order ordinary differential equations (ODEs). It is proven that each scheme is A-stable, satisfies a B-convergence property, and that the correction on a scheme DC(2j) of order 2j of accuracy leads to a scheme DC2j+2 of order 2j+2. The order of accuracy is guaranteed by a deferred correction condition. Numerical exp...

A fast and robust Jacobian-free time-integration method - called Minimum-error Adaptation of a Chemical-Kinetic ODE Solver (MACKS) - for solving stiff ODEs pertaining to chemical-kinetics is proposed herein. The MACKS formulation is based on optimization of the one-parameter family of integration formulae coupled with a dual time-stepping method to facilitate error minimization. The proposed method demonstrates higher accuracy compared to the method - Extended Robustness-enha...

Traditional step size controllers make the tacit assumption that the cost of a time step is independent of the step size. This is reasonable for explicit and implicit integrators that use direct solvers. In the context of exponential integrators, however, an iterative approach, such as Krylov methods or polynomial interpolation, to compute the action of the required matrix functions is usually employed. In this case, the assumption of constant cost is not valid. This is, in p...

A technique is described in this paper to avoid order reduction when integrating reaction-diffusion initial boundary value problems with explicit exponential Rosenbrock methods. The technique is valid for any Rosenbrock method, without having to impose any stiff order conditions, and for general time-dependent boundary values. An analysis on the global error is thoroughly performed and some numerical experiments are shown which corroborate the theoretical results, and in whic...

The purpose of this work is to introduce a new idea of how to avoid the factorization of large matrices during the solution of stiff systems of ODEs. Starting from the general form of an explicit linear multistep method we suggest to adaptively choose its coefficients on each integration step in order to minimize the norm of the residual of an implicit BDF formula. Thereby we reduce the number of unknowns on each step from $n$ to $O(1)$, where $n$ is the dimension of the ODE ...

In this work, we introduce a novel numerical method for solving initial value problems associated with a given differential. Our approach utilizes a spline approximation of the theoretical solution alongside the integral formulation of the analytical solution. Furthermore, we offer a rigorous proof of the method's order and provide a comprehensive stability analysis. Additionally, we showcase the effectiveness method through some examples, comparing with Taylor's methods of s...