i hope so its answer will be o(n) due to parallel computation.
using mpi we have to communicate one process to the another so mostly it will be like tat....
not sure...
Chat with our AI personalities
ghanto
The matrix multiplication in c language : c program is used to multiply matrices with two dimensional array. This program multiplies two matrices which will be entered by the user.
Tthe matrix multiplication A*Bis defined only if the number of columns in the first matrix, A, is the same as the number of rows in the second, B. Note that the condition for the multiplication of B*A will be the reverse.
scalar multiplication
Using the method derived from the usual definition using the minors, the complexity is O(n!). But it seems that one could just do the Gaussian elimination on the matrix, turning the matrix into a triangular one while keeping track of any neccessary row swaps, and then just multiply the values of the diagona. This method would get the complexity of O(n*n).