Journal of Mathematical Modelling and Algorithms

, Volume 2, Issue 3, pp 217–234 | Cite as

Efficient and Optimal Parallel Algorithms for Cholesky Decomposition

  • Eunice E. Santos
  • Pei-Yue Chu


In this paper, we consider the problem of developing efficient and optimal parallel algorithms for Cholesky decomposition. We design our algorithms based on different data layouts and methods. We thereotically analyze the run-time of each algorithm. In order to determine the optimality of the algorithms designed, we derive theoretical lower bounds on running time based on initial data layout and compare them against the algorithmic run-times. To address portability, we design our algorithms and perform complexity analysis on the LogP model. Lastly, we implement our algorithms and analyze performance data.

Cholesky decomposition parallel complexity algorithms and complexity LogP model numerical linear algebra 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Eunice E. Santos
    • 1
  • Pei-Yue Chu
    • 2
  1. 1.Department of Computer ScienceVirginia Polytechnic Institute & State UniversityBlacksburgU.S.A
  2. 2.Department of Computer Science and EngineeringLehigh UniversityBethlehemU.S.A

Personalised recommendations