New parallel sparse direct solvers for multicore architectures
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.
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations
- A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations
- A set of level 3 basic linear algebra subprograms
- A Symmetry Preserving Algorithm for Matrix Scaling
- Accelerating scientific computations with mixed precision algorithms
- Accurate Symmetric Indefinite Linear Equation Solvers
- Algorithm 837
- An Approximate Minimum Degree Ordering Algorithm
- An out-of-core sparse Cholesky solver
- Compressed threshold pivoting for sparse symmetric indefinite systems
- Design of a multicore sparse Cholesky factorization using DAGs
- Direct Methods for Sparse Linear Systems
- scientific article; zbMATH DE number 194668 (Why is no real title available?)
- scientific article; zbMATH DE number 2087097 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- LAPACK Users' Guide
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Modification of the minimum-degree algorithm by multiple elimination
- Nested Dissection of a Regular Finite Element Mesh
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Optimal Weighted Matchings for Rank-Deficient Sparse Matrices
- Partial factorization of a dense symmetric indefinite matrix
- PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
- Pivoting strategies for tough sparse indefinite systems
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- The Factorization of Sparse Symmetric Indefinite Matrices
- The influence of relaxed supernode partitions on the multifrontal method
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The Role of Elimination Trees in Sparse Factorization
- The University of Florida sparse matrix collection
- Sparse direct solution on parallel computers
- Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations
- Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
- Parallel finite element solver for multi-core computers with shared memory
- Solving large linear least squares problems with linear equality constraints
- Subdomain deflation combined with local AMG: a case study using AMGCL library
- AMGCL: an efficient, flexible, and extensible algebraic multigrid implementation
- scientific article; zbMATH DE number 1728329 (Why is no real title available?)
- A new parallel sparse direct solver: presentation and numerical experiments in large-scale structural mechanics parallel computing
- A multithreaded recursive and nonrecursive parallel sparse direct solver
- State-of-the-art sparse direct solvers
- Preparing sparse solvers for exascale computing
- High-performance sampling of generic determinantal point processes
- Design of a multicore sparse Cholesky factorization using DAGs
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations
- Parallel hierarchical hybrid linear solvers for emerging computing platforms
- On the evaluation of general sparse hybrid linear solvers
- Projection Improved SPAI Preconditioner for FGMRES
- Parallel direct methods for solving the system of linear equations with pipelining on a multicore using OpenMP
- Approximating sparse Hessian matrices using large-scale linear least squares
- Sparse linear least-squares problems
Uses Software
This page was built for publication: New parallel sparse direct solvers for multicore architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736591)
