A domain-decomposing parallel sparse linear system solver

Download

index.pdf

Date

2011-09-01

Author

Manguoğlu, Murat

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

49
views

58
downloads

The solution of large sparse linear systems is often the most time-consuming part of many science and engineering applications. Computational fluid dynamics, circuit simulation, power network analysis, and material science are just a few examples of the application areas in which large sparse linear systems need to be solved effectively. In this paper, we introduce a new parallel hybrid sparse linear system solver for distributed memory architectures that contains both direct and iterative components. We show that by using our solver one can alleviate the drawbacks of direct and iterative solvers, achieving better scalability than with direct solvers and more robustness than with classical preconditioned iterative solvers. Comparisons to well-known direct and iterative solvers on a parallel architecture are provided.

Subject Keywords

Sparse linear systems, Parallel solvers, Direct solvers, Iterative solvers

URI

https://hdl.handle.net/11511/39557

Journal

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

DOI

https://doi.org/10.1016/j.cam.2011.07.017

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Parallel solution of sparse triangular linear systems on multicore platforms Çuğu, İlke; Manguoğlu, Murat; Department of Computer Engineering (2018) Many large-scale applications in science and engineering require the solution of sparse linear systems. One well-known approach is to solve these systems by factorizing the coefficient matrix into nonsingular sparse triangular matrices and solving the resulting sparse triangular systems via backward and forward sweep (substitution) operations. This can be considered as a direct solver or it is part of the preconditioning operation in an iterative scheme if incomplete factorization is computed. Often, these ...
A New multi-threaded and recursive direct algorithm for parallel solution of sparse linear systems Bölükbaşı, Ercan Selçuk; Manguoğlu, Murat; Department of Computer Engineering (2013) Many of the science and engineering applications need to solve linear systems to model a real problem. Usually these linear systems have sparse coefficient matrices and thus require an effective solution of sparse linear systems which is usually the most time consuming operation. Circuit simulation, material science, power network analysis and computational fluid dynamics can be given as examples of these problems. With the introduction of multi-core processors, it became more important to solve sparse line...
Learning the Domain of Sparse Matrices Salm, Suleyman; Manguoğlu, Murat; Aktulga, Hasan Metin (2016-12-20) Large sparse linear system of equations arise in many areas of science and engineering. Although, there are several black-box general sparse solvers, usually they are not as effective as domain specific solvers. In addition, most solvers contain multiple choices during the solution process which can be tailored to a specific domain. A natural first step towards a black-box solver that is as effective as domain specific solvers is to come up with a technique to identify the application domain of the problem....
A Parallel Numerical Solver Using Hierarchically Tiled Arrays Brodman, James C.; Evans, G. Carl; Manguoğlu, Murat; Sameh, Ahmed; Garzaran, Maria J.; Padua, David (2011-01-01) Solving linear systems is an important problem for scientific computing. Exploiting parallelism is essential for solving complex systems. and this traditionally involves writing parallel algorithms on top of a library such as MPI. The SPIKE family of algorithms is one well-known example of a parallel solver for linear systems. The Hierarchically Tiled Array data type extends traditional data-parallel array operations with explicit tiling and allows programmers to directly manipulate tiles. The tiles of the...
A new preconditioner design based on spectral division for power flow analysis DAĞ, HASAN; YETKİN, Fatih; Manguoğlu, Murat (2011-01-01) Solution of large sparse linear systems is the most lime consuming part in many power system simulations. Direct solvers based on LU factorization, although robust, are known to have limited satiability on parallel platforms. Thus. Krylov subspace based iterative methods (i.e. Conjugate Gradient method, Generalized Minimal Residuals (GMRES) method) can be used as alternatives. To achieve competitive performance and robustness, however, the Krylov subspace methods need a suitable preconditioner. In this work...

Citation Formats

M. Manguoğlu, “A domain-decomposing parallel sparse linear system solver,” JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, pp. 319–325, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39557.