Linear multistep methods with repeated global Richardson extrapolation

Abstract In this work, we further investigate the application of the well-known Richardson extrapolation (RE) technique to accelerate the convergence of sequences resulting from linear multistep methods (LMMs) for numerically solving initial-value problems of systems of ordinary differential equations. By extending the ideas of our recent work on global Richardson extrapolation, we now utilize some advanced versions of RE in the form of repeated RE (RRE). Assume that the underlying LMM—the base method—has order p and RE is applied $$\ell $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>ℓ</mml:mi> </mml:math> times. Then, we prove that the accelerated sequence has convergence order $$p+\ell $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>+</mml:mo> <mml:mi>ℓ</mml:mi> </mml:mrow> </mml:math> . The version we present here is global RE (GRE, also known as passive RE), since the terms of the linear combinations are calculated independently. Thus, the resulting higher-order LMM-RGRE methods can be implemented in a parallel fashion and existing LMM codes can directly be used without any modification. We also investigate how the linear stability properties of the base method (e.g., A - or $$A(\alpha )$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>A</mml:mi> <mml:mo>(</mml:mo> <mml:mi>α</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> -stability) are preserved by the LMM-RGRE methods.