Sequential optimization of matrix chain multiplication relative to different cost functions

Handle URI:
http://hdl.handle.net/10754/564333
Title:
Sequential optimization of matrix chain multiplication relative to different cost functions
Authors:
Chikalov, Igor; Hussain, Shahid ( 0000-0002-1698-2809 ) ; Moshkov, Mikhail ( 0000-0003-0085-9483 )
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.
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
Publisher:
Springer Science + Business Media
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
Issue Date:
2011
DOI:
10.1007/978-3-642-18381-2_13
Type:
Conference Paper
ISSN:
03029743
ISBN:
9783642183805
Appears in Collections:
Conference Papers; Applied Mathematics and Computational Science Program; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorChikalov, Igoren
dc.contributor.authorHussain, Shahiden
dc.contributor.authorMoshkov, Mikhailen
dc.date.accessioned2015-08-04T06:24:00Zen
dc.date.available2015-08-04T06:24:00Zen
dc.date.issued2011en
dc.identifier.isbn9783642183805en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-18381-2_13en
dc.identifier.urihttp://hdl.handle.net/10754/564333en
dc.description.abstractIn 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.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectcost functionsen
dc.subjectDynamic programmingen
dc.subjectmatrix chain multiplicationen
dc.subjectsequential optimizationen
dc.titleSequential optimization of matrix chain multiplication relative to different cost functionsen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Groupen
dc.contributor.departmentComputer Science Programen
dc.identifier.journalSOFSEM 2011: Theory and Practice of Computer Scienceen
dc.conference.date22 January 2011 through 28 January 2011en
dc.conference.name37th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2011en
dc.conference.locationNovy Smokovecen
kaust.authorChikalov, Igoren
kaust.authorHussain, Shahiden
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.