Volume 39, pp. 253-270, 2012.

Improved predictor schemes for large systems of linear ODEs

Mouhamad Al Sayed Ali and Miloud Sadkane

Abstract

When solving linear systems of ordinary differential equations (ODEs) with constant coefficients by implicit schemes such as implicit Euler, Crank-Nicolson, or implicit Runge-Kutta, one is faced with the difficulty of correctly solving the repeated linear systems that arise in the implicit scheme. These systems often have the same matrix but different right-hand sides. When the size of the matrix is large, iterative methods based on Krylov subspaces can be used. However, the effectiveness of these methods strongly depends on the initial guesses. The closer the initial guesses are to the exact solutions, the faster the convergence. This paper presents an approach that computes good initial guesses to these linear systems. It can be viewed as an improved predictor method. It is based on a Petrov-Galerkin process and multistep schemes and consists of building, throughout the iterations, an approximation subspace using the previous computations, where good initial guesses to the next linear systems can be found. It is shown that the quality of the computed initial guess depends only on the stepsize of the discretization and the dimension of the approximation subspace. The approach can be applied to most of the common implicit schemes. It is tested on several examples.

Full Text (PDF) [247 KB], BibTeX

Key words

Convergence acceleration, implicit scheme, predictor, Petrov-Galerkin, GMRES

AMS subject classifications

65L20, 65F10

Links to the cited ETNA articles

[2]	Vol. 35 (2009), pp. 104-117 Mouhamad Al Sayed Ali and Miloud Sadkane: Acceleration of implicit schemes for large systems of nonlinear ODEs

< Back