Abstract:
The numerical solution of large and sparse nonsymmetric linear systems of algebraic equations is usually the most time consuming part of time-step integrators for differential equations based on implicit formulas. Preconditioned Krylov subspace methods using Strang block circulant preconditioners have been employed to solve such linear systems. However, it has been observed that these block circulant preconditioners can be very ill-conditioned or singular even when the underlying nonpreconditioned matrix is well-conditioned. In this paper we propose the more general class of the block { ω }-circulant preconditioners. For the underlying problems, ω can be chosen so that the condition number of these preconditioners is much smaller than that of the Strang block circulant preconditioner (which belongs to the same class with ω =1) and the related iterations can converge very quickly.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: January 2002 / Accepted: December 2002
The research of the first author was supported in part by INdAM-GNCS and by a grant from the MURST project “Progetto Giovani Ricercatori anno 2000”. The research of the second author was supported in part by Hong Kong Research Grants Council Grants Nos. HKU 7130/02P and HKU 7132/00P and UK/HK Joint Research Scheme Grant No. 20009819.
Rights and permissions
About this article
Cite this article
Bertaccini, D., Ng, M. Block {ω}-circulant preconditioners¶for the systems of differential equations. CALCOLO 40, 71–90 (2003). https://doi.org/10.1007/s100920300004
Issue Date:
DOI: https://doi.org/10.1007/s100920300004