PSPIKE+: A family of parallel hybrid sparse linear system solvers
From MaRDI portal
Publication:730600
Recommendations
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- A better list heuristic for vertex cover
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A list heuristic for vertex cover
- A new pivoting strategy for Gaussian elimination
- A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
- A tearing-based hybrid parallel banded linear system solver
- A tearing-based hybrid parallel sparse linear system solver
- ARMS: an algebraic recursive multilevel solver for general sparse linear systems
- Algorithm 832
- An overview of SuperLU
- BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
- Extensions of Certain Graph-based Algorithms for Preconditioning
- Graph partitioning using matrix values for preconditioning symmetric positive definite systems
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- Preconditioners based on strong subgraphs
- TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
- The University of Florida sparse matrix collection
- The design of approximation algorithms
Cited in
(5)- Parallel multiprojection preconditioned methods based on subspace compression
- Parallel Schur complement techniques based on multiprojection methods
- A tearing-based hybrid parallel sparse linear system solver
- Partitioning and reordering for spike-based distributed-memory parallel Gauss-Seidel
- Distributed algebraic tearing and interconnecting techniques
Describes a project that uses
Uses Software
This page was built for publication: \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730600)
