您好,欢迎来到微智科技网。
搜索
您的当前位置:首页矩阵相乘

矩阵相乘

来源:微智科技网
矩阵相乘

#include usingnamespace std; constint a = 4, b = 4, c = 2; double C[a][c];

void maray_multiply(double A[][b], double B[][c]); int main() { int i, j;

double X[a][b] = {

{ 0.0,1.0,1.0,1.0 }, { 1.0,0.0,1.0,1.0 }, { 1.0,1.0,0.0,1.0 }, { 1.0,1.0,1.0,0.0 }, };

double Y[b][c] = {

{ 1.0, 10.0 }, { 2.0, 20.0 },

{ 3.0, 30.0 }, { 4.0, 40.0 } };

maray_multiply(X,Y); for (i = 0; i < a; i++) {

for (j = 0; j < c; j++) cout << C[i][j] <<\"\\"; cout <<\"\\n\"; } return 0; }

void maray_multiply(doubleA[][b], doubleB[][c]) {

int i, j, k;

for (i = 0; i < a; i++) {

for (j = 0; j < c; j++) {

C[i][j] = 0.0;

for (k = 0; k C[i][j] = C[i][j] + A[i][k] * B[k][j]; } } }

因篇幅问题不能全部显示,请点此查看更多更全内容

Copyright © 2019- 7swz.com 版权所有 赣ICP备2024042798号-8

违法及侵权请联系:TEL:199 18 7713 E-MAIL:2724546146@qq.com

本站由北京市万商天勤律师事务所王兴未律师提供法律服务