Question: Please I would like you to rewrite this program in C++ in the best simplest form. #include using namespace std; int main() { // Regular
Please I would like you to rewrite this program in C++ in the best simplest form.
#include
int main() { // Regular Matrix Multication int aRMat[][3] = { { 1,2,3 }, { 4,5,6 } }; int bRMat[][3] = { { 0,2 }, { 1,3 }, { 0,0 } }; int regResult[2][2];
for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { regResult[i][j] = 0; for (int k = 0; k < 3; k++) { regResult[i][j] += aRMat[i][k] * bRMat[k][j]; } } } for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) { cout << regResult[i][j] << " "; } cout << " "; }
cout << " ";
//--------------------------------------------- // Upper Triangular Matrix Multication int aUTMat[][3] = { { 1,2,3 }, { 0,1,2 }, { 0,0,1 } }; int bUTMat[][3] = { { 1,2,3 }, { 0,1,2 }, { 0,0,2 } }; int upTResult[3][3];
for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { upTResult[i][j] = 0; for (int k = 0; k < 3; k++) { upTResult[i][j] += aUTMat[i][k] * bUTMat[k][j]; } } } for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { cout << upTResult[i][j] << " "; } cout << " "; }
cout << " "; //------------------------------------------------ // Lower Triangular Matrix Multication int aLTMat[][3] = { { 1,0,0 }, { 3,1,0 }, { 3,2,1 } }; int bLTMat[][3] = { { 1,0,0 }, { 3,1,0 }, { 4,2,1 } }; int lowTResult[3][3];
for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { upTResult[i][j] = 0; for (int k = 0; k < 3; k++) { lowTResult[i][j] += aLTMat[i][k] * bLTMat[k][j]; } } } for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { cout << lowTResult[i][j] << " "; } cout << " "; }
cout << " ";
//------------------------------------------------ // Diagonal Matrix Multication int adMat[][3] = { { 3,0,0 }, { 0,2,0 }, { 0,0,5 } }; int bdMat[][3] = { { 2,0,0 }, { 0,4,0 }, { 0,0,3 } }; int dResult[3][3];
for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { dResult[i][j] = 0; for (int k = 0; k < 3; k++) { dResult[i][j] += adMat[i][k] * bdMat[k][j]; } } } for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { cout << dResult[i][j] << " "; } cout << " "; }
cout << " "; //------------------------------------------------ // Tri-Diagonal Matrix Multication int aTDMat[][4] = { { 2,3,0,0 }, { 1,4,6,0 }, { 0,2,6,9 }, { 0,0,3,8 } }; int bTDMat[][4] = { { 1,8,0,0 }, { 5,2,9,0 }, { 0,6,3,10 }, { 0,0,7,4 } }; int TDResult[4][4];
for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { TDResult[i][j] = 0; for (int k = 0; k < 4; k++) { TDResult[i][j] += aTDMat[i][k] * bTDMat[k][j]; } } } for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { cout << TDResult[i][j] << " "; } cout << " "; } }
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
