Solving large nonsymmetric sparse linear systems using MCSPARSE

Parallel Computing

Volumn 22, Issue 10, 1996, Pages 1291-1333

  Gallivan, K A ^a   Marsolf, B A ^a   Wijshoff, H A G ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Cedar system; Implementation; Linear algebra; Parallel processing systems; Sparse linear systems

Indexed keywords

HIERARCHICAL SYSTEMS; MATHEMATICAL TECHNIQUES; PARALLEL PROCESSING SYSTEMS; SYSTEM STABILITY;

CEDAR SYSTEM; HIERARCHICAL PARALLELISM; LOAD BALANCING; REORDERING; SPARSE LINEAR SYSTEMS;

LINEAR ALGEBRA;

EID: 0030421529     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(96)00047-6     Document Type: Article

References (48)

1. G. Alaghband, Parallel pivoting combined with parallel reduction and fill-in control, Parallel Computing 11 (1989) 201-221.
2. M. Arioli and I.S. Duff, Experiments in tearing large sparse systems, in: M.G. Cox and S. Hammarling, eds., Reliable Numerical Computation (Oxford University Press, New York, 1990) 207-226.
3. 5 algorithms for in-core factorization of sparse matrices, SIAM J. Sci. Statist. Comput. 11 (5) (1990) 913-927.
4. C.C. Ashcraft, R.G. Grimes, J.G. Lewis, B.W. Peyton and H.D. Simon, Progress in sparse matrix methods for large linear systems on vector supercomputers, Internat. J. Supercomputing Appl. 1 (4) (1987) 10-30.
5. J.R. Bunch, Analysis of sparse elimination, SIAM J. Numer. Anal. 11 (5) (1974) 847-873.
6. L.K. Cheung and E.S. Kuh, The bordered triangular matrix and minimum essential sets of a digraph, IEEE Trans. Circuits Systems 21 (5) (1974) 633-639.
7. T.A. Davis, Users' guide for the unsymmetric pattern multifrontal package (UMFPACK, Version 1.1), Tech. Rept. TR-95-004, CISE Department, University of Florida, 1995.
8. T.A. Davis and E.S. Davidson, Pairwise reduction for the direct, parallel solution of sparse unsymmetric sets of linear equations, IEEE Trans. Comput. 37 (12) (1988) 1648-1654.
9. T.A. Davis and P.C. Yew, A nondeterministic parallel algorithm for general unsymmetric sparse LU factorization, SIAM J. Matrix Anal. Appl. 11 (3) (1990) 383-402.
10. I.S. Duff, Algorithm 575, Permutations for a zero-free diagonal, ACM Trans. Math. Software 7 (3) (1981) 387-390.
11. I.S. Duff, On algorithms for obtaining a maximum transversal, ACM Trans. Math. Software 7 (3) (1981) 315-330.
12. I.S. Duff, Parallel implementation of multifrontal schemes, Parallel Computing 3 (1986) 193-204.
13. I.S. Duff and J.K. Reid, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software 9 (1983) 302-325.
14. 4 algorithm for reordering unsymmetric sparse matrices, SIAM J. Numer. Anal. 22 (2) (1985) 369-385.
15. A.M. Erisman, R.G. Grimes, J.G. Lewis, W.G. Poole and H.D. Simon, Evaluation of orderings for unsymmetric sparse matrices, SIAM J. Sci. Statist. Comput. 8 (4) (1987) 600-624.
16. K. Gallivan, B. Marsolf and H. Wijshoff, A large-grain parallel sparse system solver, in: Proc. 4th SIAM Conf. on Parallel Proc. for Scient. Comp. Chicago, IL, (1989) 23-28.
17. K. Gallivan, A. Sameh and Z. Zlatev, Parallel hybrid sparse linear system solver, Computing Systems in Engineering 1 (1990) 183-195.
18. K. Gallivan, A. Sameh and Z. Zlatev, Solving general sparse linear systems using conjugate gradient-type methods, in: Proc. 1990 Internat. Conf. on Supercomputing, Amsterdam, The Netherlands (ACM Press, New York, 1990) 132-139.
19. K. Gallivan, A. Sameh and Z. Zlatev, Parallel direct method codes for general sparse matrices, in: Spedicato, Bertocchi and Vespucci, eds., Proc. NATO ASI on Linear Systems, 1991.
20. K.A. Gallivan, P.C. Hansen, T. Ostromsky and Z. Zlatev, A locally optimized reordering algorithm and its application to a parallel sparse linear system solver, Computing 54 (1) 39-67.
21. K.A. Gallivan, B.A. Marsolf and H.A.G. Wijshoff, MCSPARSE A parallel sparse unsymmetric linear system solver. Tech. Rept. CSRD Report No. 1142, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, 1991.
22. K.A. Gallivan, B.A. Marsolf and H.A.G. Wijshoff, The parallel solution of nonsymmetric sparse linear systems using the H * reordering and an associated factorization, in: Proc. 8th ACM Internat. Conf. on Supercomputing Manchester, England (1994) 419-430.
23. C W. Gear, Numerical errors in sparse linear equations, Tech. Rept. UIUDCS-F-75-885, Department of Computer Science, University of Illinois, Urbana, IL, 1975.
24. A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal. 10 (2) (1973) 345-363.
25. A. George, An automatic one-way dissection algorithm for irregular finite element problems, SIAM J. Numer. Anal. 17 (6) (1980) 740-751.
26. A. George and J.W.H. Liu, An automatic nested dissection algorithm for irregular finite-element problems, SIAM J. Numer. Anal. 15 (1978) 1053-1069.
27. A. George and J.W. Liu, Computer Solution of Large Sparse Positive Definite Systems (Prentice Hall, Englewood Cliffs, NJ, 1981).
28. J.P. Geschiere, Research on parallelizing the reordering phase of MCSPARSE, a large grain parallel sparse unsymmetric linear system solver, Master Thesis, Tech. Rept. INF/SCR-92-23. Department of Computer Science, Utrecht University, 1992.
29. J.P. Geschiere and H.A.G. Wijshoff, Exploiting large grain parallelism in a sparse direct linear system solver, Tech. Rept. 93-18, High Performance Computing Division, Leiden University, 1993.
30. F.G. Gustavson, Finding the block lower triangular form of a matrix, in: J.R. Bunch and D.J. Rose, eds., Sparse Matrix Computations (Academic Press, New York, 1976).
31. S.M. Hadfield and T.A. Davis, A distributed memory, multifrontal method for sequences of unsymmetric pattern matrices, in: Proc. 1995 Internat. Conf. on Parallel Processing, Volume 3: Algorithms and Applications (1995) 42-45.
32. M. Hall Jr, An algorithm for distinct representatives, Amer. Math. Monthly 63 (10) (1956) 716-717.
33. 4), in: D.J. Rose and R.A. Willoughby, eds., Sparse Matrices and their Applications (Plenum, New York, 1972).
34. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput. 2 (4) (1973) 225-231.
35. H.W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly 2 (1) (1955) 83-97.
36. C.E. Leiserson and J.G. Lewis, Orderings for parallel sparse symmetric factorization, in: Proc. 3rd SIAM Conf. on Parallel Proc. for Scient. Comp., Los Angeles, CA (1987) 27-31.
37. T.D. Lin and R.S.H. Mah, Hierarchical partition - A new optimal pivoting algorithm, Mathematical Programming 12:260-278, 1977.
38. R.J. Lipton, D.J. Rose and R.E. Tarjan, Generalized nested dissection, SIAM J. Numer. Anal 16 (1979) 346-358.
39. J.W.H. Liu, The multifrontal method for sparse matrix solution: Theory and practice, SIAM Review 34 (1) (1992) 82-109.
40. B. Marsolf, Large grain parallel sparse system solver, Master Thesis, Tech. Rept. CSRD Report No. 1125, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, 1991.
41. A. Sangiovanni-Vincentelli, An optimization problem arising from tearing methods, in: J.R. Bunch and D.J. Rose, eds., Sparse Matrix Computations (Academic Press, New York, 1976) 97-110.
42. Staff, The Cedar project, Tech. Rept. CSRD Report No. 1122, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, 1991.
43. D.V. Steward, Partitioning and tearing systems of equations, SIAM J. Numer. Anal. 2 (2) (1965) 345-365.
44. R.E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1 (1972) 146-160.
45. A.F. van der Stappen, R.H. Bisseling and J.G.G. van de Vorst, Parallel sparse LU decomposition on a mesh network of transputers, SIAM J. Matrix Anal. Appl. 14 (1993) 853-879.
46. X. Wang, private communication.
47. H.A.G. Wijshoff, Symmetric orderings for unsymmetric sparse matrices, Tech. Rept. CSRD Report No. 901, Center for Supercomputing Research and Development, University of Illinois, Urbana, IL, 1989.
48. U. Meier Yang, Preconditioned iterative solver for nonsymmetric linear systems, Ph.D. Thesis, University of Illinois at Urbana-Champaign, 1994.