Solution of Sparse Systems of Equations on Multiprocessor Architectures

The primary objective of these lecture notes is to introduce the reader to some basic techniques for solving large sparse systems of equations, along with some currently active areas of research on the subject. In addition, introductory material is included on the basic problems and techniques associated with performing numerical computations on multiprocessors, using the problem of solving large sparse systems as an application example.

[1]  A. George,et al.  Householder reflections versus givens rotations in sparse orthogonal decomposition , 1987 .

[2]  Joseph W. Liu,et al.  A compact row storage scheme for Cholesky factors using elimination trees , 1986, TOMS.

[3]  A. George,et al.  An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems , 1985 .

[4]  G. Forsythe,et al.  Computer solution of linear algebraic systems , 1969 .

[5]  Franklin T. Luk,et al.  A Systolic Architecture for the Singular Value Decomposition , 1982 .

[6]  Iain S. Duff,et al.  Full matrix techniques in sparse Gaussian elimination , 1982 .

[7]  F. Gustavson,et al.  Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine , 1984 .

[8]  Iain S. Duff,et al.  MA28 --- A set of Fortran subroutines for sparse unsymmetric linear equations , 1980 .

[9]  Michael T. Heath,et al.  Symbolic Cholesky factorization on a local-memory multiprocessor , 1987, Parallel Comput..

[10]  Michael T. Heath,et al.  Parallel solution of triangular systems on distributed-memory multiprocessors , 1988 .

[11]  Andrew Harry Sherman,et al.  On the efficient solution of sparse systems of linear and nonlinear equations. , 1975 .

[12]  Joseph W. H. Liu,et al.  Reordering sparse matrices for parallel elimination , 1989, Parallel Comput..

[13]  Robert Schreiber,et al.  A New Implementation of Sparse Gaussian Elimination , 1982, TOMS.

[14]  A. George,et al.  On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices , 1988 .

[15]  Joseph W. H. Liu,et al.  Equivalent sparse matrix reordering by elimination tree rotations , 1988 .

[16]  Joseph W. H. Liu.  On general row merging schemes for sparse given transformations , 1986 .

[17]  G. Stewart.  The economical storage of plane rotations , 1976 .

[18]  John R. Gilbert,et al.  A Parallel Algorithm for Finding Fill in a Sparse Symmetric Matrix , 1986 .

[19]  Iain S. Duff,et al.  Parallel implementation of multifrontal schemes , 1986, Parallel Comput..

[20]  Alan George,et al.  Communication results for parallel sparse Cholesky factorization on a hypercube , 1989, Parallel Comput..

[21]  Alan George,et al.  An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices , 1980, SIAM J. Comput..

[22]  Iain S. Duff,et al.  The Multifrontal Solution of Unsymmetric Sets of Linear Equations , 1984 .

[23]  Dianne P. O'Leary,et al.  Data-flow algorithms for parallel matrix computation , 1985, CACM.

[24]  H.F. Jordan,et al.  Experience with pipelined multiple instruction streams , 1984, Proceedings of the IEEE.

[25]  Stanley C. Eisenstat,et al.  Software for Sparse Gaussian Elimination with Limited Core Storage. , 1978 .

[26]  John R. Gilbert,et al.  Predicting fill for sparse orthogonal factorization , 1986, JACM.

[27]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[28]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[29]  A. H. Sherman,et al.  Applications of an Element Model for Gaussian Elimination , 1976 .

[30]  A. George,et al.  Parallel Cholesky factorization on a shared-memory multiprocessor. Final report, 1 October 1986-30 September 1987 , 1986 .

[31]  Joseph W. H. Liu,et al.  Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.

[32]  Michael T. Heath,et al.  Sparse Cholesky factorization on a local-memory multiprocessor , 1988 .

[33]  G. Stewart.  Introduction to matrix computations , 1973 .

[34]  S. Parter.  The Use of Linear Graphs in Gauss Elimination , 1961 .

[35]  Jochen A. G. Jess,et al.  A Data Structure for Parallel L/U Decomposition , 1982, IEEE Transactions on Computers.

[36]  J. Gilbert,et al.  Sparse Partial Pivoting in Time Proportional to Arithmetic Operations , 1986 .

[37]  Joseph W. H. Liu,et al.  Computational models and task scheduling for parallel sparse Cholesky factorization , 1986, Parallel Comput..

[38]  Andrew H. Sherman,et al.  Algorithm 533: NSPIV, a Fortran subroutine for sparse Gaussian elimination with partial pivoting [F4] , 1978, TOMS.

[39]  A. George,et al.  Symbolic factorization for sparse Gaussian elimination with partial pivoting , 1987 .

[40]  G. A. Geist,et al.  Parallel Cholesky factorization on a hypercube multiprocessor , 1985 .

[41]  A. George,et al.  Solution of sparse linear least squares problems using givens rotations , 1980 .

[42]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[43]  A. George,et al.  Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations , 1986 .

[44]  Stanley C. Eisenstat,et al.  Minimal Storage Band Elimination. , 1977 .