New parallel sparse direct solvers for multicore architectures
type: Item
instance of: scholarly article
title: New parallel sparse direct solvers for multicore architectures
zbMATH Open document ID: 1461.65063
author: J. D. Hogg
author: J. A. Scott
published in: Algorithms
publication date: 2019-03-26T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65F05
zbMATH DE Number: 7042184
zbMATH Keywords: sparse matrices
zbMATH Keywords: sparse linear systems
zbMATH Keywords: symmetric systems
zbMATH Keywords: direct solvers
zbMATH Keywords: multifrontal
zbMATH Keywords: supernodal
zbMATH Keywords: bit-compatibility
zbMATH Keywords: Fortran 95
zbMATH Keywords: OpenMP
zbMATH Keywords: parallel
describes a project that uses: MA57
describes a project that uses: PARDISO
describes a project that uses: METIS
describes a project that uses: HSL_MA77
describes a project that uses: LAPACK
describes a project that uses: BLAS
describes a project that uses: AMD
describes a project that uses: HSL
describes a project that uses: PaStiX
describes a project that uses: MUMPS
describes a project that uses: SparseMatrix
describes a project that uses: WSMP
describes a project that uses: Zoltan
describes a project that uses: Scotch
describes a project that uses: HSL_MA87
describes a project that uses: CSparse
describes a project that uses: Fortran_Virtual_Memory
describes a project that uses: HSL_MA97
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a6040702
OpenAlex ID: W2082566622
cites work: An out-of-core sparse Cholesky solver
cites work: Design of a Multicore Sparse Cholesky Factorization Using DAGs
cites work: Direct Methods for Sparse Linear Systems
cites work: Q4692656
cites work: A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations
cites work: Q5689624
cites work: An Approximate Minimum Degree Ordering Algorithm
cites work: Algorithm 837
cites work: Modification of the minimum-degree algorithm by multiple elimination
cites work: Nested Dissection of a Regular Finite Element Mesh
cites work: A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations
cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
cites work: The Role of Elimination Trees in Sparse Factorization
cites work: A set of level 3 basic linear algebra subprograms
cites work: The influence of relaxed supernode partitions on the multifrontal method
cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear
cites work: The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
cites work: Accurate Symmetric Indefinite Linear Equation Solvers
cites work: Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
cites work: The Factorization of Sparse Symmetric Indefinite Matrices
cites work: Pivoting strategies for tough sparse indefinite systems
cites work: Compressed threshold pivoting for sparse symmetric indefinite systems
cites work: Optimal Weighted Matchings for Rank-Deficient Sparse Matrices
cites work: Accelerating scientific computations with mixed precision algorithms
cites work: LAPACK Users' Guide
cites work: Partial factorization of a dense symmetric indefinite matrix
cites work: The university of Florida sparse matrix collection
cites work: A Symmetry Preserving Algorithm for Matrix Scaling
cites work: MA57---a code for the solution of sparse symmetric definite and indefinite systems
cites work: A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
cites work: Q4737758
cites work: On fast factorization pivoting methods for sparse symmetric indefinite systems
cites work: A fully asynchronous multifrontal solver using distributed dynamic scheduling
cites work: PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
DOI: 10.3390/A6040702