A flexible inner-outer preconditioned GMRES algorithm
SIAM Journal on Scientific Computing
Using MPI: portable parallel programming with the message-passing interface
Using MPI: portable parallel programming with the message-passing interface
Design of an iterative solution module for a parallel sparse matrix library (P_SPARSLIB)
Applied Numerical Mathematics - Special issue on iterative methods for linear equations
Distributed Schur Complement Techniques for General Sparse Linear Systems
SIAM Journal on Scientific Computing
A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
SIAM Journal on Scientific Computing
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Parallel solution of sparse linear systems arising in advection–diffusion problems
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solution of linear systems arising from realistic scientific and engineering applications. The most common parallel preconditioners used for sparse linear systems adapt domain decomposition concepts to the more general framework of "distributed sparse linear systems". The parallel Algebraic Recursive Multilevel Solver (pARMS ) is a recently developed package which integrates together variants from both Schwarz procedures and Schur complement-type techniques. This paper discusses a few of the main ideas and design issues of the package. A few details on the implementation of pARMS are provided.