A tree model for sparse symmetric indefinite matrix factorization
SIAM Journal on Matrix Analysis and Applications
The minimum degree ordering with constraints
SIAM Journal on Scientific and Statistical Computing
The role of elimination trees in sparse factorization
SIAM Journal on Matrix Analysis and Applications
On finding supernodes for sparse matrix computations
SIAM Journal on Matrix Analysis and Applications
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
A unified algorithm for load-balancing adaptive scientific simulations
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Partitioning for Complex Objectives
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Graph Partitioning and Parallel Solvers: Has the Emperor No Clother? (Extended Abstract)
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.00 |
The paper deals with the parallel computation of matrix factorization using graph partitioning-based domain decomposition It is well-known that the partitioned graph may have both a small separator and well-balanced domains but sparse matrix decompositions on domains can be completely unbalanced. In this paper we propose to enhance the iterative strategy for balancing the decompositions from [13] by graph-theoretical tools We propose the whole framework for the graph repartitioning In particular, new global and local reordering strategies for domains are discussed in more detail We present both theoretical results for structured grids and experimental results for unstructured large-scale problems.