MUMPS: A General Purpose Distributed Memory Sparse Solver
Patrick Amestoy, Iain Duff, Jean-Yves L’Excellent et al. · Lecture notes in computer science · 2001
Cited by 214 works. doi:10.1007/3-540-70734-4_16
Authors
References
- Direct Methods for Sparse Matrices
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- Direct Methods for Sparse Matrices.
- An Approximate Minimum Degree Ordering Algorithm
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- Highly scalable parallel algorithms for sparse matrix factorization
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix