TY - GEN

T1 - Sequential optimization of matrix chain multiplication relative to different cost functions

AU - Chikalov, Igor

AU - Hussain, Shahid

AU - Moshkov, Mikhail

N1 - KAUST Repository Item: Exported on 2020-10-01

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://hdl.handle.net/10754/564333

UR - http://link.springer.com/10.1007/978-3-642-18381-2_13

UR - http://www.scopus.com/inward/record.url?scp=78751667811&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-18381-2_13

DO - 10.1007/978-3-642-18381-2_13

M3 - Conference contribution

SN - 9783642183805

SP - 157

EP - 165

BT - SOFSEM 2011: Theory and Practice of Computer Science

PB - Springer Nature

ER -