New parallel sparse direct solvers for multicore architectures (Q1736591)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New parallel sparse direct solvers for multicore architectures |
scientific article |
Statements
New parallel sparse direct solvers for multicore architectures (English)
0 references
26 March 2019
0 references
Summary: At the heart of many computations in science and engineering lies the need to efficiently and accurately solve large sparse linear systems of equations. Direct methods are frequently the method of choice because of their robustness, accuracy and potential for use as black-box solvers. In the last few years, there have been many new developments, and a number of new modern parallel general-purpose sparse solvers have been written for inclusion within the HSL mathematical software library. In this paper, we introduce and briefly review these solvers for symmetric sparse systems. We describe the algorithms used, highlight key features (including bit-compatibility and out-of-core working) and then, using problems arising from a range of practical applications, we illustrate and compare their performances. We demonstrate that modern direct solvers are able to accurately solve systems of order \(10^6\) in less than 3 minutes on a 16-core machine.
0 references
sparse matrices
0 references
sparse linear systems
0 references
symmetric systems
0 references
direct solvers
0 references
multifrontal
0 references
supernodal
0 references
bit-compatibility
0 references
Fortran 95
0 references
OpenMP
0 references
parallel
0 references