Premium
A hybrid parallel algorithm for large sparse linear systems
Author(s) -
Rao S. Chandra Sekhara,
Kamra Rabia
Publication year - 2018
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.2210
Subject(s) - solver , linear system , invertible matrix , sparse matrix , iterative method , computer science , algorithm , diagonal , sparse approximation , parallel computing , parallel algorithm , mathematics , diagonally dominant matrix , mathematical optimization , mathematical analysis , physics , geometry , quantum mechanics , pure mathematics , gaussian
Summary Large sparse linear systems arise in many areas of scientific computing, and the solution of these systems is the most time‐consuming part in many large‐scale problems. We present a hybrid parallel algorithm, named incomplete W Z parallel solver (IWZPS), for the solution of large sparse nonsingular diagonally dominant linear systems on distributed memory architectures. The method is a combination of both direct and iterative techniques. We compare the present hybrid parallel sparse algorithm IWZPS with the direct and iterative sparse solvers, namely, MUMPS and ILUPACK, respectively. In addition, we compare it with a hybrid parallel solver, DDPS.