By Topic

On Efficient Computation of Matrix Chain Products

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sadashiva S. Godbole ; Babcock & Wilcox Company, Lynchburg Research Center, Lynchburg, Va. 24505.

It is pointed out that the number of scalar multiplications (additions) required to evaluate a matrix chain product depends on the sequence in which the associative law of matrix multiplication is applied. An algorithm is developed to find the optimum sequence that minimizes the number of scalar multiplications. A program is written for use on the CDC 6600 computer to implement this algorithm and also to carry out the chain product according to the optimum sequence. Several examples are included to illustrate the algorithm. The saving in computation and improvement in accuracy that can result from the use of this algorithm can be quite significant for chain products of large arrays and in iterative solutions of matrix equations involving chain products.

Published in:

IEEE Transactions on Computers  (Volume:C-22 ,  Issue: 9 )