Description: Given n matrices A1, A2, ..., An, which, Ai and Aj+1 is a mere of, i = 1,2, ..., n-1. Your task is to determine the matrix multiplication operation with the order, the computation of the n matrix product A1A2 ... An even when the multiplication of the total number of elements to a minimum. For example: three matrices A1, A2, A3, bands were 10 × 100,100 × 5,5 × 50, the product A1A2A3 even when calculated according to (A1A2) A3 multiplication of the number of elements required to achieve at least for 7500.
To Search:
File list (Check if you may need any files):
ADSF\ADSF.dsp
....\ADSF.dsw
....\ADSF.ncb
....\ADSF.opt
....\DF.CPP
....\Debug
ADSF
Download