Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/1789
Título: Incomplete factorization for preconditioning shifted linear systems
Autores/as: Suárez Sarmiento, Antonio F. 
Montero García, Gustavo 
Sarmiento, H.
Clasificación UNESCO: 1206 Análisis numérico
Palabras clave: Preconditioning
Conjugate gradient
Incomplete Cholesky factorization
Iterative methods
Shifted linear systems, et al.
Fecha de publicación: 2006
Conferencia: 5th International Conference on Engineering Computational Technology, ECT 2006 
Resumen: 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
Fuente: Proceedings of the 5th International Conference on Engineering Computational Technology, p. 187-188 (Diciembre 2006)
Colección:Artículos
miniatura
Adobe PDF (32,26 kB)
Vista completa

Google ScholarTM

Verifica

Altmetric


Comparte



Exporta metadatos



Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.