Log In Sign Up

Stabilized explicit Adams-type methods

by   Vasily Repnikov, et al.

In this work we present explicit Adams-type multistep methods with extended stability interval, which are analogous to the stabilized Chebyshev Runge–Kutta methods. It is proved that for any k≥ 1 there exists an explicit k-step Adams-type method of order one with stability interval of length 2k. The first order methods have remarkably simple expressions for their coefficients and error constant. A damped modification of these methods is derived. In general case to construct a k-step method of order p it is necessary to solve a constrained optimization problem in which the objective function and p constraints are second degree polynomials in k variables. We calculate higher-order methods up to order six numerically and perform some numerical experiments to confirm the accuracy and stability of the methods.


page 1

page 2

page 3

page 4


On the explicit two-stage fourth-order accurate time discretizations

This paper continues to study the explicit two-stage fourth-order accura...

On the Stability and Accuracy of Clenshaw-Curtis Collocation

We study the A-stability and accuracy characteristics of Clenshaw-Curtis...

A comparison of six numerical methods for integrating a compartmental Hodgkin-Huxley type model

We compare six numerical integrators' performance when simulating a regu...

Generalized explicit pseudo two-step Runge-Kutta-Nyström methods for solving second-order initial value problems

A class of explicit pseudo two-step Runge-Kutta-Nyström (GEPTRKN) method...

Two-derivative error inhibiting schemes with post-processing

High order methods are often desired for the evolution of ordinary diffe...

Fractional-Step Runge–Kutta Methods: Representation and Linear Stability Analysis

Fractional-step methods are a popular and powerful divide-and-conquer ap...

Seeking Stability by being Lazy and Shallow

Designing a language feature often requires a choice between several, si...