A parallel multithreaded sparse triangular linear system solver


COMPUTERS & MATHEMATICS WITH APPLICATIONS, vol.80, no.2, pp.371-385, 2020 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 80 Issue: 2
  • Publication Date: 2020
  • Doi Number: 10.1016/j.camwa.2019.09.012
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, MathSciNet, Metadex, MLA - Modern Language Association Database, zbMATH, Civil Engineering Abstracts
  • Page Numbers: pp.371-385
  • Keywords: Sparse triangular linear systems, Direct methods, Parallel computing, ALGORITHM, PERFORMANCE, SPIKE, LIBRARY
  • Middle East Technical University Affiliated: Yes


We propose a parallel sparse triangular linear system solver based on the Spike algorithm. Sparse triangular systems are required to be solved in many applications. Often, they are a bottleneck due to their inherently sequential nature. Furthermore, typically many successive systems with the same coefficient matrix and with different right hand side vectors are required to be solved. The proposed solver decouples the problem at the cost of extra arithmetic operations as in the banded case. Compared to the banded case, there are extra savings due to the sparsity of the triangular coefficient matrix. We show the parallel performance of the proposed solver against the stateof-the-art parallel sparse triangular solver in Intel's Math Kernel Library (MKL) on a multicore architecture. We also show the effect of various sparse matrix reordering schemes. Numerical results show that the proposed solver outperforms MKL's solver in similar to 80% of cases by a factor of 2.47, on average. (C) 2019 Elsevier Ltd. All rights reserved.