\begin{thebibliography}{10}

\bibitem{alvarado93}
Fernando~L. Alvarado, Alex Pothen, and Robert Schreiber.
\newblock The fan-both family of column-based distributed cholesky
  factorization algorithms.
\newblock In Alan George, John~R. Gilbert, and Joseph~W.H. Liu, editors, {\em
  Graph theory and sparse matrix computation}, pages 159--190. Springer-Verlag,
  New York, 1993.

\bibitem{amestoyduff98}
P.~R. Amestoy, I.~S. Duff, and J.-Y. L'Excellent.
\newblock Multifrontal parallel distributed symmetric and unsymmetric solvers.
\newblock Technical Report RAL-TR-98-051, Rutherford Appleton Laboratory, 1998.

\bibitem{lapackmanual}
E.~Anderson, Z.~Bai, C.~Bischof, J.~Demmel, J.~Dongarra, J.~Du~Croz,
  A.~Greenbaum, S.~Hammarling, A.~McKenney, S.~Ostrouchov, and D.~Sorensen.
\newblock {\em {LAPACK} Users' Guide, Release 2.0}.
\newblock {SIAM}, Philadelphia, 1995.
\newblock 324 pages.

\bibitem{scalapackmanual}
L.~S. Blackford, J.~Choi, E.~D'Azevedo, J.~Demmel, I.~Dhillon, J.~Dongarra,
  S.~Hammarling, G.~Henry, A.~Petitet, K.~Stanley, D.~Walker, and R.~C. Whaley.
\newblock {\em {ScaLAPACK} Users' Guide}.
\newblock {SIAM}, Philadelphia, 1997.
\newblock 325 pages.

\bibitem{davis97}
Timothy~A. Davis.
\newblock University of {Florida} sparse matrix collection.
\newblock http://www.cise.ufl.edu/$\sim$davis.

\bibitem{davis96}
Timothy~A. Davis, John~R. Gilbert, Esmond Ng, and Barry Peyton.
\newblock Approximate minimum degree ordering for unsymmetric matrices.
\newblock Talk presented at XIII Householder Symposium on Numerical Algebra,
  June 1996. Journal version in preparation.

\bibitem{demmel97}
James~W. Demmel.
\newblock {\em Applied Numerical Linear Algebra}.
\newblock SIAM, Philadelphia, 1997.

\bibitem{superlu95}
James~W. Demmel, Stanley~C. Eisenstat, John~R. Gilbert, Xiaoye~S. Li, and
  Joseph~W.H. Liu.
\newblock A supernodal approach to sparse partial pivoting.
\newblock Technical Report UCB//CSD-95-883, Computer Science Division, U.C.
  Berkeley, 1995.
\newblock To appear in {\em SIAM J. Matrix Anal. Appl.}

\bibitem{superlu_shm97}
James~W. Demmel, John~R. Gilbert, and Xiaoye~S. Li.
\newblock An asynchronous parallel supernodal algorithm for sparse gaussian
  elimination.
\newblock Technical Report UCB//CSD-97-943, Computer Science Division, U.C.
  Berkeley, 1997.
\newblock To appear in {\em SIAM J. Matrix Anal. Appl.}

\bibitem{superlu_sw}
James~W. Demmel, John~R. Gilbert, and Xiaoye~S. Li.
\newblock {SuperLU and SuperLU\_MT}, November 1997.
\newblock http://www.netlib.org/scalapack/prototype/.

\bibitem{duff81c}
I.~S. Duff.
\newblock Algorithm 575. {P}ermutations for a zero-free diagonal.
\newblock {\em ACM Trans.\ Mathematical Software}, 7:387--390, 1981.

\bibitem{duff81b}
I.~S. Duff.
\newblock On algorithms for obtaining a maximum transversal.
\newblock {\em ACM Trans.\ Mathematical Software}, 7:315--330, 1981.

\bibitem{duffkoster97}
Iain~S. Duff and Jacko Koster.
\newblock The design and use of algorithms for permuting large entries to the
  diagonal of sparse matrices.
\newblock Technical Report RAL-TR-97-059, Rutherford Appleton Laboratory, 1997.

\bibitem{duffgrimes92}
I.S. Duff, R.G. Grimes, and J.G. Lewis.
\newblock Users' guide for the {Harwell-Boeing} sparse matrix collection
  (release 1).
\newblock Technical Report RAL-92-086, Rutherford Appleton Laboratory, December
  1992.

\bibitem{yang98}
C.~Fu, X.~Jiao, and T.~Yang.
\newblock Efficient sparse {LU} factorization with partial pivoting on
  distributed memory architectures.
\newblock {\em IEEE Trans. Parallel and Distributed Systems}, 9(2):109--125,
  1998.

\bibitem{gallivan96}
K.~A. Gallivan, B.~A. Marsolf, and H.~A.~G. Wijshoff.
\newblock Solving large nonsymmetric sparse linear systems using {MCSPARSE}.
\newblock {\em Parallel Computing}, 22:1291--1333, 1996.

\bibitem{george73}
J.~George.
\newblock Nested dissection of a regular finite element mesh.
\newblock {\em SIAM J. Numerical Analysis}, 10:345--363, 1973.

\bibitem{gilbertliu93}
John~R. Gilbert and Joseph~W.H. Liu.
\newblock Elimination structures for unsymmetric sparse {LU} factors.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 14(2):334--352, April 1993.

\bibitem{golubvanloan}
G.~Golub and C.~Van~Loan.
\newblock {\em Matrix Computations}.
\newblock Johns Hopkins University Press, Baltimore, MD, {T}hird edition, 1996.

\bibitem{guptakumar95}
A.~Gupta and V.~Kumar.
\newblock Optimally scalable parallel sparse cholesky factorization.
\newblock In {\em The 7th SIAM Conference on Parallel Processing for Scientific
  Computing}, pages 442--447, 1995.

\bibitem{jonesplassmann94}
Mark~T. Jones and Paul~E. Plassmann.
\newblock Scalable iterative solution of sparse linear systems.
\newblock {\em Parallel Computing}, (20):753--773, 1994.

\bibitem{li96}
Xiaoye~S. Li.
\newblock Sparse {G}aussian elimination on high performance computers.
\newblock Technical Report UCB//CSD-96-919, Computer Science Division, U.C.
  Berkeley, September 1996.
\newblock Ph.D dissertation.

\bibitem{liu85}
Joseph~W.H. Liu.
\newblock Modification of the minimum degree algorithm by multiple elimination.
\newblock {\em ACM Trans. Math. Software}, 11:141--153, 1985.

\bibitem{raghavan95b}
Padma Raghavan.
\newblock Efficient parallel sparse triangular solution with selective
  inversion.
\newblock Technical Report CS-95-314, Department of Computer Science,
  University of Tennessee, 1995.

\bibitem{rothberg93}
E.~E. Rothberg and A.~Gupta.
\newblock An efficient block-oriented approach to parallel sparse cholesky
  factorization.
\newblock In {\em Supercomputing}, pages 503--512, November 1993.

\bibitem{mpi-forum}
Message {P}assing {I}nterface ({MPI}) forum.
\newblock http://www.mpi-forum.org/.

\end{thebibliography}
