Abstract
The solution of ordinary an partial differential equations using implicit linear multi-step 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 \(\hat M\)x = b. Block-circulant preconditioners have been propose to solve these linear systems. By investigating the spectral condition number of \(\hat M\), we show that the conjugate gradient method, when applied to solving the normalize preconditioned system, converges in at most O(log s) steps, where the integration step size is O(1/s). Numerical results are given to illustrate the effectiveness of the analysis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
