Highly scalable parallel algorithms for sparse matrix factorization (1994)

by Anshul Gupta , George Karypis , Vipin Kumar
Venue:IEEE Transactions on Parallel and Distributed Systems
Citations:116 - 29 self

Active Bibliography

8 Analysis and Design of Scalable Parallel Algorithms for Scientific Computing – Anshul Gupta - 1995
4 A Scalable Parallel Algorithm for Sparse Cholesky Factorization – Anshul Gupta, Vipin Kumar
13 A high performance sparse Cholesky factorization algorithm for scalable parallel computers – George Karypis, Vipin Kumar - 1994
8 Parallel Algorithms for Forward and Back Substitution in Direct Solution of Sparse Linear Systems – Anshul Gupta, Vipin Kumar - 1995
unknown title – Université De Bordeaux I, Habilitation À Diriger, Des Recherches, Au Titre, De L’école Doctorale, Bruce Hendrickson Senior Scientist, Burkhard Monien, Prof Dr, Universität Paderborn, Professeur U. Nice-sophia Antipolis Examinateur, U. Bordeaux, Iuf Examinateur
Scotch and libScotch 4.0 User’s Guide – François Pellegrini - 2006
797 A fast and high quality multilevel scheme for partitioning irregular graphs – George Karypis, Vipin Kumar - 1998
17 A Parallel Formulation of Interior Point Algorithms – George Karypis, Anshul Gupta, Vipin Kumar - 1994
6 Parallel Direct Methods For Sparse Linear Systems – Michael T. Heath - 1997
1.3 The Reality of High Performance Computing...................... 3 – Lecturer Alan Edelman
6 Parallel Algorithms for Forward Elimination and Backward Substitution in Direct Solution of Sparse Linear Systems – Anshul Gupta, Vipin Kumar - 1995
Scotch and libScotch 3.4 User's Guide – François Pellegrini - 2001
41 Graph Partitioning Algorithms With Applications To Scientific Computing – Alex Pothen - 1997
61 Graph partitioning for high performance scientific simulations. Computing Reviews 45(2 – Kirk Schloegel, George Karypis, Vipin Kumar, Vipinkumar Dept. Ofcomputerscience, Reproductionrequiresexplicitpermission Limitedcopiesdistributed, Earlydraft Contents - 2004
90 Analysis of multilevel graph partitioning – George Karypis, Vipin Kumar - 1995
1 Task Scheduling Using a Block Dependency DAG for Block-Oriented Sparse Cholesky Factorization – Heejo Lee, Jong Kim, Sung Je Hong, Sunggu Lee - 2000
3 WSMP: A High-Performance Shared- and Distributed-Memory Parallel Sparse Linear Equation Solver – Anshul Gupta, Mahesh Joshi - 2001
36 Sparse Gaussian Elimination on High Performance Computers – Xiaoye S. Li - 1996
3 Comparing Nested Dissection Orderings for Parallel Sparse Matrix Factorization – Jürgen Schulze, Ralf Diekmann, Robert Preis - 1995