Please use this identifier to cite or link to this item:
Title: Resolution of sparse linear systems of equations: the RPK strategy
Authors: Montero, G. 
Montenegro, R. 
Escobar, J. M. 
Rodriguez, E. 
Keywords: Approximate Inverse Preconditioners
Gmres Algorithm
Reduction, et al
Issue Date: 2004
Journal: Progress in Engineering Computational Technology
Conference: 7th International Conference on Computational Structures Technology/4th International Conference on Engineering Computational Technology 
Abstract: 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.
ISBN: 978-1-874672-22-7
Source: Progress in Engineering Computational Technology, p. 81-109
Appears in Collections:Actas de congresos
Show full item record


checked on May 16, 2021

Page view(s)

checked on May 15, 2021

Google ScholarTM




Export metadata

Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.