• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Sequential optimization of matrix chain multiplication relative to different cost functions

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Chikalov, Igor
    Hussain, Shahid cc
    Moshkov, Mikhail cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Applied Mathematics and Computational Science Program
    Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
    Computer Science Program
    Date
    2011
    Permanent link to this record
    http://hdl.handle.net/10754/564333
    
    Metadata
    Show full item record
    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. © 2011 Springer-Verlag Berlin Heidelberg.
    Citation
    Chikalov, I., Hussain, S., & Moshkov, M. (2011). Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions. Lecture Notes in Computer Science, 157–165. doi:10.1007/978-3-642-18381-2_13
    Publisher
    Springer Nature
    Journal
    SOFSEM 2011: Theory and Practice of Computer Science
    Conference/Event name
    37th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2011
    ISBN
    9783642183805
    DOI
    10.1007/978-3-642-18381-2_13
    ae974a485f413a2113503eed53cd6c53
    10.1007/978-3-642-18381-2_13
    Scopus Count
    Collections
    Conference Papers; Applied Mathematics and Computational Science Program; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.