Advertisement

Parallel solution of sparse linear systems

  • John R. Gilbert
  • Hjálmtýr Hafsteinsson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 318)

Abstract

Consider a system of linear equations Ax=b, where A is a symmetric positive definite matrix with arbitrary nonzero structure. We present an efficient CREW parallel algorithm to solve such a system by Cholesky factorization with M* processors, where m* is the number of nonzeros in the Cholesky factor of A. The algorithm has two stages. First is a graph-theoretic structure prediction phase, which runs in time O(log2n). There follows a numerical computation phase, which runs in time proportional to the height of the elimination tree of A times a log factor.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CW87]
    D. Coopersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proc. 19th Annual ACM Symposium on Theory of Computing, pages 1–8, 1987.Google Scholar
  2. [GL81]
    A. George and J.W.H. Liu. Computer Solutions of Large Sparse Positive Definite Systems. Prentice-Hall, 1981.Google Scholar
  3. [GZ87]
    J.R. Gilbert and E. Zmijewski. A parallel graph partitioning algorithm for a message-passing multiprocessor. Technical Report CS-87-803, Cornell University, 1987.Google Scholar
  4. [Liu86]
    J.W.H. Liu. A compact row storage scheme for Cholesky factors using elimination trees. ACM Transactions on Mathematical Software, 12:127–148, 1986.Google Scholar
  5. [Liu87]
    J.W.H. Liu. The role of elimination trees in sparse factorization. Technical Report CS-87-12, York University, 1987.Google Scholar
  6. [MR85]
    G.L. Miller and J.H. Reif. Parallel tree contraction and its application. In Proc. 26th Symposium on Foundations of Computer Science, pages 478–489, 1985.Google Scholar
  7. [OS85]
    D.P. O'Leary and G.W. Stewart. Data-flow algorithms for parallel matrix computations. Communications of the ACM, 28:840–853, 1985.Google Scholar
  8. [PR85]
    V. Pan and J.H. Reif. Efficient parallel solution of linear systems. In Proc. 17th Annual ACM Symposium on Theory of Computing, pages 143–152, 1985.Google Scholar
  9. [PS78]
    F.P. Preparata and D.V. Sarwate. An improved parallel processor bound in fast matrix inversion. Information Processing Letters, 7(3):148–150, 1978.Google Scholar
  10. [RTL76]
    D.J. Rose, R.E. Tarjan, and G.S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5:266–283, 1976.Google Scholar
  11. [Sch82]
    R. Schreiber. A new implementation of sparse Gaussian elimination. ACM Transactions on Mathematical Software, 8:256–276, 1982.Google Scholar
  12. [SV82]
    Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. Journal of Algorithms, 3:57–67, 1982.Google Scholar
  13. [Tar83]
    R.E. Tarjan. Data Structures and Network Algorithms. SIAM, 1983.Google Scholar
  14. [ZG85]
    E. Zmijewski and J.R. Gilbert. Wide quotient trees for finite eliment problems. Technical Report CS-85-673, Cornell University, 1985.Google Scholar
  15. [ZG86]
    E. Zmijewski and J.R. Gilbert. A parallel algorithm for large sparse Cholesky factorization on a multiprocessor. Technical Report CS-86-733, Cornell University, 1986. To appear in Parallel Computing.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • John R. Gilbert
    • 1
    • 2
    • 3
  • Hjálmtýr Hafsteinsson
    • 4
  1. 1.Dept. of Science and TechnologyChristian Michelsen InstituteFantoft, BergenNorway
  2. 2.University of BergenNorway
  3. 3.Cornell UniversityUSA
  4. 4.Computer Science DepartmentCornell UniversityIthacaUSA

Personalised recommendations