Skip to main content
SpringerLink
Log in

Parallel sparse Cholesky factorization

  • Systems and Applications
  • Conference paper
  • First Online:
Solving Irregularly Structured Problems in Parallel (IRREGULAR 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1253))

  • 165 Accesses

Abstract

In this paper we describe algorithms for the ordering and numerical factorization step in parallel sparse Cholesky factorization. Direct methods for solving sparse positive definite systems play an important role in many scientific applications such as linear programming and structual engineering. The importance of direct methods is mainly due to their generality and robustness. The paper describes minimum degree and nested dissection based ordering methods and presents a scalable parallel algorithm for the factorization of sparse matrices. The interested reader will find many references to the relevant literature.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F.L. Alvarado, A. Pothen, R. Schreiber, Highly parallel sparse triangular solution, RIACS Techn. Rep. 92.11, NASA Ames Research Center, 1992.

    Google Scholar 

  2. P. Amestoy, T.A. Davis, I.S. Duff, An approximate minimum degree ordering algorithm, Techn. Rep. TR/PA/95/09, Parallel Algorithm Project, CERFACS, Toulouse, 1995.

    Google Scholar 

  3. C. Ashcraft, S.C. Eisenstat, J.W.H. Liu, A. Sherman, A comparison of three distributed sparse factorization schemes, SIAM Symposium on Sparse Matrices, 1989.

    Google Scholar 

  4. C. Ashcraft, S.C. Eisenstat, J.W.H. Liu, A fan-in algorithm for distributed sparse numerical factorization, SIAM J. Sci. Stat. Comput., Vol. 11, No. 3, 593–599, 1990.

    Google Scholar 

  5. C. Ashcraft, J.W.H. Liu, Using domain decomposition to find graph bisectors, Techn. Rep. ISSTECH-95-024, Boeing Computer Services, Seattle, 1995.

    Google Scholar 

  6. C. Ashcraft, J.W.H. Liu, Robust ordering of sparse matrices using multisection, Techn. Rep. ISSTECH-96-002, Boeing Computer Services, Seattle, 1996.

    Google Scholar 

  7. C. Ashcraft, J.W.H. Liu, applications of the Dulmage-Mendelsohn decomposition and network flow of graph bisection improvement, Techn. Rep., Boeing Computer Services, Seattle, 1996.

    Google Scholar 

  8. S.T. Barnard, H.D. Simon, A fast multilevel implementation of recursive spectral bisection, Proc. of 6th SIAM Conf. Parallel Processing for Scientific Computing, 711–718, 1993.

    Google Scholar 

  9. P. Berman, G. Schnitger, On the performance of the minimum degree ordering for Gaussian elimination, SIAM J. Matrix Anal. Appl., Vol. 11, No. 1, 83–88, 1990.

    Google Scholar 

  10. C.-K. Cheng, Y.-C. Weil, An improved two-way partitioning algorithm with stable performance, IEEE Transactions on Computer Aided Design, Vol. 10, No. 12, 1502–1511, 1991.

    Google Scholar 

  11. R. Diekmann, B. Monien, R. Preis, Using helpful sets to improve graph bisections, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Volume 21, 1995.

    Google Scholar 

  12. I.S. Duff, J.K. Reid, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, Vol. 9, 302–325, 1983.

    Google Scholar 

  13. A. Dulmage, N. Mendelsohn, Coverings of bipartite graphs, Can. J. Math., Vol. 10, 517–534, 1958.

    Google Scholar 

  14. S.C. Eisenstat, M.H. Schultz, A.H. Sherman, Algorithms and data structures for sparse symmetric Gaussian elimination, SIAM J. Sci. Stat. Comput., Vol. 2, No. 2, 225–237, 1981.

    Google Scholar 

  15. C.M. Fiduccia, R.M. Mattheyses, A linear-time heuristic for improving network partitions, 19th IEEE Design Automation Conference, 175–181, 1982.

    Google Scholar 

  16. K.A. Gallivan, R.J. Plemmons, A.H. Sameh, Parallel algorithms for dense linear algebra computations, SIAM Review Vol. 32, No. 1, 54–135, 1990.

    Google Scholar 

  17. G.A. Geist, C.H. Romine, LU factorization algorithms on distributed-memory multiprocessor architectures, SIAM J. Sci. Stat. Comput., Vol. 9, No. 4, 639–649, 1988.

    Google Scholar 

  18. G.A. Geist, E. Ng, Task scheduling for parallel sparse Cholesky factorization, International Journal of Parallel Programming, Vol. 18, No. 4, 291–314, 1989.

    Google Scholar 

  19. A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., Vol. 10, No. 2, 345–363, 1973.

    Google Scholar 

  20. A. George, J.W.H. Liu, An automatic nested dissection algorithm for irregular finite element problems, SIAM J. Numer. Anal., Vol. 15, No. 5, 1053–1069, 1978.

    Google Scholar 

  21. A. George, M.T. Heath, E. Ng, J.W.H. Liu, Symbolic Cholesky factorization on a local-memory multiprocessor, Parallel Computing, 85–95, 1987.

    Google Scholar 

  22. J.A. George, J.W.H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.

    Google Scholar 

  23. A. George, J.W.H. Liu, A minimal storage implementation of the minimum degree algorithm, SIAM J. Numer. Anal, Vol. 17, No. 2, 282–299, 1980.

    Google Scholar 

  24. A. George, J.W.H. Liu, A fast implementation of the minimum degree algorithm using quotient graphs, ACM Trans. Math. Software, Vol. 6, 337–358, 1980.

    Google Scholar 

  25. A. George, J.W.H. Liu, The evolution of the minimum degree ordering algorithm, SIAM Review, Vol. 31, No. 1, 1–19, 1989.

    Google Scholar 

  26. A. George, J.W.H. Liu, E. Ng, Communication results for parallel sparse Cholesky factorization on a hypercube, Parallel Computing 10, 287–298, 1989.

    Google Scholar 

  27. A. George, M.T. Heath, J.W.H. Liu, E. Ng, Sparse Cholesky factorization on a local-memory multiprocessor, SIAM J. Sci. Stat. Comput., Vol. 9, No. 2, 327–340, 1988.

    Google Scholar 

  28. M. Ghose, E. Rothberg, A parallel implementation of the multiple minimum degree ordering heuristic, Techn. Rep., Old Dominion University, Norfolk, 1994.

    Google Scholar 

  29. N.E. Gibbs, W.G. Poole, P.K. Stockmeyer, An algorithm for reducing the bandwidth and profile of a sparse matrix, SIAM J. Numer. Anal., Vol. 13, 236–250, 1976.

    Google Scholar 

  30. J.R. Gilbert, C. Moler, R. Schreiber, Sparse matrices in MATLAB: design and implementation, SIAM J. Matrix Anal. Appl., Vol. 13, 333–356, 1992.

    Google Scholar 

  31. J.R. Gilbert, R. Schreiber, Highly sparse Cholesky factorization, SIAM J. Sci. Stat. Comput., Vol. 13, No. 5, 1151–1172, 1992.

    Google Scholar 

  32. A. Gupta, Fast and effective algorithms for graph partitioning and sparse matrix ordering, IBM T.J. Watson Research Center, Research Report RC 20496, New York, 1996.

    Google Scholar 

  33. A. Gupta, WGPP: Watson graph partitioning (and sparse matrix ordering) package, users manual, IBM T.J. Watson Research Center, Research Report RC 20453, New York, 1996.

    Google Scholar 

  34. A. Gupta, V. Kumar, A Scalable parallel algorithm for sparse matrix factorization, Tech. Rep. 94-19, CS-Dep., Univ. Minnesota, 1994.

    Google Scholar 

  35. L. Hagen, A. Kahng, A new approach in effective circuit clustering, Proc. of IEEE International Conference on Computer Aided Design, 422–427, 1992.

    Google Scholar 

  36. M.T. Heath, E. Ng, B.W. Peyton, Parallel algorithms for sparse linear systems, SIAM Review, Vol. 33, No. 3, 420–460, 1991.

    Google Scholar 

  37. B. Hendrickson, R. Leland, The chaco user's guide, Tech. Rep. SAND94-2692, Sandia Nat. Lab., 1994.

    Google Scholar 

  38. B. Hendrickson, R. Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput., Vol. 16, 1995.

    Google Scholar 

  39. B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, Proc. of Supercomputing'95, 1995.

    Google Scholar 

  40. B. Hendrickson, E. Rothberg, Improving the runtime and quality of nested dissection ordering, Techn. Rep., SAND96-0868, Sandia Nat. Lab., 1996.

    Google Scholar 

  41. B. Hendrickson, E. Rothberg, Effective sparse matrix ordering: just around the BEND, Proc. of 8th SIAM Conf. Parallel Processing for Scientific Computing, 1997.

    Google Scholar 

  42. L. Hulbert, E. Zmijewski, Limiting communication in parallel sparse Cholesky factorization, SIAM J. Sci. Stat. Comput., Vol. 12, No. 5, 1184–1197, 1991.

    Google Scholar 

  43. G. Karypis, V. Kumar, A high performance sparse Cholesky factorization algorithm for scalable parallel computers, Tech. Rep. 94-41, CS-Dep., Univ. Minnesota, 1994.

    Google Scholar 

  44. G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Tech. Rep. 95-035, CS-Dep., Univ. Minnesota, 1995.

    Google Scholar 

  45. G. Karypis, V. Kumar, METIS: unstructured graph partitioning and sparse matrix ordering system, Techn. Rep., CS-Dep., Univ. Minnesota, 1995.

    Google Scholar 

  46. B.W. Kernighan, S. Lin, An effective heuristic procedure for partitioning graphs, The Bell Systems Technical Journal, 291–308, 1970.

    Google Scholar 

  47. V. Kumar, A. Grama, A. Gupta, G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin Cummings Publishing Company, Redwood City, CA, 1994.

    Google Scholar 

  48. D. König, Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Math. Ann., 77, 453–465, 1916.

    Google Scholar 

  49. M. Leuze, Independent set orderings for parallel matrix factorization by Gaussian elimination, Parallel Computing, Vol. 10, 177–191, 1989.

    Google Scholar 

  50. J.G. Lewis, B.W. Peyton, A. Pothen, A fast algorithm for reordering sparse matrices for parallel factorization, SIAM J. Sci. Stat. Comput., Vol. 10, No. 6, 1146–1173, 1989.

    Google Scholar 

  51. J.W.H. Liu, Modification of the minimum-degree algorithm by multiple elimination, ACM Trans. Math. Software, Vol. 11, No. 2, 141–153, 1985.

    Google Scholar 

  52. J.W.H. Liu, Equivalent sparse matrix reordering by elimination tree rotations, SIAM J. Sci. Stat. Comput., Vol. 9, No. 3, 424–444, 1988.

    Google Scholar 

  53. J.W.H. Liu, A graph partitioning algorithm by node separators, ACM Trans. Math. Software, Vol. 15, No. 3, 198–219, 1989.

    Google Scholar 

  54. J.W.H. Liu, Reordering sparse matrices for parallel elimination, Parallel Computing 11, 73–91, 1989.

    Google Scholar 

  55. J.W.H. Liu, The minimum degree ordering with constraints, SIAM J. Sci. Stat. Comput., Vol. 10, No. 6, 1136–1145, 1989.

    Google Scholar 

  56. J.W.H. Liu, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., Vol. 11, No. 1, 134–172, 1990.

    Google Scholar 

  57. J.W.H. Liu, The multifrontal method for sparse matrix solutions: theory and practice, SIAM Review, Vol. 34, No. 1, 82–109, 1992.

    Google Scholar 

  58. J.W.H. Liu, A. Mirzaian, A linear reordering algorithm for parallel pivoting of chordal graphs, SIAM J. Disc. Math., Vol. 2, No. 1, 100–107, 1989.

    Google Scholar 

  59. R.F. Lucas, T. Blank, J.J. Tiemann, A parallel solution method for large sparse systems of equations, IEEE Transactions on Computer Aided Design, Vol. 6, No. 6, 981–991, 1987.

    Google Scholar 

  60. M. Mu, J.R. Rice, A grid-based subtree-subcube assignment strategy for solving partial differential equations on hypercubes, SIAM J. Sci. Stat. Comput., Vol. 13, No. 3, 826–839, 1992.

    Google Scholar 

  61. S.V. Parter, The use of linear graphs in Gauss elimination, SIAM Review, Vol. 3, 119–130, 1961.

    Google Scholar 

  62. R. Pozo, S.L. Smith, Performance evaluation of the parallel multifrontal method in a distributed-memory environment, Proc. of 6th SIAM Conference on Parallel Processing for Scientific Computing, 1993.

    Google Scholar 

  63. A. Pothen, C.-J. Fan, Computing the block triangular form of a sparse matrix, ACM Trans. Math. Software, Vol. 16, No. 4, 303–324, 1990.

    Google Scholar 

  64. A. Pothen, H.D. Simon, K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., Vol. 11, No. 3, 430–452, 1990.

    Google Scholar 

  65. A. Pothen, C. Sun, Distributed multifrontal factorization using clique trees, Proc. 5th SIAM Conference on Parallel Processing for Scientific Computing, 34–40, 1991.

    Google Scholar 

  66. A. Pothen, C. Sun, A mapping algorithm for parallel sparse Cholesky factorization, SIAM J. Sci. Comput., Vol. 14, No. 5, 1253–1257, 1993.

    Google Scholar 

  67. R. Preis, R. Diekmann, The PARTY partitioning library user guide — version 1.1, Techn. Rep., CS-Dept., Univ. of Paderborn, 1996.

    Google Scholar 

  68. E. Rothberg, A. Gupta, An efficient block-oriented approach to parallel sparse Cholesky factorization, Proc. of Supercomputmg'92. 1992.

    Google Scholar 

  69. D. J. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in Graph-Teory and Computing, R. Read (Ed.), Academic Press, New York, 1972.

    Google Scholar 

  70. D. J. Rose, R.E. Tarjan, G.S. Luecker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., Vol. 5, No. 2, 266–283, 1976.

    Google Scholar 

  71. R. Schreiber, Scalability of sparse direct solvers, in Sparse Matrix Computations: Graph Theory Issues and Algorithms, J.R. Gilbert, J.W.H. Liu (Eds.), Springer Verlag, 1992.

    Google Scholar 

  72. J. Schulze, A new multilevel scheme for constructing vertex separators, Techn. Rep., CS-Dept., Univ. of Paderborn, 1997.

    Google Scholar 

  73. J. Schulze, Implementation of a parallel algorithm for sparse matrix factorization, Techn. Rep., CS-Dept., Univ. of Paderborn, 1996.

    Google Scholar 

  74. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth., Vol. 2, No. 1, 77–79, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Burkhard Monien & Jürgen Schulze

Authors
  1. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Schulze
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gianfranco Bilardi Afonso Ferreira Reinhard Lüling José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monien, B., Schulze, J. (1997). Parallel sparse Cholesky factorization. In: Bilardi, G., Ferreira, A., Lüling, R., Rolim, J. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1997. Lecture Notes in Computer Science, vol 1253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-63138-0_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63138-5

  • Online ISBN: 978-3-540-69157-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation