Analysis of preconditioning strategies for collocation linear systems
โ Scribed by Stefano Serra Capizzano; Cristina Tablino Possio
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 282 KB
- Volume
- 369
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
In the past few years several authors have studied the preconditioning of collocation matrices by finite differences (FDs) matrices arising from the associated collocation points. Here we discuss how to solve in an efficient way nonuniform grid FD linear systems, including those related to a generic FD-collocation preconditioner. The main idea is based on a further step of preconditioning defined in terms of diagonal and Toeplitz matrices. First, we identify the limit spectral distributions of the involved FD-collocation matrix sequences and then we prove that the proposed Toeplitz-based preconditioners assure a clustering at the unity with respect to the eigenvalues in the 1D case. In the 2D case the situation is different so that more appropriate strategies are discussed. A wide numerical experimentation emphasizing the correctness of the theoretical results is also reported.
๐ SIMILAR VOLUMES
This article surveys preconditioning techniques for the iterative solution of large linear systems, with a focus on algebraic methods suitable for general sparse matrices. Covered topics include progress in incomplete factorization methods, sparse approximate inverses, reorderings, parallelization i
In this paper a novel preconditioning strategy is presented that is designed to improve the convergence rates of the Generalized Minimal Residual (GMRES) method when applied to dense linear systems of boundary element equations of the form Hz ----c. The GMRES method is applied to the preconditioned