#include <stdio.h>
#define N 2
//matrix + matrix
void plus( int t[N/2][N/2], int r[N/2][N/2], int s[N/2][N/2] )
{
int i, j;
for( i = 0; i < N / 2; i++ )
{
for( j = 0; j < N / 2; j++ )
{
t[i][j] = r[i][j] + s[i][j];
}
}
}
//matrix - matrix
void minus( int t[N/2][N/2], int r[N/2][N/2], int s[N/2][N/2] )
{
int i, j;
for( i = 0; i < N / 2; i++ )
{
for( j = 0; j < N / 2; j++ )
{
t[i][j] = r[i][j] - s[i][j];
}
}
}
//matrix * matrix
void mul( int t[N/2][N/2], int r[N/2][N/2], int s[N/2][N/2] )
{
int i, j, k;
for( i = 0; i < N / 2; i++ )
{
for( j = 0; j < N / 2; j++ )
{
t[i][j] = 0;
for( k = 0; k < N / 2; k++ )
{
t[i][j] += r[i][k] * s[k][j];
用斯特拉森算法求解矩阵乘法
最新推荐文章于 2024-05-24 09:22:23 发布
