Please use this identifier to cite or link to this item:
http://hdl.handle.net/10553/1789
Title: | Incomplete factorization for preconditioning shifted linear systems | Authors: | Suárez Sarmiento, Antonio F. Montero García, Gustavo Sarmiento, H. |
UNESCO Clasification: | 1206 Análisis numérico | Keywords: | Preconditioning Conjugate gradient Incomplete Cholesky factorization Iterative methods Shifted linear systems, et al |
Issue Date: | 2006 | Conference: | 5th International Conference on Engineering Computational Technology, ECT 2006 | Abstract: | We consider the preconditioning of linear systems with matrices depending on a parameter, i.e., A εχ ε = b ε with A ε = M + εN symmetric positive definite. Instead of using extreme strategies as to apply the same preconditioner along the process, or on the contrary, to compute a different preconditioner for each value of ", we propose an intermediate technique. It is based on the construction of one initial preconditioner from an incomplete factorization of M, which can be easily updated for each value of " at a low computational cost. Several numerical experiments are presented in order to show the efficiency of the proposed preconditioner. | URI: | http://hdl.handle.net/10553/1789 | ISBN: | 1-905088-09-4 | Source: | Proceedings of the 5th International Conference on Engineering Computational Technology, p. 187-188 (Diciembre 2006) |
Appears in Collections: | Artículos |
SCOPUSTM
Citations
1
checked on Nov 24, 2024
Page view(s)
118
checked on Nov 16, 2024
Download(s)
208
checked on Nov 16, 2024
Google ScholarTM
Check
Altmetric
Share
Export metadata
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.