Towards a scalable hybrid sparse solver

Concurrency Practice and Experience

Volumn 12, Issue 2, 2000, Pages 53-68

  Ng, Esmond G ^a   Raghavan, Padma ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b University of Tennessee   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY CONTROL; ITERATIVE METHODS; LINEAR SYSTEMS; MATRIX ALGEBRA;

CHOLESKY FACTORIZATION; CONJUGATE GRADIENTS; SPARSE MATRIX FACTORIZATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0033723153     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1096-9128(200002/03)12:2/3<53::AID-CPE473>3.0.CO;2-B     Document Type: Article

References (57)

1. Chan TF, Smith B. Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes. Tech. Rep. CAM 93-42, University of California at Los Angeles, 1993.
2. Gropp W, Keyes D. Complexity of parallel implementation of domain decomposition techniques for elliptic partial differential equations. SIAM J. Sci. Comput. 1988; 9:312-326.
3. Ashby SF, Seager MK. A proposed standard for iterative solvers. Tech. Rep. UCRL-102860, Numerical Mathematics Group, Computing and Mathematics Division, Lawrence Livermore Lab, January 1990.
4. Concus P, Golub G, O'Leary D. A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations. Sparse Matrix Computations, Bunch JR, Rose DJ (eds.); Academic Press, 1976; pp. 309-332.
5. Freund R, Nachtigal N. QMR: A quasi-minimum residual method for non-Hermitian linear systems. Numer. Math. 1991; 60:315-339.
6. Hestenes MR, Stiefel E. Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 1952; 49:409-436.
7. Saad Y, Schultz M. GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 1986; 7:856-869.
8. Duff IS, Erisman AM, Reid JK. Direct Methods for Sparse Matrices; Clarendon Press: Oxford. 1986.
9. George A, Liu JW-H. Computer Solution of Large Sparse Positive Definite Systems; Prentice-Hall Inc.: Englewood Cliffs, New Jersey, 1981.
10. MPI Forum. MPI: A message-passing interface standard. Tech. Rep. CS-94-230, Computer Science Dept., Univ. of Tennessee, Knoxville, April 1994.
11. Oppe TC, Joubert WD, Kincaid D. ITPACKV 2D user's guide. Tech. Rep. CNA-232, Center for Numerical Analysis, The University of Texas at Austin, May 1989.
12. Smith B, McInnes L, Gropp W. PETSc 2.0 user's manual. Tech. Rep. ANL-95/11 - Revision 2.0.22, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne IL 60439, 1997.
13. Golub G, van Loan C. Matrix Computations; The Johns Hopkins University Press: Baltimore, MD, 1996.
14. Manteuffel TA. An incomplete factorization technique for positive definite linear systems. Math. Comput. 1980; 34:473-497.
15. Munksgaard N. Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients. ACM Trans. Math. Softw. 1980; 6:206-219.
16. Amestoy P, Davis TA, Duff IS. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 1996; 17:886-905.
17. George JA. Nested dissection of a regular finite element mesh. SIAM J. Numer. Anal. 1973; 10:345-363.
18. George JA, Liu JW-H. An automatic nested dissection algorithm for irregular finite element problems. SIAM J. Numer. Anal. 1978; 15:1053-1069.
19. Liu JW-H. Modification of the minimum degree algorithm by multiple elimination. ACM Trans. Math. Softw. 1985; 11:141-153.
20. Ng EG, Raghaven P. Performance of greedy ordering heuristics for sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 1999; 20:902-914.
21. Gilbert J, Ng E, Peyton B. An efficient algorithm to compute row and column counts for sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 1994; 15:1075-1091.
22. Liu JW-H. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 1990; 11:134-172.
23. Lawson CL, Hanson R, Kincaid D, Krogh F. Basic linear algebra subprograms for Fortran usage. ACM Trans. Math. Softw. 1979; 5:308-323.
24. Ng E, Peyton BW. Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 1993; 14:1034-1056.
25. Liu J, Ng E, Peyton B. On finding supernodes for sparse matrix computations. SIAM J. Matrix Anal. Appl. 1993; 14:242-252.
26. Meijerink JA, Van der Vorst HA. An iterative solution methods for which the coefficient matrix is a symmetric M-matrix. Math. Comput. 1977; 31:148-162.
27. Munksgaard N. Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients. ACM Trans. Math. Softw. 1980; 6:206-219.
28. Zlatev Z. Use of iterative refinement in the solution of sparseb linear systems. SIAM J. Numer. Anal. 1987; 19:381-399.
29. Parter S. The use of linear graphs in Gaussian elimination. SIAM Review 1961; 3:364-369.
30. Rose D. A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. Graph Theory and Computing, Read RC (ed.); Academic Press, 1972; pp. 183-217.
31. Rose D, Tarjan R, Lueker G. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 1976; 5:266-283.
32. Saad Y. ILUT: A dual threshold incomplete ILU factorization. Num. Lin. Alg. Appl. 1994; 1:387-402.
33. Gilbert J, Ng E, Peyton B, Raghavan P. Performance of ICCG. Tech. Rep. UTK-CS-97-381, Department of Computer Science, University of Tennessee, Knoxville, TN 37996-1301, 1997.
34. Ng E, Peyton B, Raghavan P. A blocked incomplete Cholesky preconditioner for hierarchical-memory computers. Proceedings of Iterative Methods in Scientific Computing IV, Kincaid DR, Elster AC (eds.); IMACS, 1999; pp. 211-222.
35. Duff I, Grimes R, Lewis J. Sparse matrix test problems. ACM Trans. Math. Softw. 1989; 15:1-14.
36. Guo B, Liu J. Direct visible surface interpolation. Tech. Rep., York University, Department of Computer Science, North York, Ontario, Canada, M3J 1P3, 1997.
37. Ashcraft C, Eisenstat S, Liu JW-H, Peyton B, Sherman A. A compute-ahead implementation of the fan-in sparse distributed factorization scheme. Tech. Rep. ORNL/TM-11496, Oak Ridge National Laboratory, Oak Ridge, TN, 1990.
38. Gupta A, Kumar V. A scalable parallel algorithm for sparse matrix factorization. Tech. Rep. 94-19, Department of Computer Science, University of Minnesota, Minneapolis, MN, A short version submitted for Supercomputing '94. 1994.
39. Gupta A, Rothberg E, Ng E, Peyton BW. Parallel sparse Cholesky factorization algorithms for shared-memory mutliprocessor systems. Advances in Computer Methods for Partial Differential Equations - VII, Vichnevetsky R, Knight D, Richter G (eds.); International Association for Mathematics and Computers in Simulation (IMACS), 1992; pp. 622-628.
40. Harrold TR. A portable scalable implementation of multifrontal Cholesky on distributed memory machines. Tech. Rep., Dept. of Computer Science, Univ. of Tennessee, July 1997.
41. Karypis G, Kumar V. Parallel multilevel graph partitioning. Tech. Rep. 95-036, Department of Computer Science, University of Minnesota, Minneapolis, MN, May 1995.
42. Kratzer S. Massively parallel sparse matrix computations. Tech. Rep. SRC-TR-90-008, Supercomputing Research Center, Bowie, MD 20715, 1990.
43. Lucas R . Solving planar systems of equations on distributed-memory multiprocessors. PhD thesis, Department of Electrical Engineering, Stanford University, 1987.
44. Raghavan P. Distributed sparse Gaussian elimination and orthogonal factorization. SIAM J. Sci. Comput. 1995; 16:1462-1477.
45. Raghavan P. Efficient parallel triangular solution with selective inversion. Parallel Process. Lett. 1998; 8:29-40.
46. Raghavan P. Parallel ordering using edge contraction. Parallel Comput. 1997; 23:1045-1067.
47. Rothberg E. A parallel implementation of the multiple minimum degree heuristic. Presentation, Fifth Siam Conference on Applied Linear Algebra; Snowbird: Utah, 1994.
48. Rothberg E. Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multiprocessors. Tech. Rep., Intel Supercomputer Systems Division, 14924 N. W. Greenbrier Parkway, Beaverton, OR 97006, September 1993.
49. Schreiber R. Scalabilty of sparse direct solvers. Graph Theory and Sparse Matrices Computations, George JA, Gilbert JR, Liu JWH (eds.); Springer-Verlag, 1993; pp. 191-209.
50. Sun C. Efficient parallel solutions of large sparse SPD systems on distributed memory multiprocessors. Tech. Rep. CTC-92-TR-102, Advanced Computing Research Institute, Center For Theory and Simulation in Science and Engineering, Cornell University, Ithaca, NY 14853, August 1992.
51. Zmijewski E. Sparse Cholesky factorization on a multiprocessor. PhD thesis. Department of Computer Science, Cornell University, August 1987.
52. George A, Liu JW-H, Ng EG-Y. Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Comput. 1989; 10:287-298.
53. Duff IS, Reid JK. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans: Math. Softw. 1983; 9:302-325.
54. Heath M, Raghavan P. Parallel sparse triangular solution. IMA Volumes in Mathematics and its Applications, Gulliver R, Heath M, Schreiber R, Bjorstad P (eds.); vol. 105, Springer-Verlag, 1998; pp. 289-306.
55. Eisenstat SC, Heath MT, Henkel CS, Romine CH. Modified cyclic algorithms for solving triangular systems on distributed-memory multiprocessors. SIAM J. Sci. Stat. Comput. 1988; 9:589-600.
56. Li G, Coleman T. A parallel triangular solver for a hypercube multiprocessor. SIAM J. Sci. Stat. Comput. 1988; 9:458-502.
57. Li G, Coleman T. A new method for solving triangular systems on distributed memory message passing multiprocessors. SIAM J. Sci. Stat. Comput. 1989; 10:382-396.