Skip to main content Accessibility help

Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices

  • Faouzi Ben Charrada (a1), Sana Ezouaoui (a1) and Zaher Mahjoub (a1)


This paper addresses a combinatorial optimization problem (COP), namely a variant of the (standard) matrix chain product (MCP) problem where the matrices are square and either dense (i.e. full) or lower/upper triangular. Given a matrix chain of length n, we first present a dynamic programming algorithm (DPA) adapted from the well known standard algorithm and having the same O(n 3) complexity. We then design and analyse two optimal O(n) greedy algorithms leading in general to different optimal solutions i.e. chain parenthesizations. Afterwards, we establish a comparison between these two algorithms based on the parallel computing of the matrix chain product through intra and inter-subchains coarse grain parallelism. Finally, an experimental study illustrates the theoretical parallel performances of the designed algorithms.



Hide All
[1] A.K. Chandra, Computing matrix products in near-optimal time. IBM Research Report, RC 5625 (1975).
[2] Chin, F.Y., An O(n) algorithm for determining a near-optimal computation order of matrix chain products. Commun. ACM 21 (1978) 544549.
[3] T.H. Cormen, C.E. Leicerson, R.L. Rivest and C. Stein, Introduction à l'Algorithmique. Dunod (2002).
[4] M. Cosnard and D. Trystram, Algorithmes et Architectures Parallèles. InterEditions (1993).
[5] H. El-Rewini and M. Abd-El-Bar, Advanced Computer Architecture and Parallel Processing. Wiley (2005).
[6] S. Ezouaoui, F. Ben Charrada and Z. Mahjoub, O(n) instances of the matrix chain product problem solved in linear time, in Proc. of ROADEF'09, Nancy, France (2009).
[7] S.S. Godbole, An efficient computation of matrix chain products. IEEE Trans. Comput. C-22 (1973) 864–866.
[8] Hu, T.C. and Shing, M.T., Computation of matrix chain products. Part I. SIAM J. Comput. 11 (1982) 362373.
[9] Hu, T.C. and Shing, M.T., Computation of matrix chain products. Part II. SIAM J. Comput. 13 (1984) 229251.
[10] V. Kumar, A. Grama, A. Gupta and G. Karypis, Introduction to Parallel Computing – Design and Analysis of Algorithms. The Benjamin/Cummings Pub. Co. (1994).
[11] S. Lakshmivarahan and S.K. Dhall, Analysis and Design of Parallel Algorithms – Arithmetic and Matrix problems. Mc Graw Hill (1990).
[12] Lee, H., Kim, J., Hong, S.J. and Lee, S., Processor allocation and task scheduling of matrix chain products on parallel systems. IEEE Trans. Parallel Distrib. Syst. 14 (2003) 314.
[13] Z. Mahjoub and F. Karoui-Sahtout, Maximal and optimal degrees of parallelism for a parallel algorithm, in Proc. of Transputers'94, IOS Press (1994) 220–233.
[14] Santoro, N., Chain multiplication of matrices of approximately or exactly the same size. Commun. ACM 27 (1984) 152156.
[15] Schoor, A., Fast algorithms for sparse matrix multiplication. Inform. Process. Lett. 15 (1982) 8789.
[16] J. Takche, Complexities of special matrix multiplication problems. Comput. Math. Appl. 12 (1988) 977–989.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

RAIRO - Operations Research
  • ISSN: 0399-0559
  • EISSN: 1290-3868
  • URL: /core/journals/rairo-operations-research
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed