A hybrid parallel algorithm for large sparse linear systems. Issue 6 (29th August 2018)

• Record Type: Journal Article
• Authors: Rao, S. Chandra Sekhara; Kamra, Rabia
• Other Names: Benner Peter guestEditor.; Faßbender Heike guestEditor.; Grasedyck Lars guestEditor.; Kressner Daniel guestEditor.; Meini Beatrice guestEditor.; Simoncini Valeria guestEditor.
• Is Part Of: Numerical linear algebra with applications. Volume 25:Issue 6(2018)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-08-29
• Subjects: direct solvers -- hybrid solvers -- incomplete factorization -- iterative solvers -- reordering -- sparse linear systems; Algebras, Linear -- Periodicals; 512.5
• DOI: 10.1002/nla.2210
• Languages: English
• ISSNs: 1070-5325

Abstract

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.