Skip to main content
SpringerLink
Log in

Parallel sparse Gaussian elimination with partial pivoting

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this article, we consider the factorization of a sparse nonsymmetric matrix using Gaussian elimination with partial pivoting on a multiprocessor having a globally-shared memory. The parallel algorithm makes use of a static data structure developed by George, Liu and Ng in [17]. Some numerical experiments on a Sequent Balance 8000 are presented to demonstrate the efficiency of the parallel implementation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I.S. Duff, Full matrix techniques in sparse Gaussian elimination, in:Lecture Notes in Mathematics (912), ed. G.A. Watson (Springer-Verlag, 1982).

  2. I.S. Duff, Parallel implementation of multifrontal schemes, Parallel Computing 3(1986) 193–204.

    Article  MathSciNet  Google Scholar 

  3. I.S. Duff, Multiprocessing a sparse matrix code on the Alliant FX/8, Technical Report CSS 210, Computer Science and Systems Division, Harwell Laboratory, U.K. (1988).

    Google Scholar 

  4. I.S. Duff, N.I.M. Gould, M. Lescrenier and J.K. Reid, The multifrontal method in a parallel environment, Technical Report CSS 211, Computer Science and Systems Division, Harwell Laboratory, U.K. (1987).

    Google Scholar 

  5. I.S. Duff, G. Grimes and J.G. Lewis, Sparse matrix test problems, Technical Report CSS 191, Computer Science and Systems Division, Harwell Laboratory, U.K. (1987).

    Google Scholar 

  6. I.S. Duff and L. Johnsson, The effect of orderings on the parallelization of sparse code, Technical Memorandum, Mathematical and Computer Science Division, Argonne National Laboratory (1986).

  7. I.S. Duff and J.K. Reid, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. on Math. Software 9(1983)302–325.

    Article  Google Scholar 

  8. I.S. Duff and J.K. Reid, The multifrontal solution of unsymmetric sets of linear equations, SIAM J. Sci. Stat. Comput. 5(1984)633–641.

    Article  Google Scholar 

  9. S.C. Eisenstat, M.H. Schultz and A.H. Sherman, Applications of an element model for Gaussian elimination, in:Sparse Matrix Computations, ed. J.R. Bunch and D.J. Rose (Academic Press, 1976) pp. 85–96.

  10. S.C. Eisenstat, M.H. Schultz and A.H. Sherman, Software for sparse Gaussian elimination with limited core storage, in:Sparse Matrix Proceedings, ed. I.S. Duff and G.W. Stewart (SIAM Press, 1978) pp. 135–153.

  11. J.A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal. 10(1973)345–363.

    Article  Google Scholar 

  12. J.A. George, M.T. Heath, J.W.-H. Liu and E.G.-Y. Ng, Solution of sparse positive definite systems on a shared memory multiprocessor, Int. J. Parallel Progr. 15(1986)309–325.

    Article  Google Scholar 

  13. J.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.

    Article  Google Scholar 

  14. J.A. George and J.W.-H. Liu, An optimal algorithm for symbolic factorization of symmetric matrices, SIAM J. Comput. 9(1980)583–593.

    Article  Google Scholar 

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

    Google Scholar 

  16. J.A. George and J.W.-H. Liu, The evolution of the minimum degree ordering algorithm, SIAM Review 31(1989)1–19.

    Article  Google Scholar 

  17. J.A. George, J.W.-H. Liu and E.G.-Y. Ng, A data structure for sparse QR and LU factors, SIAM J. Sci. Stat. Comput. 9(1988)100–121.

    Article  Google Scholar 

  18. J.A. George and E.G.-Y. Ng, Symbolic factorization for sparse Gaussian elimination with partial pivoting, SIAM J. Sci. Stat. Comput. 8(1987)877–898.

    Article  Google Scholar 

  19. J.A. George and E.G.-Y. Ng, On the complexity of sparse QR and LU factorization of finite element matrices, SIAM J. Sci. Stat. Comput. 9(1988)849–861.

    Article  Google Scholar 

  20. G. Golub and C. Van Loan,Matrix Computations (Johns Hopkins Press, 1983).

  21. J.A.G. Jess and H.G.M. Kees, A data structure for parallel L/U decomposition, IEEE Trans. Comput. C-31(1982)231–239.

    Google Scholar 

  22. J.W.-H. Liu, A compact row storage scheme for Cholesky factors using elimination trees, ACM Trans. on Math. Software 12(1986)127–148.

    Article  Google Scholar 

  23. J.W.-H. Liu, Computational models and task scheduling for parallel sparse Cholesky factorization, Parallel Computing 3(1986)327–342.

    Article  Google Scholar 

  24. J.W.-H. Liu, On general row merging schemes for sparse Givens transformations, SIAM J. Sci. Stat. Comput. 7(1986)1190–1211.

    Article  Google Scholar 

  25. J.W.-H. Liu, Reordering sparse matrices for parallel elimination, Technical Report CS-87-01, Dept. of Computer Science, York University (1987).

    Google Scholar 

  26. J.W.-H. Liu, Equivalent sparse matrix reordering by elimination tree rotations, SIAM J. Sci. Stat. Comput. 9(1988)424–444.

    Article  Google Scholar 

  27. F.J. Peters,Sparse Matrices and Substructures (Mathematisch Centrum, Amsterdam, 1980), Mathematical Centre Tracts 119.

    Google Scholar 

  28. R. Schreiber, A new implementation of sparse Gaussian elimination, ACM Trans. on Math. Software 8(1982)256–276.

    Article  Google Scholar 

  29. A.H. Sherman, On the efficient solution of sparse systems of linear and nonlinear equations, Ph.D. Thesis, Yale University (1975).

  30. G.W. Stewart,Introduction to Matrix Computations (Academic Press, New York, 1973).

    Google Scholar 

  31. M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth. 2(1981)77–79.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Alan George

  2. Mathematical Sciences Section, Oak Ridge National Laboratory, 37831-8083, Oak Ridge, TN, USA

    Esmond NG

Authors
  1. Alan George
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Esmond NG
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by the Applied Mathematical Sciences Research Program, Office of Energy Research, U.S. Department of Energy under contract DE-AC05-84OR21400 with Martin Marietta Energy Systems, Inc.

Rights and permissions

Reprints and permissions

About this article

Cite this article

George, A., NG, E. Parallel sparse Gaussian elimination with partial pivoting. Ann Oper Res 22, 219–240 (1990). https://doi.org/10.1007/BF02023054

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02023054

Keywords

Search

Navigation