next up previous
Next: Minimum-Degree Ordering Up: Parallel Choleski Factorization of Previous: Acknowledgments

References

1
S. T. Barnard and H. D. Simon. A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems. Technical Report RNR-92-033, NASA Ames Research Center, November 1992.

2
A. R. Bergen. Power Systems Analysis. Prentice-Hall, 1986.

3
J. J. Dongarra, D. C. Sorensen I. S. Duff, and H. A. van der Vorst. Solving Linear Systems on Vector and Shared Memory Computers. SIAM, Philadelphia, 1991.

4
I. S. Duff, A. M. Erisman, and J. K. Reid. Direct Methods for Sparse Matrices. Oxford University Press, Oxford, 1990.

5
I. S. Duff, R. G. Grimes, and J. G. Lewis. Users` Guide for the Harwell-Boeing Sparse Matrix Collection. Technical Report TR/PA/92/86, Boeing Computer Services, October 1992. (available by anonymous ftp at orion.cerfacs.fr).

6
E. Anderson, et. al. LAPACK User's Guide. SIAM, Philadelphia, 1992.

7
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors. Prentice Hall, 1988.

8
A. George and E. Eg. Some Shared Memory is Desirable in Parallel Sparse Matrix Computation. SIGNUM Newsletter, 23(2):9--13, April 1988.

9
A. George, M. T. Heath, J. Liu, and E. Ng. Solution of Sparse Positive Definite Systems on a Shared-Memory Multiprocessor. International Journal of Parallel Programming, 15(4):309--328, August 1986.

10
A. George, M. T. Heath, J. Liu, and E. Ng. Sparse Cholesky Factorization on a Local-Memory Multiprocessor. SIAM journal on Scientific and Statistical Computing, 9(2):327--340, March 1988.

11
A. George, M. T. Heath, J. Liu, and E. Ng. Solution of Sparse Positive Definite Systems on a Hypercube. Journal of Computational and Applied Mathematics, 27:129--156, 1989.

12
A. George and J. Liu. The Evolution of the Minimum Degree Ordering Algorithm. SIAM Review, 31(1):1--19, March 1989.

13
H. H. Happ. Diakoptics - The Solution of System Problems by Tearing. Proceedings of the IEEE, 62(7):930--940, July 1974.

14
M. T. Heath, E. Ng, and B. W. Peyton. Parallel Algorithms for Sparse Linear Systems. In Parallel Algorithms for Matrix Computations, pages 83--124. SIAM, Philadelphia, 1991.

15
D. P. Koester, S. Ranka, and G. C. Fox. Parallel Block-Diagonal-Bordered Sparse Linear Solvers for Electrical Power System Applications. In A. Skjellum, editor, Proceeding of the Scalable Parallel Libraries Conference. IEEE Press, 1994.

16
V. Pan. Parallel Solution of Sparse Linear and Path Systems. In J. H. Reif, editor, Synthesis of Parallel Algorithms, chapter 14. Morgan Kaufmann, San Mateo, CA, 1993.

17
A. Pothen, H. Simon, and K.. P. Liou. Partitioning Sparse Matrices with Eigenvalues of Graphs. SIAM J. Mat. Anal. Appl., 11(3):pp. 430--452, 1990.

18
R. A. Saleh, K. A. Gallivan, M. Chang, I. N. Hajj, D. Smart, and T. N. Trick. Parallel Circuit Simulation on Supercomputers. Proceedings of the IEEE, 77(12):1915--1930, December 1989.

19
A. Sangiovanni-Vincentelli, L. K. Chen, and L. O. Chua. Node-Tearing Nodal Analysis. Technical Report ERL-M582, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, October 1976.

20
H. D. Simon. Partitioning of Unstructured Problems for Parallel Processing. Technical Report RNR-91-008, NASA Ames Research Center, February 1991.

21
Thinking Machines Corporation, Cambridge, MA. CMMD Reference Manual,: Preliminary Documentation for Version 3.0 Beta, December 1992.

22
S. Venugopal and V. K. Naik. Effects of Partitioning and Scheduling Sparse Matrix Factorization on Communications and Load Balance. NASA Contractor Report 189563 ICASE Report No. 91-80, NASA, Langley Research Center, October 1991.

23
S. Venugopal and V. K. Naik. SHAPE: A Parallelization Tool for Sparse Matrix Computations. Research Report RC 17899 (77448), IBM Research Division, T. J. Watson Research Center Yorktown Heights, NY 10598, January 1992.

24
S. Venugopal and V. K. Naik. Towards Understanding Block Partitioning for Sparse Cholesky Factorization. Research Report RC 18666 (80517), IBM Research Division, T. J. Watson Research Center Yorktown Heights, NY 10598, October 1992.

25
S. Venugopal and V. K. Naik. Towards Understanding Block Partitioning for Sparse Cholesky Factorization. pages 792--796, April 1993.

26
S. Venugopal, V. K. Naik, and J. Saltz. Performance of Distributed Sparse Cholesky Factorization with Pre-scheduling. Research Report RC 18623 (78732), IBM Research Division, T. J. Watson Research Center Yorktown Heights, NY 10598, April 1992.

27
G. von Laszewski, M. Parashar, A. G. Mohamed, and G. C. Fox. High Performance Scalable Matrix Algebra Algorithms for Distributed Memory Architectures. Technical Report SCS-271, Northeast Parallel Architectures Center, Syracuse University, 1992.

28
G. von Laszewski, M. Parashar, A. G. Mohamed, and G. C. Fox. On the Parallelization of Blocked LU Factorization Algorithms on Distributed Memory Architectures. Technical Report SCS-271b, Northeast Parallel Architectures Center, Syracuse University, June 1992.

29
Y. Wallach. Calculations and Programs for Power System Networks. Prentice-Hall, 1986.

30
M. Zubair and M. Ghose. A Performance Study of Sparse Cholesky Factorization on the INTEL iPSC/860. NASA Contractor Report 189634 ICASE Report No. 92-13, NASA, Langley Research Center, March 1992.



David P. Koester
Sun Oct 22 15:40:25 EDT 1995