Abstract. We consider the solution of a linear system Ax = b on a distributed memory machine when the matrix A has full rank and is large, sparse and nonsymmetric. We use our Cartesian nested dissection algorithm to compute a fill-reducing column ordering of the matrix. We develop algorithms that use the associated separator tree to estimate the structure of the factor and to distribute and perform numeric computations. When the matrix is nonsymmetric but square, the numeric computations involve Gaussian elimination with row pivoting; when the matrix is overdetermined, row-oriented Householder transforms are applied to compute the triangular factor of an orthogonal factorization. We compare the fill incurred by our approach to that incurred by well known sequential methods and report on the performance of our implementation on the Intel iPSC/860.
|
432
|
Direct Methods for Sparse Matrices
– DUFF, ERISMAN, et al.
- 1986
|
|
414
|
Partitioning sparse matrices with eigenvectors of graphs
– Pothen, Simon, et al.
- 1990
|
|
243
|
Introduction to Matrix Computations
– Stewart
- 1973
|
|
117
|
Parallel algorithms for sparse linear systems
– Heath, Ng, et al.
- 1991
|
|
87
|
Sparse matrices in Matlab: Design and implementation
– GILBERT, MOLER, et al.
- 1991
|
|
72
|
Geometric mesh partitioning: Implementation and experiments
– Gilbert, Miller, et al.
- 1998
|
|
67
|
The multifrontal solution of unsymmetric sets of linear systems
– Duff, Reid
- 1984
|
|
59
|
A heuristic for reducing fill in sparse matrix factorization
– Bui, Jones
- 1993
|
|
53
|
The torus-wrap mapping for dense matrix calculations on massively parallel computers
– Hendrickson, Womble
- 1994
|
|
39
|
Solution of sparse linear least squares problems using Givens rotations. Linear Algebra and its Applications
– George, Heath
- 1980
|
|
38
|
Towards a Fast Implementation of Spectral Nested Dissection
– Pothen, Simon, et al.
- 1992
|
|
37
|
A new implementation of sparse Gaussian elimination
– Schreiber
- 1982
|
|
36
|
Symbolic factorization for sparse Gaussian elimination with partial pivoting
– George, Ng
- 1987
|
|
36
|
Highly Parallel Sparse Cholesky Factorization
– Gilbert, Schreiber
- 1992
|
|
36
|
A parallel graph partitioning algorithm for a message-passing multiprocessor
– Gilbert, Zmijewski
- 1987
|
|
32
|
Graph Algorithms and NP-Completeness
– Mehlhorn
- 1984
|
|
27
|
Communication Results for Parallel Sparse Cholesky Factorization on a Hypercube. Parallel Computing
– George, Liu, et al.
- 1989
|
|
23
|
Predicting structure in nonsymmetric sparse matrix factorizations
– Gilbert, Ng
- 1993
|
|
22
|
SPARSPAK: Waterloo sparse matrix package user's guide for SPARSPAK-A
– Chu, George, et al.
- 1984
|
|
21
|
A Comparison of Three Column-based Distribution Sparse Factorization Schemes
– Ashcraft, Eisenstat, et al.
- 1990
|
|
16
|
Sparse Cholesky factorization on a Multiprocessor
– Zmijewski
- 1987
|
|
14
|
Graph Separator Theorems and Sparse Gaussian Elimination
– Gilbert
- 1980
|
|
13
|
factorization algorithms on distributed-memory multiprocessor architectures
– Geist, Romine, et al.
- 1988
|
|
11
|
A Cartesian nested dissection algorithm
– Heath, Raghavan
- 1992
|
|
10
|
LU factorization algorithms on distributed-memory multiprocessor architectures
– Geist, Romine
- 1988
|
|
10
|
Parallel Sparse Orthogonal Factorization on Distributedmemory Multiprocessors
– Sun
- 1996
|
|
9
|
A Comparison of some Methods for Solving Sparse Linear Least Squares Problems
– George, Heath, et al.
- 1983
|
|
9
|
A distributed multifrontal algorithm using clique trees
– Pothen, Sun
- 1991
|
|
8
|
Distributed sparse matrix factorization: QR and Cholesky factorizations
– Raghavan
- 1991
|
|
8
|
Solution of nonlinear least-squares problems on a multiprocessor
– Plassmann
- 1988
|
|
7
|
Householder reflections versus Givens rotations in sparse orthogonal decomposition
– George, Liu
- 1987
|
|
7
|
A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
– Zmijewski, Gilbert
- 1988
|
|
3
|
LAPACK for Distributed Memory Architectures: The Next Generation
– Demmel, Dongarra, et al.
- 1993
|
|
3
|
solution of sparse linear systems
– Distributed
- 1993
|
|
2
|
Parallel orthogonal factorizations of large sparse matrices on distributed-memory multiprocessors
– Coleman, Sun
- 1993
|
|
2
|
On the complexity of sparse LU and QR factorization of finite element matrices
– George, Ng
- 1988
|
|
2
|
Massively parallel sparse matrix computations
– Kratzer
- 1990
|
|
1
|
On general row mergng schemes for sparse Givens transformations
– Liu
- 1986
|
|
1
|
Sparse orthogonal factorization on a hypercube multiprocessor
– Chu, George
- 1990
|
|
1
|
factorization on massively parallel simd computers
– LU
|
|
1
|
Orderings for sparse symmetric factorization
– Leiserson, Lewis
- 1993
|
|
1
|
sparse Gaussian elimination and orthogonal factorization
– Distributed
- 1993
|
|
1
|
of sparse direct solvers
– Scalabilty
- 1992
|
|
