Skip to main content
SpringerLink
Log in

ParIC: A Family of Parallel Incomplete Cholesky Preconditioners

  • Conference paper
  • First Online:
High Performance Computing and Networking (HPCN-Europe 2000)

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

Included in the following conference series:

Abstract

A class of parallel incomplete factorization preconditionings for the solution of large linear systems is investigated. The approach may be regarded as a generalized domain decomposition method. Adjacent subdomains have to communicate during the setting up of the preconditioner, and during the application of the preconditioner. Overlap is not necessary to achieve high performance. Fill-in levels are considered in a global way. If necessary, the technique may be implemented as a global re-ordering of the unknowns. Experimental results are reported for two-dimensional problems.

Research supported by the Commission of the European Community, under contract nr. 25009, within the ESPRIT IV project.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. R.F. Barret, M. Berry, T.F. Chan, J. Demmel, J. Donato, J.J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods (SIAM, Philadelphia, 1994).

    Google Scholar 

  2. R. Beauwens, L. Dujacquier, S. Hitimana and M. Magolu monga Made: MILU factorizations for 2-processor orderings. In: I.T. Dimov, Bl. Sendov and P.S. Vassilevski (eds.), Advances in Numerical Methods and Applications \( \mathcal{O} \)(h 3) (World Scientific, Singapore, 1994) 26–34.

    Google Scholar 

  3. S. Doi and A. Lichnewsky: A graph-theory approach for analyzing the effects of ordering on ILU preconditioning. INRIA report 1452, INRIA-Rocquencourt, France, 1991.

    Google Scholar 

  4. S. Doi and T. Washio: Ordering strategies and related techniques to overcome the trade-off between parallelism and convergence in incomplete factorizations. Parallel Comput. 25, (1999) 1995–2014.

    Article  MathSciNet  Google Scholar 

  5. J.J. Dongarra, I.S. Duff, D.C. Sorensen and H.A. van der Vorst: Numerical Linear Algebra for High-Performance Computers (SIAM, Philadelphia, 1998).

    MATH  Google Scholar 

  6. I.S. Duff and G.A. Meurant: The effect of ordering on preconditioned conjugate gradients. BIT 29, (1989) 635–657.

    Article  MATH  MathSciNet  Google Scholar 

  7. I.S. Duff and H.A. van der Vorst: Developments and Trends in the Parallel Solution of Linear Systems. Parallel Comput. 25, (1999) 1931–1970.

    Article  MathSciNet  Google Scholar 

  8. G.H. Golub and C.F. van Loan: Matrix Computations (third ed.) (The John Hopkins University Press, Baltimore, Maryland, 1996).

    MATH  Google Scholar 

  9. G. Haase: Parallel incomplete Cholesky preconditioners based on the nonoverlapping data distribution. Parallel Comput. 24, (1998) 1685–1703.

    Article  MathSciNet  Google Scholar 

  10. M. Magolu monga Made: Implementation of parallel block preconditionings on a transputer-based multiprocessor. Future Generation Computer Systems 11, (1995) 167–173.

    Article  Google Scholar 

  11. M. Magolu monga Made: Taking advantage of the potentialities of dynamically modified block incomplete factorizations. SIAM J. Sci. Comput. 19, (1998) 1083–1108.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Magolu monga Made and B. Polman: Efficient planewise like preconditioners to cope with 3D problems. Numer. Linear Algebra Appl. 6, (1999) 379–406.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Magolu monga Made and H.A. van der Vorst: Parallel incomplete factorizations with pseudo-overlapped subdomains. Technical Report, Service des Milieux Continus, Université Libre de Bruxelles, February 2000.

    Google Scholar 

  14. J.A. Meijerink and H.A. van der Vorst: An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comp. 31, (1977) 148–162.

    Article  MATH  MathSciNet  Google Scholar 

  15. J.A. Meijerink and H.A. van der Vorst: Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems. J. Comp. Physics 44, (1981) 134–155.

    Article  MATH  Google Scholar 

  16. Y. Notay: An efficient Parallel Discrete PDE Solver. Parallel Comput. 21, (1995) 1725–1748.

    Article  MathSciNet  Google Scholar 

  17. Y. Notay and A. Van de Velde: Coarse grid acceleration of parallel incomplete preconditioners. In: S. Margenov and P. Vassilevski, (eds.), Iterative Methods in Linear Algebra II. IMACS series in Computational and Applied Mathematics 3, (1996) 106–130.

    Google Scholar 

  18. B.F. Smith, P.E. Bjorstad and D. Gropp: Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations (Cambridge University Press, Cambridge, 1996).

    MATH  Google Scholar 

  19. H.A. van der Vorst: High performance preconditioning. SIAM J. Sci. Statist. Comput. 10, (1989) 1174–1185.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Service des Milieux Continus, Université Libre de Bruxelles, CP 194/550, avenue F.D. Roosevelt, B-1050, Brussels, Belgium

    Mardochée Magolu monga Made

  2. Mathematical Institute, Utrecht University, Mailbox 80.010, 3508, Utrecht, The Netherlands

    Henk A. van der Vorst

Authors
  1. Mardochée Magolu monga Made
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henk A. van der Vorst
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science and Academic Computer Center CYFRONET, University of Mining and Metallurgy (AGH), al. Mickiewicza 30, 30-059, Cracow, Poland

    Marian Bubak

  2. Faculteit der Natuurwetenschappen, Wiskunde en Informatica, Universiteit van Amsterdam, 1098 SJ, Amsterdam, The Netherlands

    Hamideh Afsarmanesh  & Bob Hertzberger  & 

  3. California Institute of Technology, Caltech 158-79, Pasadena, CA, 91125, USA

    Roy Williams

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Made, M.M.m., van der Vorst, H.A. (2000). ParIC: A Family of Parallel Incomplete Cholesky Preconditioners. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45492-6_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67553-2

  • Online ISBN: 978-3-540-45492-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation