Sequential optimization of matrix chain multiplication relative to different cost functions
Type
Conference PaperKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionApplied Mathematics and Computational Science Program
Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Computer Science Program
Date
2011Permanent link to this record
http://hdl.handle.net/10754/564333
Metadata
Show full item recordAbstract
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_13Publisher
Springer NatureConference/Event name
37th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2011ISBN
9783642183805ae974a485f413a2113503eed53cd6c53
10.1007/978-3-642-18381-2_13