Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 2011: SOFSEM 2011: Theory and Practice of Computer Science pp 157–165Cite as

Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6543))

Abstract

In this paper, we present a methodology to optimize matrix chain multiplication sequentially relative to different cost functions such as total number of scalar multiplications, communication overhead in a multiprocessor environment, etc. For n matrices our optimization procedure requires O(n 3) arithmetic operations per one cost function. This work is done in the framework of a dynamic programming extension that allows sequential optimization relative to different criteria.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (1957)

    MATH  Google Scholar 

  2. Moshkov, M., Chikalov, I.: On algorithm for constructing of decision trees with minimal depth. Fundam. Inf. 41(3), 295–299 (2000)

    MathSciNet  MATH  Google Scholar 

  3. Moshkov, M., Chikalov, I.: Consecutive optimization of decision trees concerning various complexity measures. Fundam. Inf. 61(2), 87–96 (2003)

    MathSciNet  MATH  Google Scholar 

  4. Chikalov, I., Moshkov, M., Zelentsova, M.: On optimization of decision trees. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets IV. LNCS, vol. 3700, pp. 18–36. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  6. Alsuwaiyel, M.H.: Algorithms: Design Techniques and Analysis. World Scientific, Singapore (1999)

    Book  MATH  Google Scholar 

  7. Godbole, S.: On efficient computation of matrix chain products. IEEE Trans. Comput. 22(9), 864–866 (1973)

    Article  Google Scholar 

  8. Hu, T.C., Shing, M.T.: Computation of matrix chain products. Part I. SIAM J. Comput. 11(2), 362–373 (1982)

    Article  MATH  Google Scholar 

  9. Chikalov, I.V.: On algorithm for constructing of decision trees with minimal number of nodes. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 139–143. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, 23955-6900, Saudi Arabia

    Igor Chikalov, Shahid Hussain & Mikhail Moshkov

Authors
  1. Igor Chikalov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shahid Hussain
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mikhail Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ivana Černá, Department of Computer Science, Faculty of Informatics, Faculty of Informatics, Masaryk University, Botanicka 68 a, 602 00, Brno, Czech Republic

    Ivana Černá

  2. Department of Software Engineering, University of Szeged, Árpád tér 2., 6720, Szeged, Hungary

    Tibor Gyimóthy

  3. Informationstechnologie und Ausbildung, CAB F 16, F 13.1, Universitätstraße 6, ETH Zürich, 8092, Zürich, Switzerland

    Juraj Hromkovič

  4. School of History and Anthropology, Queen’s University, 15 University Square, BT7 1NN, Belfast, UK

    Keith Jefferey

  5. Department of Computer Science, Comenius University, 84248, Bratislava, Slovakia

    Rastislav Králović

  6. EURECOM, 2229 2229 Route des Crêtes, BP 193, 06904, Sophia Antipolis cedex, France

    Marko Vukolić

  7. Institute of Theoretical Computer Science, ETH Zürich, IFW E49.1, Haldeneggsteig 4, 8092, Zürich, Switzerland

    Stefan Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chikalov, I., Hussain, S., Moshkov, M. (2011). Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions. In: Černá, I., et al. SOFSEM 2011: Theory and Practice of Computer Science. SOFSEM 2011. Lecture Notes in Computer Science, vol 6543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18381-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18381-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18380-5

  • Online ISBN: 978-3-642-18381-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation