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 …

The general method of graph coarsening or graph reduction has been a remarkably useful
and ubiquitous tool in scientific computing and it is now just starting to have a similar impact …

In the six years that have passed since the publication of the first edition of this book,
iterative methods for linear systems have made good progress in scientific and engineering …

This paper sketches the main research developments in the area of iterative methods for
solving linear systems during the 20th century. Although iterative methods for solving linear …

A comparison study of the efficiency and accuracy of a variety of meshless trial and test
functions is presented in this paper, based on the general concept of the meshless local …

The purpose of this book is to unify and document in one place many of the techniques and
much of the current understanding about solving systems of linear equations on vector and …

This paper presents a new fine-grained parallel algorithm for computing an incomplete LU
factorization. All nonzeros in the incomplete factors can be computed in parallel and …

We consider bipartite matching algorithms for computing permutations of a sparse matrix so
that the diagonal of the permuted matrix has entries of large absolute value. We discuss …

This book deals with numerical methods for solving large sparse linear systems of
equations, particularly those arising from the discretization of partial differential equations. It …

The solution of large sparse linear systems arises in many applications, such as
computational fluid dynamics and oil reservoir simulation. In realistic cases the matrices are …