New parallel sparse direct solvers for multicore architectures
From MaRDI portal
Publication:1736591
DOI10.3390/a6040702zbMath1461.65063OpenAlexW2082566622MaRDI QIDQ1736591
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a6040702
sparse matricessparse linear systemsparallelsymmetric systemsOpenMPdirect solversFortran 95bit-compatibilitymultifrontalsupernodal
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems, Projection Improved SPAI Preconditioner for FGMRES, Subdomain deflation combined with local AMG: a case study using AMGCL library, Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations, Parallel finite element solver for multi-core computers with shared memory, AMGCL: an efficient, flexible, and extensible algebraic multigrid implementation, High-performance sampling of generic determinantal point processes, Solving large linear least squares problems with linear equality constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- Accelerating scientific computations with mixed precision algorithms
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Compressed Threshold Pivoting for Sparse Symmetric Indefinite Systems
- A Symmetry Preserving Algorithm for Matrix Scaling
- An out-of-core sparse Cholesky solver
- A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
- The university of Florida sparse matrix collection
- Partial factorization of a dense symmetric indefinite matrix
- Pivoting strategies for tough sparse indefinite systems
- Direct Methods for Sparse Linear Systems
- The Role of Elimination Trees in Sparse Factorization
- A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Modification of the minimum-degree algorithm by multiple elimination
- LAPACK Users' Guide
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Accurate Symmetric Indefinite Linear Equation Solvers
- The influence of relaxed supernode partitions on the multifrontal method
- A set of level 3 basic linear algebra subprograms
- The Factorization of Sparse Symmetric Indefinite Matrices
- An Approximate Minimum Degree Ordering Algorithm
- Design of a Multicore Sparse Cholesky Factorization Using DAGs
- Optimal Weighted Matchings for Rank-Deficient Sparse Matrices
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- A numerical evaluation of HSL packages for the direct solution of large sparse, symmetric linear systems of equations
- Algorithm 837
- Nested Dissection of a Regular Finite Element Mesh
- PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
