Skip to main content
SpringerLink
Log in

Parallel Direct Methods for Sparse Linear Systems

  • Chapter
Parallel Numerical Algorithms

Part of the book series: ICASE/LaRC Interdisciplinary Series in Science and Engineering ((ICAS,volume 4))

Abstract

We present an overview of parallel direct methods for solving sparse systems of linear equations, focusing on symmetric positive definite systems. We examine the performance implications of the important differences between dense and sparse systems. Our main emphasis is on parallel implementation of the numerically intensive factorization process, but we also briefly consider other major components of direct methods, including parallel ordering.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Alvardo, F., and Schreiber, R., 1993. “Optimal parallel solution of sparse triangular systems,” SIAM J. Sci. Comput. 14, pp. 446–460.

    MathSciNet  Google Scholar 

  • Anderson, E., and Saad, Y., 1989. “Solving sparse triangular linear systems on parallel computers,” Internat. J. High Speed Comput. 1, pp. 73–95.

    MATH  Google Scholar 

  • Ashcraft, C., 1992. “The fan-both family of column-based distributed Cholesky factorization algorithms,” Tech. Rept. MEA-TR-208, Boeing Computer Services, Seattle, WA.

    Google Scholar 

  • Ashcraft, C., Eisenstat, S., and Liu, J., 1990. “A fan-in algorithm for distributed sparse numerical factorization,” SIAM J. Sci. Stat. Comput. 11, pp. 593–599.

    MathSciNet  MATH  Google Scholar 

  • Ashcraft, C., Eisenstat, S., Liu, J., and Sherman, A., 1990. “A comparison of three column-based distributed sparse factorization schemes,” Tech. Rept. YALEU/DCS/RR-810, Dept. of Computer Science, Yale University, New Haven, CT.

    Google Scholar 

  • Ashcraft, C., Grimes, R., Lewis, J., Peyton, B., and Simon, H., 1987. “Progress in sparse matrix methods for large linear systems on vector supercomputers,” Internat. J. Supercomp. Appl. 1, pp. 10–30.

    Google Scholar 

  • Ashcraft, C., and Liu, J., 1994. “Generalized nested dissection: some recent progress,” Proc. Fifth SIAM Conf. Appl. Linear Algebra, SIAM Publications, Philadelphia, PA, pp. 130–134.

    Google Scholar 

  • Benner, R., Montry, G., and Weigand, G., 1987. “Concurrent multifrontal methods: shared memory, cache, and frontwidth issues,” Internat. J. Supercomp. Appl. 1, pp. 26–44.

    Google Scholar 

  • Conroy, J., Kratzer, S., and Lucas, R., 1994. “Data-parallel sparse matrix factorization,” Proc. Fifth SIAM Conf. Appl. Linear Algebra, SIAM Publications, Philadelphia, PA, pp. 377–381.

    Google Scholar 

  • Demmel, J., Heath, M., and van der Vorst, H., 1993. “Parallel numerical linear algebra,” Acta Numerica 2, pp. 111–197.

    Google Scholar 

  • Dongarra, J., Duff, I., Sorensen, D., and van der Vorst, H., 1991. Solving Linear Systems on Vector and Shared Memory Computers, SIAM Publications, Philadelphia, PA.

    Google Scholar 

  • Dongarra, J., Gustavson, F., and Karp, A., 1984. “Implementing linear algebra algorithms for dense matrices on a vector pipeline machine,” SIAM Review 26, pp. 91–112.

    MathSciNet  MATH  Google Scholar 

  • Duff, I., 1986. “Parallel implementation of multifrontal schemes,” Parallel Computing 3, pp. 193–204.

    MathSciNet  MATH  Google Scholar 

  • Duff, I., Erisman, A., and Reid, J., 1986. Direct Methods for Sparse Matrices, Oxford University Press, Oxford, England.

    MATH  Google Scholar 

  • Duff, I., and Reid, J., 1983. “The multifrontal solution of indefinite sparse symmetric linear equations,” ACM Trans. Math. Software 9, pp. 302–325.

    MathSciNet  MATH  Google Scholar 

  • Duff, I., and Reid, J., 1984. “The multifrontal solution of unsymmetric sets of linear equations,” SIAM J. Sci. Stat. Comput. 5, pp. 633–641.

    MathSciNet  MATH  Google Scholar 

  • George, A., 1973. “Nested dissection of a regular finite element mesh,” SIAM J. Numer. Anal. 10, pp. 345–363.

    MathSciNet  MATH  Google Scholar 

  • George, A., Heath, M., and Liu, J., 1986. “Parallel Cholesky factorization on a shared-memory multiprocessor,” Linear Algebra Appl. 77, pp. 165–187.

    MATH  Google Scholar 

  • George, A., Heath, M., Liu, J., and Ng, E., 1986. “Solution of sparse positive definite systems on a shared memory multiprocessor,” Internat. J. Parallel Programming 15, pp. 309–325.

    MathSciNet  MATH  Google Scholar 

  • George, A., Heath, M., Liu, J., and Ng, E., 1988. “Sparse Cholesky factorization on a local-memory multiprocessor,” SIAM J. Sci. Stat. Comput. 9, pp. 327–340.

    MathSciNet  MATH  Google Scholar 

  • George, A., Heath, M., Liu, J., and Ng, E., 1989. “Solution of sparse positive definite systems on a hypercube,” J. Comp. Appl. Math. 27, pp. 129–156.

    MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  • George, A., and Liu, J., 1989. “The evolution of the minimum degree ordering algorithm,” SIAM Review 31, pp. 1–19.

    MathSciNet  MATH  Google Scholar 

  • George, A., Liu, J., and Ng, E., 1989. “Communication results for parallel sparse Cholesky factorization on a hypercube,” Parallel Computing 10, pp. 287–298.

    MathSciNet  MATH  Google Scholar 

  • Gilbert, J., and Schreiber, R., 1992. “Highly parallel sparse Cholesky factorization,” SIAM J. Sci. Stat. Comput. 13, pp. 1151–1172.

    MathSciNet  MATH  Google Scholar 

  • Golub, G., and Van Loan, C., 1989. Matrix Computations, 2nd edition, Johns Hopkins University Press, Baltimore, MD.

    MATH  Google Scholar 

  • Greenbaum, A., 1986. “Solving sparse triangular linear systems using Fortran with extensions on the NYU Ultracomputer prototype,” Tech. Rept. 99, NYU Ultracomputer Note, New York University.

    Google Scholar 

  • Gupta, A., and Kumar, V., 1994. “A scalable parallel algorithm for sparse matrix factorization,” Tech. Rept. 94-19, Dept. of Computer Science, University of Minnesota, Minneapolis, MN.

    Google Scholar 

  • Heath, M., Ng, E., and Peyton, B., 1991. “Parallel algorithms for sparse linear systems.” SIAM Review 33, pp. 420–460.

    MathSciNet  MATH  Google Scholar 

  • Heath, M., and Raghavan, P., 1992. “A Cartesian nested dissection algorithm,” Tech. Rept. UIUCDCS-R-92-1772, Dept. of Computer Science, University of Illinois, Urbana, IL (to appear in SIAM J. Matrix Anal Appl.).

    Google Scholar 

  • Heath, M., and Raghavan, P., 1994a. “Distributed solution of sparse linear systems,” Proc. Scalable Parallel Libraries Conf., IEEE Computer Society Press, Los Alamitos, CA, pp. 114–122.

    Google Scholar 

  • Heath, M., and Raghavan, P., 1994b. “Performance of a fully parallel sparse solver,” Proc. Scalable High-Performance Computing Conf., IEEE Computer Society Press, Los Alamitos, CA, pp. 334–341.

    Google Scholar 

  • Heath, M., and Romine, C., 1988. “Parallel solution of triangular systems on distributed-memory multiprocessors,” SIAM J. Sci. Stat. Comput. 9, pp. 558–588.

    MathSciNet  MATH  Google Scholar 

  • Hendrickson, B., and Leland, R., 1993. “The Chaco user’s guide, version 1.0,” Tech. Rept. SAND93-2339, Sandia National Laboratories, Albuquerque, NM.

    Google Scholar 

  • Irons, B., 1970. “A frontal solution program for finite element analysis,” Internat. J. Numer. Meth. Engrg. 2, pp. 5–32.

    MATH  Google Scholar 

  • Karypis, G., and Kumar, V., 1994. “A high performance sparse Cholesky factorization algorithm for scalable parallel computers,” Tech. Rept. 94-41, Dept. of Computer Science, University of Minnesota, Minneapolis, MN.

    Google Scholar 

  • Jess, J., and Kees, H., 1982. “A data structure for parallel L/U decomposition,” IEEE Trans. Comput. C-31, pp. 231–239.

    MathSciNet  Google Scholar 

  • Lewis, J., Peyton, B., and Pothen, A., 1989. “A fast algorithm for reordering sparse matrices for parallel factorization,” SIAM J. Sci Stat Comput 10, pp. 1156–1173.

    MathSciNet  Google Scholar 

  • Liu, J., 1986. “Computational models and task scheduling for parallel sparse Cholesky factorization,” Parallel Computing 3, pp. 327–342.

    MATH  Google Scholar 

  • Liu, J., 1989. “Reordering sparse matrices for parallel elimination,” Parallel Computing 11, pp. 73–91.

    MathSciNet  MATH  Google Scholar 

  • Liu, J., 1990. “The role of elimination trees in sparse factorization,” SIAM J. Matrix Anal Appl. 11, pp. 134–172.

    MathSciNet  MATH  Google Scholar 

  • Liu, J., 1992. “The multifrontal method for sparse matrix solution: theory and practice,” SIAM Review 34, pp. 82–109.

    MathSciNet  MATH  Google Scholar 

  • Lucas, R., Blank, W., and Tieman, J., 1987. “A parallel solution method for large sparse systems of equations,” IEEE Trans. Computer Aided Design CAD-6, pp. 981–991.

    Google Scholar 

  • Miller, G., Teng, S., and Vavasis, S., 1991. “A unified geometric approach to graph separators,” Proc. 32nd Ann. Symp. Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, pp. 538–547.

    Google Scholar 

  • Mu, M., and Rice, J., 1992. “A grid based subtree-subcube assignment strategy for solving partial differential equations on hypercubes,” SIAM J. Sci. Stat Comput 13, pp. 826–839.

    MathSciNet  MATH  Google Scholar 

  • Ortega, J., 1988. Introduction to Parallel and Vector Solution of Linear Systems, Plenum Press, New York.

    MATH  Google Scholar 

  • Pothen, A., Simon, H., and Liou, K., 1990. “Partitioning sparse matrices with eigenvectors of graphs,” SIAM J. Matrix Anal. Appl. 11, pp. 430–452.

    MathSciNet  MATH  Google Scholar 

  • Raghavan, P., 1993a. “Line and plane separators,” Tech. Rept. UIUCDCS-R-93-1794, Dept. of Computer Science, University of Illinois, Urbana, IL.

    Google Scholar 

  • Raghavan, P., 1993b. “Distributed sparse Gaussian elimination and orthogonal factorization,” Tech. Rept. UIUCDCS-R-93-1818, Dept. of Computer Science, University of Illinois, Urbana, IL.

    Google Scholar 

  • Robert, Y., 1990. The Impact of Vector and Parallel Architectures on the Gaussian Elimination Algorithm, John Wiley and Sons, New York.

    Google Scholar 

  • Rothberg, E., 1994. “Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers,” Proc. Scalable High-Performance Computing Conf., IEEE Computer Society Press, Los Alamitos, CA, pp. 324–333.

    Google Scholar 

  • Rothberg, E., and Gupta, A., 1992. “Parallel ICCG on a hierarchical memory multiprocessor — addressing the triangular solve bottleneck,” Parallel Computing 18, pp. 719–741.

    MATH  Google Scholar 

  • Saltz, J., 1990. “Aggregation methods for solving sparse triangular systems on multiprocessors,” SIAM J. Sci. Stat. Comput. 11, pp. 123–144.

    MathSciNet  MATH  Google Scholar 

  • Schreiber, R., 1993. “Scalability of sparse direct solvers,” in Graph Theory and Sparse Matrix Computation, Springer-Verlag, pp. 191–209.

    Google Scholar 

  • Speelpenning, B., 1978. “The generalized element method,” Tech. Rept. UIUCDCS-R-78-946, Dept. of Computer Science, University of Illinois, Urbana, IL.

    Google Scholar 

  • Williams, R., 1991. “Performance of dynamic load balancing algorithms for unstructured mesh calculations,” Concurrency: Practice and Experience 3, pp. 457–481.

    Google Scholar 

  • Zmijewski, E., 1989. “Limiting communication in parallel sparse Cholesky factorization,” Tech. Rept. TRCS89-18, Dept. of Computer Science, University of California, Santa Barbara, CA.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and NCSA, University of Illinois, Urbana, IL, 61801-2300, USA

    Michael T. Heath

Authors
  1. Michael T. Heath
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Old Dominion University, Norfolk, Virginia, USA

    David E. Keyes

  2. University of Minnesota, Minneapolis, Minnesota, USA

    Ahmed Sameh

  3. ICASE, Hampton, Virginia, USA

    David E. Keyes  & V. Venkatakrishnan  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Heath, M.T. (1997). Parallel Direct Methods for Sparse Linear Systems. In: Keyes, D.E., Sameh, A., Venkatakrishnan, V. (eds) Parallel Numerical Algorithms. ICASE/LaRC Interdisciplinary Series in Science and Engineering, vol 4. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5412-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-5412-3_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6277-0

  • Online ISBN: 978-94-011-5412-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation