An efficient step size selection for ODE codes

The most critical component of any adaptive numerical quadrature routine is the estimation of the integration error. Since the publication of the first algorithms in the 1960s, many error estimation schemes have been presented, evaluated and discussed. This paper presents a review of existing error estimation techniques and discusses their differences and their common features. Some common shortcomings of these algorithms are discussed and a new general error estimation techn...

This work deals with the problem of choosing a time step for the numerical solution of boundary value problems for parabolic equations. The problem solution is derived using the fully implicit scheme, whereas a time step is selected via explicit calculations. The selection strategy consists of the following steps. First, using the explicit scheme, we calculate the solution at a new time level. Next, we employ this solution in order to obtain the solution at the previous time ...

An efficient approximate version of implicit Taylor methods for initial-value problems of systems of ordinary differential equations (ODEs) is introduced. The approach, based on an approximate formulation of Taylor methods, produces a method that requires less evaluations of the function that defines the ODE and its derivatives than the usual version. On the other hand, an efficient numerical solution of the equation that arises from the discretization by means of Newton's me...

Welcome to a beautiful subject in scientific computing: numerical solution of ordinary differential equations (ODEs) with initial conditions.

Differential Equations are among the most important Mathematical tools used in creating models in the science, engineering, economics, mathematics, physics, aeronautics, astronomy, dynamics, biology, chemistry, medicine, environmental sciences, social sciences, banking and many other areas [7]. A differential equation that has only one independent variable is called an Ordinary Differential Equation (ODE), and all derivatives in it are taken with respect to that variable. Mos...

This study introduces new time-stepping strategies with built-in global error estimators. The new methods propagate the defect along with the numerical solution much like solving for the correction or Zadunaisky's procedure; however, the proposed approach allows for overlapped internal computations and, therefore, represents a generalization of the classical numerical schemes for solving differential equations with global error estimation. The resulting algorithms can be effe...

A review of the most popular Linear Multistep (LM) Methods for solving Ordinary Differential Equations numerically is presented. These methods are first derived from first principles, and are discussed in terms of their order, consistency, and various types of stability. Particular varieties of stability that may not be familiar, are briefly defined first. The methods that are included are the Adams-Bashforth Methods, Adams-Moulton Methods, and Backwards Differentiation Formu...

A new numerical method for solving a scalar ordinary differential equation with a given initial condition is introduced. The method is using a numerical integration procedure for an equivalent integral equation and is called in this paper an integrating method. Bound to specific constraints, the method returns an approximate solution assuredly within a given tolerance provided by a user. This makes it different from a large variety of single- and multi-step methods for solvin...

We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step size and corresponding method for a given problem when the spectrum of the initial value problem is known. The problem is expressed in terms of a general least deviation feasibility problem. Its solution is obtained by a new fast, a...

Many time-dependent differential equations are equipped with invariants. Preserving such invariants under discretization can be important, e.g., to improve the qualitative and quantitative properties of numerical solutions. Recently, relaxation methods have been proposed as small modifications of standard time integration schemes guaranteeing the correct evolution of functionals of the solution. Here, we investigate how to combine these relaxation techniques with efficient st...