We describe the search for explicit general linear methods in Nordsieck form for which the stability function has only two nonzero roots. This search is based on state-of-the-art optimization software. Examples of methods found in this way are given for order p = 5, p = 6, and p = 7.

A new class of numerical methods for Volterra integro-differential equations with memory is developed. The methods are based on the combination of general linear methods with compound quadrature rules. Sufficient conditions that guarantee global and asymptotic stability of the solution of the differential equation and its numerical approximation are established. Numerical examples illustrate th...

In the numerical solution of partial differential equations using a method-of-lines approach, the availability of high order spatial discretization schemes motivates the development of sophisticated high order time integration methods. For multiphysics problems with both stiff and non-stiff terms implicit-explicit (IMEX) time stepping methods attempt to combine the lower cost advantage of expli...

General linear (GL) methods are numerical algorithms used to solve ODEs. The standard order conditions analysis involves the GL matrix itself and a starting procedure; however, a finishing method (F) is required to extract the actual ODE solution. The standard order analysis and stability are sufficient for the convergence of any GL method. Nonetheless, using a simple GL scheme, we show that th...