The convergence rate of block preconditioned systems arising from LMF-based ODE codes
The solution of ordinary and partial differential equations using implicit linear multistep formulas (LMF) is considered. More precisely, boundary value methods (BVMs), a class of methods based on implicit formulas will be taken into account in this paper. These methods require the solution of large and sparse linear systems (M) over capx = b. Block-circulant preconditioners have been proposed to solve these linear systems. By investigating the spectral condition number of (M) over cap, we show that the conjugate gradient method, when applied to solving the normalized preconditioned system, converges in at must O(log s) steps, where the integration step size is O(1/s). Numerical results are. given to illustrate the effectiveness of the analysis.
implicit linear multistep formulas boundary value methods circulant preconditioning rate of convergence unsymmetric block (almost) toeplitz linear systems numerical solution of differential equations