WSSMP: A high-performance serial and parallel symmetric sparse linear solver

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1541, Issue , 1998, Pages 182-194

  Gupta, Anshul ^a   Joshi, Mahesh ^b   Kumar, Vipin ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; MEMORY ARCHITECTURE; MESSAGE PASSING; MULTIPROCESSING SYSTEMS;

IMPLEMENTATION ASPECTS; LINEAR SOLVER; PARALLEL SOLVER; SHARED MEMORY MULTIPROCESSOR; SPARSE MATRICES; SYMMETRIC FACTORIZATIONS; SYMMETRIC SYSTEMS; UNIPROCESSORS;

USER INTERFACES;

EID: 36949015956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0095336     Document Type: Conference Paper

References (10)

1. C. Ashcraft and J. W.-H. Liu. Robust ordering of sparse matrices using multisection. Technical Report CS 96-01, Department of Computer Science, York University, Ontario, Canada, 1996.
2. E. Chu et al. Users guide for SPARSPAK-A: Waterloo sparse linear equations package. Technical Report CS-84-36, University of Waterloo, Waterloo, IA, 1984.
3. A. Gupta. Fast and effective algorithms for graph partitioning and sparse matrix ordering. IBM Journal of Research and Development, 41(1/2):171-183, 1997.
4. A. Gupta, M. Joshi, and V. Kumar. WSSMP: Watson symmetric sparse matrix package: The user interface. RC 20923 (92669), IBM T. J. Watson Research Center, Yorktown Heights, NY, July 17, 1997.
5. A. Gupta, G. Karypis, and V. Kumar. Highly scalable parallel algorithms for sparse matrix factorization. IEEE Transactions on Parallel and Distributed Systems, 8(5):502-520, May 1997.
6. B. Hendrickson and E. Rothberg. Improving the runtime and quality of nested dissection ordering. SAND96-0868J, Sandia National Laboratories, Albuquerque, NM, 1996.
7. M. Joshi, A. Gupta, G. Karypis, and V. Kumar. Two dimensional scalable parallel algorithms for solution of triangular systems. TR 97-024, Department of Computer Science, University of Minnesota, Minneapolis, MN, July 1997.
8. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. TR 95-035, Department of Computer Science, University of Minnesota, 1995.
9. G. Karypis and V. Kumar. Parmetis: Parallel graph partitioning and sparse matrix ordering library. TR 97-060, Department of Computer Science, University of Minnesota, 1997.
10. J. W.-H. Liu. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Review, 34:82-109, 1992.