Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/53595
Título: Resolution of sparse linear systems of equations: the RPK strategy
Autores/as: Montero, G. 
Montenegro, R. 
Escobar, J. M. 
Rodriguez, E. 
Palabras clave: Approximate Inverse Preconditioners
Gmres Algorithm
Least-Squares
Bi-Cgstab
Reduction, et al.
Fecha de publicación: 2004
Publicación seriada: Progress in Engineering Computational Technology
Conferencia: 7th International Conference on Computational Structures Technology/4th International Conference on Engineering Computational Technology 
Resumen: An over view of advanced techniques for solving large sparse linear systems of equations is presented. First, several reordering algorithms are introduced in order to improve the effect of preconditioning on a linear system. Next, we define the concept of preconditioning and formulate some of most popular preconditioners, especially those based in approximate inverse. On the other hand, some Krylov subspace methods for solving linear systems of equations are considered. For symmetric problems, the Conjugate Gradient method is proposed. However, for non-symmetric linear systems there exist several alternatives that may be classified into three family of methods: orthogonalisation, biorthogonalisation and normal equation methods. Nowadays, RPK strategy which combines those three techniques, reordering, preconditioning and Krylov subspace methods, seems to be the most efficient from the computational point of view. This is finally illustrated with some numerical experiments.
URI: http://hdl.handle.net/10553/53595
ISBN: 978-1-874672-22-7
Fuente: Progress in Engineering Computational Technology, p. 81-109
Colección:Actas de congresos
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.