矩阵相乘最重要的方法是一般矩阵乘积。它只有在第一个矩阵的列数(column)和第二个矩阵的行数(row)相同时才有意义 。一般单指矩阵乘积时,指的便是一般矩阵乘积。一个m×n的矩阵就是m×n个数排成m行n列的一个数阵。由于它把许多数据紧凑地集中到了一起,所以有时候可以简便地表示一些复杂的模型,如电力系统网络模型。
注意事项
1、当矩阵A的列数(column)等于矩阵B的行数(row)时,A与B可以相乘。
2、矩阵C的行数等于矩阵A的行数,C的列数等于B的列数。
3、乘积C的第m行第n列的元素等于矩阵A的第m行的元素与矩阵B的第n列对应元素乘积之和。
函数接口定义
void outputTwoDArray(towDArrayPtr paraPtr);打印矩阵
void randomizeTwoDArray(towDArrayPtr paraPtr, int paraLowerBound, int paraUpperBound);
赋值函数,给每个节点赋初值
towDArrayPtr matrixMultiply(towDArrayPtr paraPtr1,towDArrayPtr paraPtr2);
判断函数,判断俩矩阵是否能进行矩阵乘
void twoDArrayTest();测试函数
void randomizeTwoDArray(towDArrayPtr paraPtr, int paraLowerBound, int paraUpperBound)
{
int i, j;
for (i = 0; i < paraPtr->rows; i ++)
{
for (j = 0; j < paraPtr->columns; j ++)
{
paraPtr->elements[i][j] = rand() % (paraUpperBound - paraLowerBound) + paraLowerBound;
}
}
}
towDArrayPtr twoDArrayInit(int paraRows,int paraColumns)
{
int i;
towDArrayPtr resultTwoDArray = (towDArrayPtr)malloc(sizeof(struct twoDArray));
resultTwoDArray->rows = paraRows;
resultTwoDArray->columns = paraColumns;
resultTwoDArray->elements = (int**)malloc(paraRows * sizeof(int*));
for(i = 0;i < resultTwoDArray->rows;i ++)
{
resultTwoDArray->elements[i] = (int*)malloc(paraColumns * sizeof(int));
}
return resultTwoDArray;
}
void outputTwoDArray(towDArrayPtr paraPtr)
{
int i,j;
for(i = 0;i < paraPtr->rows;i ++)
{
for(j = 0;j < paraPtr->columns;j ++)
{
printf("%d ",paraPtr->elements[i][j]);
}
printf("\n");
}
printf("\r\n");
}
矩阵乘的函数实现
towDArrayPtr matrixMultiply(towDArrayPtr paraPtr1,towDArrayPtr paraPtr2)
{
int i,j,k,sum;
if(paraPtr1->columns != paraPtr2->rows)
{
printf("这个两个矩阵不能相乘哦0.0\n");
return ;
}
towDArrayPtr resultPtr;
resultPtr = twoDArrayInit(paraPtr1->rows,paraPtr2->columns);
for(i = 0;i < paraPtr1->rows;i ++)
for(j = 0;j < paraPtr2->columns;j ++)
{
sum = 0;
for(k = 0;k < paraPtr1->columns;k ++)
{
sum += paraPtr1->elements[i][k] * paraPtr2->elements[k][j];
}
resultPtr->elements[i][j] = sum;
}
return resultPtr;
}
矩阵乘的函数实现
运行结果
压缩矩阵的转置
CompressedMatrixPtr initCompressedMatrix(int paraRows, int paraColumns, int paraElements, int **paraData) {
int i;
CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
resultPtr->rows = paraRows; //行
resultPtr->columns = paraColumns; //列
resultPtr->numElements = paraElements;
resultPtr->elements = (TriplePtr)malloc(paraElements * sizeof(struct Triple));
//压缩
for (i = 0; i < paraElements; i ++) {
resultPtr->elements[i].i = paraData[i][0];
resultPtr->elements[i].j = paraData[i][1];
resultPtr->elements[i].e = paraData[i][2];
}
return resultPtr;
}
压缩矩阵
CompressedMatrixPtr transposeCompressedMatrix(CompressedMatrixPtr paraPtr) {
//Step 1. 申请空间
int i, tempColumn, tempPosition;
int *tempColumnCounts = (int *)malloc(paraPtr->columns * sizeof(int));
int *tempOffsets = (int *)malloc(paraPtr->columns * sizeof(int));
for (i = 0; i < paraPtr->columns; i ++) {
tempColumnCounts[i] = 0;
}
CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
//行列复值
resultPtr->rows = paraPtr->columns;
resultPtr->columns = paraPtr->rows;
resultPtr->numElements = paraPtr->numElements;
resultPtr->elements = (TriplePtr)malloc(paraPtr->numElements * sizeof(struct Triple));
//扫描计算.
for (i = 0; i < paraPtr->numElements; i ++) {
tempColumnCounts[paraPtr->elements[i].j] ++;
}
tempOffsets[0] = 0;
//从1开始一一增加
for (i = 1; i < paraPtr->columns; i ++) {
tempOffsets[i] = tempOffsets[i - 1] + tempColumnCounts[i - 1];
printf("tempOffsets[%d] = %d \r\n", i, tempOffsets[i]);
}
//Step 3. 同样扫描另外一个
for (i = 0; i < paraPtr->numElements; i ++) {
tempColumn = paraPtr->elements[i].j;
tempPosition = tempOffsets[tempColumn];
resultPtr->elements[tempPosition].i = paraPtr->elements[i].j;
resultPtr->elements[tempPosition].j = paraPtr->elements[i].i;
resultPtr->elements[tempPosition].e = paraPtr->elements[i].e;
tempOffsets[tempColumn]++;
}
//返回
return resultPtr;
}
转置矩阵
void compressedMatrixTest() {
CompressedMatrixPtr tempPtr1, tempPtr2;
int i, j, tempElements;
tempElements = 4;
int **tempMatrix1 = (int **)malloc(tempElements * sizeof(int *));
for (i = 0; i < tempElements; i ++) {
tempMatrix1[i] = (int *)malloc(3 * sizeof(int));
}
int tempMatrix2[4][3] = {{0, 0, 2}, {0, 2, 3}, {2, 0, 5}, {2, 1, 6}};
for (i = 0; i < tempElements; i ++) {
for (j = 0; j < 3; j ++) {
tempMatrix1[i][j] = tempMatrix2[i][j];
}
}
tempPtr1 = initCompressedMatrix(2, 3, 4, tempMatrix1);
printf("After initialization.\r\n");
printCompressedMatrix(tempPtr1);
tempPtr2 = transposeCompressedMatrix(tempPtr1);
printf("After transpose.\r\n");
printCompressedMatrix(tempPtr2);
}
int main() {
compressedMatrixTest();
return 1;
}
测试代码